Sciweavers

In [1] a construction of a block cipher from a single pseudorandom permutation is proposed. In a complexity theoretical setting they prove that this scheme is secure against a pol...

Joan Daemen

claim paper

Read More »

126

click to vote

ASIACRYPT
1991
Springer

101views Cryptology» more ASIACRYPT 1991»

Collisions for Schnorr's Hash Function FFT-Hash Presented at Crypto '91

15 years 8 months ago

Download www.cosic.esat.kuleuven.be

A method is described to generate collisions for the hash function FFT-Hash that

Joan Daemen, Antoon Bosselaers, René Govaer...

claim paper

Read More »

115

click to vote

ASIACRYPT
1991
Springer

84views Cryptology» more ASIACRYPT 1991»

Revealing Information with Partial Period Correlations (Extended Abstract)

15 years 8 months ago

Download www.math.ias.edu

g Information with Partial Period Correlations (extendedabstract) Andrew Klapper Mark Goresky Northeastern University, College of Computer Science, Boston, MA 02115, U.S.A.

Andrew Klapper, Mark Goresky

claim paper

Read More »

All Subjects

Algorithms

Applied Computing

Artificial Intelligence

Automated Reasoning

Communications

Computational Geometry

Computer Architecture

Computer Graphics