Results 201 to 210 of about 1,013,929 (223)
Some of the next articles are maybe not open access.
On the Universal Hash Functions in Luby-Rackoff Cipher
2003It is known that a super-pseudorandom permutation on 2n bits can be obtained from a random function f on n bits and two bisymmetric and AXU hash functions h1 and h2 on n bits. It has a Feistel type structure which is usually denoted by φ(h1, f, f, h2).
Tetsu Iwata, Kaoru Kurosawa
openaire +2 more sources
A new multi-linear universal hash family
Designs, Codes and Cryptography, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Multimixer-156: Universal Keyed Hashing Based on Integer Multiplication and Cyclic Shift
International Conference on Cryptology in India, 2023Koustabh Ghosh +2 more
semanticscholar +1 more source
On the program size of perfect and universal hash functions
23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), 1982We address the question of program size of of perfect and universal hash functions. We prove matching upper and lower bounds (up to constant factors) on program size. Furthermore, we show that minimum or nearly minimum size programs can be found efficiently.
openaire +2 more sources
Universal Hashing via Integer Arithmetic Without Primes, Revisited
Adventures Between Lower Bounds and Higher Altitudes, 2018Martin Dietzfelbinger
semanticscholar +1 more source
The Multi-user Security of MACs via Universal Hashing in the Ideal Cipher Model
The Cryptographer's Track at RSA ConferenceYusuke Naito
semanticscholar +1 more source
A trade-off between collision probability and key size in universal hashing using polynomials
Des. Codes Cryptogr., 2011P. Sarkar
semanticscholar +1 more source