Table of contents (44 papers)

  1. Front Matter
  2. Auto-recoverable auto-certifiable cryptosystems
    Adam Young, Moti Yung
    Pages 17-31
  3. Breaking RSA may not be equivalent to factoring
    Dan Boneh, Ramarathnam Venkatesan
    Pages 59-71
  4. Lower bounds on generic algorithms in groups
    Ueli Maurer, Stefan Wolf
    Pages 72-84
  5. Improved cryptanalysis of RC5
    Alex Biryukov, Eyal Kushilevitz
    Pages 85-99
  6. Cryptanalysis of the ANSI X9.52 CBCM mode
    Eli Biham, Lars R. Knudsen
    Pages 100-111
  7. Differential-linear weak key classes of IDEA
    Philip Hawkes
    Pages 112-126
  8. Divertible protocols and atomic proxy cryptography
    Matt Blaze, Gerrit Bleumer, Martin Strauss
    Pages 127-144
  9. Optimum traitor tracing and asymmetric schemes
    Kaoru Kurosawa, Yvo Desmedt
    Pages 145-157
  10. Improved algorithms for isomorphisms of polynomials
    Jacques Patarin, Louis Goubin, Nicolas Courtois
    Pages 184-200
  11. Visual cryptanalysis
    Adi Shamir
    Pages 201-210
  12. How to improve an exponentiation black-box
    Gérard Cohen, David Naccache, Antoine Lobstein, Gilles Zémor
    Pages 211-220
  13. Speeding up discrete log and factoring based schemes via precomputations
    Victor Boyko, Marcus Peinado, Ramarathnam Venkatesan
    Pages 221-235
  14. Fast batch verification for modular exponentiation and digital signatures
    Mihir Bellare, Juan A. Garay, Tal Rabin
    Pages 236-250
  15. A formal treatment of remotely keyed encryption
    Matt Blaze, Joan Feigenbaum, Moni Naor
    Pages 251-265

About these proceedings


This book constitutes the refereed proceedings of the 1998 International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT '98, held in Espoo, Finland, in May/June 1998.
The book presents 44 revised full papers selected from a total of 161 submissions. The papers are organized in sections on distributed cryptography, complexity, cryptanalysis of block ciphers, computational algorithms, paradigms for symmetric systems, public key cryptosystems, multi-party computation, digital signatures, Boolean functions, combinatorial design and analysis, elliptic curve systems, and electronic commerce and payment.


Maxima Permutation algorithms communication complexity cryptography identity security verification

Bibliographic information

  • Copyright Information Springer-Verlag 1998
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-64518-4
  • Online ISBN 978-3-540-69795-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349