Download:
|
by Sarvar Patel, Zulfikar Ramzan, Ganesh Sundaram
http://theory.lcs.mit.edu/%7Ezulfikar/MyResearch/../papers/nov3.ps
Add To MetaCart
Abstract:
This document is intended to clarify and explain proof-theoretic cryptography with a view towards explaining the value this approach adds to the design of ciphers. In addition the material contained within should address most of the questions that were triggered by discussions among AHAG participants. Moreover, we discuss in detail the precise design choices, related to Sha-zam, and why we made them. The overall conclusion is: based on the design and mathematical proofs related to Sha-zam, and the trust that we have on various properties of SHA-1, Sha-zam does not require any cryptanalysis. 1
Citations
|
1514
|
Handbook of applied cryptography
– Menezes, Oorshot, et al.
- 1997
|
|
482
|
How to construct random functions
– Goldreich, Goldwasser, et al.
- 1986
|
|
477
|
M.: A pseudorandom generator from any one-way function
– Hastad, Impagliazzo, et al.
- 1999
|
|
473
|
How to generate cryptographically strong sequences of pseudorandom bits
– Blum, Micali
- 1984
|
|
418
|
Theory and application of trapdoor functions
– Yao
- 1982
|
|
318
|
Keying Hash Functions for Message Authentication
– Bellare, Canetti, et al.
- 1996
|
|
203
|
How to construct pseudo-random permutations from pseudo-random functions
– Luby, Rackoff
- 1988
|
|
175
|
HMAC: Keyed-Hashing for Message Authentication
– Krawczyk, Bellare, et al.
- 1997
|
|
166
|
Network Security: Private Communications in a Public World
– Kaufman, Perlman, et al.
- 1995
|
|
65
|
On the construction of pseudo-random permutations: Luby-Rackoff revisited
– Naor, Reingold
- 1999
|
|
56
|
A hard-core predicate to any one-way function
– Goldreich, Levin
- 2002
|
|
52
|
Two practical and provably secure block ciphers
– Anderson, Biham
- 1996
|
|
24
|
A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators
– Maurer
- 1995
|
|
17
|
Square hash: Fast message authentication via optimized universal hash functions
– Etzel, Patel, et al.
- 1999
|
|
16
|
Foiling birthday attacks in length doubling transformations
– Aiello, Venkatesan
- 1996
|
|
14
|
An efficient discrete log pseudo random generator
– Patel, Sundaram
- 1998
|
|
13
|
Faster Luby-Rackoff Ciphers
– Lucks
- 1996
|
|
13
|
Improved security bounds for pseudorandom permutations, 4th ACM Conference on Computer and Communications Security, 142�150
– Patarin
- 1997
|
|
9
|
Universal hash functions & hard core bits
– Naslund
- 1995
|
|
7
|
Towards making Luby-Rackoff ciphers optimal and practical
– Patel, Ramzan, et al.
- 1999
|
|
5
|
All Bits in ax + b mod p are Hard
– Naslund
- 1996
|
|
5
|
New results on pseudorandom permutation generators based on the DES scheme
– Patarin
- 1991
|
|
4
|
Integrity Primitives for Secure Information Systems
– Bosselaers, Preneel
- 1995
|
|
2
|
From unpredictability to indistinguishability: A sinple construction of pseudo random functions from MACs
– Naor, Reingold
- 1998
|
|
2
|
Luby rackoff ciphers over arbitrary groups, preprint
– Patel, Ramzan, et al.
- 1999
|
|
1
|
Biham's webpage: http://www.cs.technion.ac.il/~ biham
– Eli
|
|
1
|
a stream cipher, AHAG contribution
– Rose, Sha-Stream
- 1999
|
|
1
|
Wagner's webpage
– David
|
