✦ LIBER ✦

Non-cryptographic primitive for pseudorandom permutation

✍ Scribed by Tetsu Iwata; Tomonobu Yoshino; Kaoru Kurosawa

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 321 KB
Volume: 306
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00245-7

No coin nor oath required. For personal study only.

✦ Synopsis

Four round Feistel permutation (like DES) is super-pseudorandom if each round function is random or a secret universal hash function. A similar result is known for ÿve round MISTY type permutation. It seems that each round function must be at least either random or secret in both cases.

In this paper, however, we show that the second round permutation g in ÿve round MISTY type permutation need not be cryptographic at all, i.e., no randomness nor secrecy is required. g has only to satisfy that g(x)⊕x = g(x )⊕x for any x = x . This is the ÿrst example such that a non-cryptographic primitive is substituted to construct the minimum round super-pseudorandom permutation. Further we show e cient constructions of super-pseudorandom permutations by using above mentioned g.

📜 SIMILAR VOLUMES

The Impossibility of Basing One-Way Perm

The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives

✍ Yan-Cheng Chang; Chun-Yuan Hsiao; Chi-Jen Lu 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 251 KB

The Black-Box Model for Cryptographic Pr

The Black-Box Model for Cryptographic Primitives

✍ Claus Peter Schnorr; Serge Vaudenay 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 151 KB

Asymptotic Results for Primitive Permuta

Asymptotic Results for Primitive Permutation Groups

✍ L Pyber; A Shalev 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 216 KB

We prove that the number of conjugacy classes of primitive permutation groups cŽ n. ## Ž . of degree n is at most n , where n denotes the maximal exponent occurring in the prime factorization of n. This result is applied to investigating maximal subgroup growth of infinite groups. We then proceed

Primitive parabolic permutation represen

Primitive parabolic permutation representations for finite symplectic groups

✍ V. V. Korableva 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 325 KB

Tree Automata for Detecting Attacks on P

Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives

✍ Yohan Boichut; Pierre-Cyrille Héam; Olga Kouchnarenko 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 375 KB

Asymptotic Results for Primitive Permuta

Asymptotic Results for Primitive Permutation Groups and Irreducible Linear Groups

✍ A. Lucchini; F. Menegazzo; M. Morigi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 135 KB

A well-developed branch of asymptotic group theory studies the properties of classes of linear and permutation groups as functions of their degree. We refer to the surveys of Cameron [4] and Pyber [17,18] and the recent paper by Pyber and Shalev [19] for a detailed exposition of this subject. In thi