Advertisement

Highly parallel cryptographic attacks

  • Marcus Peinado
  • Ramarathnam Venkatesan
5 Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1332)

Abstract

We report on a large-scale statistical evaluation of pseudorandom properties of certain cryptographic functions such as DEs and md5. The evaluation is based on the well-known birthday attack. The attack requires large amounts of memory. We describe a parallel algorithm which can exploit the large amounts of secondary memory (local disks) available on many workstation clusters and parallel machines. The overheads due to communication and disk accesses can be minimized by techniques similar to those used in parallel data bases for parallel external sorting. We have implemented the algorithm using the message passing interface MPI. We display performance measurements on an IBM SP2 which show that the costs for communication and disk accesses are negligible.

Keywords

Data Item Main Memory Parallel Machine Load Imbalance Secondary Memory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Bar-Noy and S. Kipnis. Designing broadcasting algorithms in the postal model for message passing systems. In Proc. of SPAA, pages 13–22, 1992.Google Scholar
  2. 2.
    B. A. W. Baugsto and J. F. Greipsland. Parallel sorting methods for large data volumes on a hypercube database computer. In Proc. of the 6th International Workshop on Database Machines, pages 127–141, 1989.Google Scholar
  3. 3.
    D. J. DeWitt, J. F. Naughton, and D. A. Schneider. Parallel sorting on a shared-nothing architecture using probabilistic splitting. In Proc. of the 1st International Conference on Parallel and Distributed Information Systems, pages 280–291, 1991.Google Scholar
  4. 4.
    W. Feller. An Introduction to Probability Theory and its Applications. John Wiley & Sons, 1968.Google Scholar
  5. 5.
    A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology — Crypto'86, Lecture Notes in CS, pages 186–194, 1986.Google Scholar
  6. 6.
    P. Flajolet and A. Odlyzko. Random mapping statistics. In Advances in Cryptology — EUROCRYPT'89, pages 329–354, 1989.Google Scholar
  7. 7.
    D. E. Knuth. The Art of Computer Programming, V2: Semi-numerical Algorithms. Addison-Wesley, 1981.Google Scholar
  8. 8.
    G. Marsaglia. A current view on random number generators. In Proc. Computer Science and Statistics: 16th Symposium on the Interface. Elsevier Press, 1984.Google Scholar
  9. 9.
    Message Passing Interface Forum. MPI: a message-passing interface standard. International Journal of Supercomputer Applications, 8(3/4), 1994.Google Scholar
  10. 10.
    R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.Google Scholar
  11. 11.
    National Bureau of Standards. Data Encryption Standard (DES). FIPS Publication 46, 1977.Google Scholar
  12. 12.
    National Bureau of Standards. Secure Hash Standard. FIPS Publication 180, 1993.Google Scholar
  13. 13.
    J. Quisquater and J. Delescaille. How easy is collision search? application to des. In Advances in Cryptology — EUROCRYPT'89, pages 429–434, 1989.Google Scholar
  14. 14.
    R. Rivest. The MD4 message-digest algorithm. Request for Comments (Informational) RFC 1320, Internet Engineering Task Force, April 1992.Google Scholar
  15. 15.
    R. Rivest. The MD5 message-digest algorithm. Request for Comments (Informational) RFC 1321, Internet Engineering Task Force, April 1992.Google Scholar
  16. 16.
    R. Rivest and A. Shamir. Payword and micromint: Two simple micropayment schemes, 1996.Google Scholar
  17. 17.
    D. R. Stinson. Cryptography, Theory and Praxis. CRC Press, 1995.Google Scholar
  18. 18.
    H. Young and A. Swami. The parameterized round-robin partitioned algorithm for parallel external sort. In Proceedings of the 9th International Parallel Processing Symposium, pages 213–219. IEEE Computer Society Press, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Marcus Peinado
    • 1
  • Ramarathnam Venkatesan
    • 2
  1. 1.Institute for Algorithms and Scientific ComputingGerman National Research Center for Information Technology (GMD)Sankt AugustinGermany
  2. 2.Microsoft ResearchOne Microsoft WayRedmondUSA

Personalised recommendations