THE BLACK-BOX MODEL FOR CRYPTOGRAPHIC PRIMITIVES

Authors
SCHNORR CP VAUDENAY S
Citation
Cp. Schnorr et S. Vaudenay, THE BLACK-BOX MODEL FOR CRYPTOGRAPHIC PRIMITIVES, Journal of cryptology, 11(2), 1998, pp. 125-140
Citations number
19
Categorie Soggetti
Computer Science Theory & Methods",Mathematics,"Computer Science Theory & Methods","Engineering, Eletrical & Electronic",Mathematics
Journal title
Journal of cryptology → ACNP
ISSN journal
09332790
Volume
11
Issue
2
Year of publication
1998
Pages
125 - 140
Database
ISI
SICI code
0933-2790(1998)11:2<125:TBMFCP>2.0.ZU;2-O
Abstract
We introduce the black-box model for cryptographic primitives. In this model cryptographic primitives are given by a computation graph, wher e the computation boxes sitting on the vertices of the graph act as ra ndom oracles. We formalize and study a family of generic attacks which generalize exhaustive search and the birthday paradox. We establish c omplexity lower bounds for these attacks and we apply it to compressio n functions based on the FFT network.