A Parallel Permutation Multiplier for a PGM Crypto-chip
- 2.2k Downloads
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.
KeywordsField Programmable Gate Array Setup Phase Parallel Multiplier Potential Parallelism Logarithmic Signature
- 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
- 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