On the Universal Hash Functions in Luby-Rackoff Cipher

Tetsu IWATA; Kaoru KUROSAWA

On the Universal Hash Functions in Luby-Rackoff Cipher

Tetsu IWATA, Kaoru KUROSAWA

Full Text Views

0

Share
Cite this

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 h₁ and h₂ on n bits. It has a Feistel type structure which is usually denoted by φ(h₁,f, f, h₂). Bi-symmetric and AXU hash functions h₁,h₂ 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 h₁.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.1 pp.60-66

Publication Date: 2004/01/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security)

Category: Symmetric Cipher

Cite this

Copy

Tetsu IWATA, Kaoru KUROSAWA, "On the Universal Hash Functions in Luby-Rackoff Cipher" in IEICE TRANSACTIONS on Fundamentals, vol. E87-A, no. 1, pp. 60-66, January 2004, doi: .
Abstract: 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 h₁ and h₂ on n bits. It has a Feistel type structure which is usually denoted by φ(h₁,f, f, h₂). Bi-symmetric and AXU hash functions h₁,h₂ 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 h₁.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e87-a_1_60/_p

Copy

@ARTICLE{e87-a_1_60,
author={Tetsu IWATA, Kaoru KUROSAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Universal Hash Functions in Luby-Rackoff Cipher},
year={2004},
volume={E87-A},
number={1},
pages={60-66},
abstract={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 h₁ and h₂ on n bits. It has a Feistel type structure which is usually denoted by φ(h₁,f, f, h₂). Bi-symmetric and AXU hash functions h₁,h₂ 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 h₁.},
keywords={},
doi={},
ISSN={},
month={January},}

Copy

TY - JOUR
TI - On the Universal Hash Functions in Luby-Rackoff Cipher
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 60
EP - 66
AU - Tetsu IWATA
AU - Kaoru KUROSAWA
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2004
AB - 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 h₁ and h₂ on n bits. It has a Feistel type structure which is usually denoted by φ(h₁,f, f, h₂). Bi-symmetric and AXU hash functions h₁,h₂ 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 h₁.
ER -