Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,710,552 papers from all fields of science
Search
Sign In
Create Free Account
SipHash
Known as:
Sip Hash
SipHash is an Add-Rotate-Xor (ARX) based family of pseudorandom functions created by Jean-Philippe Aumasson and Daniel J. Bernstein in 2012.
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
Block cipher
Cryptographic hash function
Denial-of-service attack
Hash function
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
ARX-KW, a family of key wrapping constructions using SipHash and ChaCha
S. Shinichi
IACR Cryptology ePrint Archive
2020
Corpus ID: 210876409
ARX-KW is a family of key wrapping construction based on add-rotate-xor primitives: the pseudo-random function SipHash for…
Expand
2017
2017
Light-weight hash algorithms using GRP instruction
Mahaveer Prasad Soni
,
A. R. Pais
International Conference on Security of…
2017
Corpus ID: 3464450
A cryptographic hash fuction is used to protect the authenticity of information. Commonly used hash functions require huge…
Expand
2016
2016
Lightweight Cryptography on ARM A presentation proposal
Rafael J. Cruz
,
Tiago B. S. Reis
,
Diego F. Aranha
,
Julio López
,
H. Patil
2016
Corpus ID: 85550856
We present multiple contributions to the efficient software implementation of cryp tographic algorithms for ARM devices. The…
Expand
2015
2015
Chaskey: a Lightweight MAC Algorithm for Microcontrollers
N. Mouha
2015
Corpus ID: 3142750
We propose Chaskey: a very efficient Message Authentication Code (MAC) algorithm for 32-bit microcontrollers. It is intended for…
Expand
2015
2015
Differential and Linear Cryptanalysis of ARX with Partitioning - Application to FEAL and Chaskey
G. Leurent
IACR Cryptology ePrint Archive
2015
Corpus ID: 7651078
In this work, we refine a partitioning technique recently proposed by Biham and Carmeli to improve the linear cryptanalysis of…
Expand
2013
2013
The Coincidence Test : a Bayesian Statistical Test for Block Ciphers and MACs
A. Kaminsky
2013
Corpus ID: 12238243
A block cipher or message authentication code (MAC) should behave as a random mapping. The mapping’s randomness can be evaluated…
Expand
2013
2013
M.S. Project Proposal SAT Based Attacks on SipHash
A. Kaminsky
2013
Corpus ID: 63742743
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE