|
|
Please login using the form on menu list.
It is required to login for Full-Text PDF.
|
On the Universal Hash Functions in Luby-Rackoff Cipher
Tetsu IWATA
Kaoru KUROSAWA
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E87-A No.1 pp.60-66
Publication Date: 2004/01/01
Online ISSN:
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)
Category: Symmetric Cipher
Keyword:
cryptography,
block cipher,
Feistel permutation,
super-pseudorandomness,
Full Text: PDF(252.8KB)
Summary:
It is known that a super-pseudorandom permutation on 2n bits can be obtained from a random function f on n bits and two bi-symmetric 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). Bi-symmetric and AXU hash functions h1,h2 are much weaker primitives than a random function f and they can be computed much faster than random functions. This paper shows that we can further weaken the condition on h1.
|
|
