Advertisement

A Parallel Permutation Multiplier for a PGM Crypto-chip

  • Tamás Horváth
  • Spyros S. Magliveras
  • Tran van Trung
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 839)

Abstract

A symmetric key cryptosystem, called PGM, based on logarithmic signatures for finite permutation groups was invented by S. Magliveras in the late 1970’s. PGM is intended to be used in cryptosystems with high data rates. This requires exploitation of the potential parallelism in composition of permutations. As a first step towards a full VLSI implementation, a parallel multiplier has been designed and implemented on an FPGA (Field Programmable Gate Array) chip. The chip works as a co-processor in a DSP system. This paper explains the principles of the architecture, reports about implementation details and concludes by giving an estimate of the expected performance in VLSI.

Keywords

Field Programmable Gate Array Setup Phase Parallel Multiplier Potential Parallelism Logarithmic Signature 
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.

References

  1. 1.
    S. S. Magliveras, A cryptosystem from logarithmic signatures of finite groups, In Proceedings of the 29’th Midwest Symposium on Circuits and Systems, Elsevier Publishing Company (1986), pp 972–975.Google Scholar
  2. 2.
    S. S. Magliveras and N. D. Memon, The Linear Complexity Profile of Cryptosystem PGM, Congressus Numerantium, Utilitas Mathematica, 72 (1989), pp 51–60.MathSciNetGoogle Scholar
  3. 3.
    S. S. Magliveras, N. D. Memon and K.C. Tam, Complexity tests for cryptosystem PGM, Congressus Numerantium, Utilitas Mathematica, 79 (1990), pp 61–68.zbMATHMathSciNetGoogle Scholar
  4. 4.
    S. S. Magliveras and N. D. Memon, Algebraic Properties of Cryptosystem PGM, in Journal of Cryptology, 5 (1992), pp 167–183.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    M. Qu and S. A. Vanstone, Factorizations of elementary Abelian p-groups and their cryptographic significance, to appear in J. of Cryptology.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Tamás Horváth
    • 1
  • Spyros S. Magliveras
    • 2
  • Tran van Trung
    • 1
  1. 1.Institute for Experimental MathematicsUniversity of EssenEssenGermany
  2. 2.Department of Computer Science and EngineeringUniversity of NebraskaLincolnUSA

Personalised recommendations