The circulant hash revisited

DOI10.1515/jmc-2018-0054zbMath1473.94092OpenAlexW3111411015MaRDI QIDQ2033521

Samuel Neves, Filipe Araujo

Publication date: 17 June 2021

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2018-0054

zbMATH Keywords

almost universal hashcirculant hashdata-dependent rotation

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Data structures (68P05) Authentication, digital signatures and secret sharing (94A62)

Uses Software

• Poly1305-AES

Cites Work

• Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)
• Algebraic properties of cellular automata
• Structure of parallel multipliers for a class of fields \(GF(2^ m)\)
• New hash functions and their use in authentication and set equality
• Universal classes of hash functions
• On the construction of pseudorandom permutations: Luby-Rackoff revisited
• Bucket hashing and its application to fast message authentication
• Inversion of circulant matrices over $\mathbf{Z}_m$
• A Short Universal Hash Function from Bit Rotation, and Applications to Blockcipher Modes
• The Software Performance of Authenticated-Encryption Modes
• On the Rank of the Matrix f (A ) and the Enumeration of Certain Matrices over a Finite Field
• On Fast and Provably Secure Message Authentication Based on Universal Hashing
• Efficient randomized pattern-matching algorithms
• Codes Which Detect Deception
• Faster Luby-Rackoff ciphers
• Universal hashing and k-wise independent random variables via integer arithmetic without primes
• The invertibility of the XOR of rotations of a binary word
• Fast Software Encryption
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item