Advertisement

Comments on Soviet encryption algorithm

  • C. Charnes
  • L. O'Connor
  • J. Pieprzyk
  • R. Safavi-Naini
  • Y. Zheng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 950)

References

  1. 1.
    S. Even and O. Goldreich. Des-like functions can generate the alternating group. IEEE Transactions on Information Theory, 29(6):863–865, November 1983.MathSciNetCrossRefGoogle Scholar
  2. 2.
    National Soviet Bureau of Standards. Information Processing Systems. Cryptographic Protection. Cryptographic Algorithm. GOST 28147-89, 1989.Google Scholar
  3. 3.
    J.P. Pieprzyk and Xian-Mo Zhang. Permutation generators of alternating groups. In Advances in Cryptology — AUSCRYPT'90, J. Seberry, J. Pieprzyk (Eds), Lecture Notes in Computer Science, Vol.453, pages 237–244. Springer Verlag, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • C. Charnes
    • 1
  • L. O'Connor
    • 1
    • 2
  • J. Pieprzyk
    • 1
  • R. Safavi-Naini
    • 1
  • Y. Zheng
    • 1
  1. 1.Department of Computer ScienceUniversity of WollongongWollongongAustralia
  2. 2.Distributed Systems Technology CenterQueensland University of TechnologyBrisbaneAustralia

Personalised recommendations