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.
Chapter PDF
References
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.
S. S. Magliveras and N. D. Memon, The Linear Complexity Profile of Cryptosystem PGM, Congressus Numerantium, Utilitas Mathematica, 72 (1989), pp 51–60.
S. S. Magliveras, N. D. Memon and K.C. Tam, Complexity tests for cryptosystem PGM, Congressus Numerantium, Utilitas Mathematica, 79 (1990), pp 61–68.
S. S. Magliveras and N. D. Memon, Algebraic Properties of Cryptosystem PGM, in Journal of Cryptology, 5 (1992), pp 167–183.
M. Qu and S. A. Vanstone, Factorizations of elementary Abelian p-groups and their cryptographic significance, to appear in J. of Cryptology.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Horváth, T., Magliveras, S.S., van Trung, T. (1994). A Parallel Permutation Multiplier for a PGM Crypto-chip. In: Desmedt, Y.G. (eds) Advances in Cryptology — CRYPTO ’94. CRYPTO 1994. Lecture Notes in Computer Science, vol 839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48658-5_12
Download citation
DOI: https://doi.org/10.1007/3-540-48658-5_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58333-2
Online ISBN: 978-3-540-48658-9
eBook Packages: Springer Book Archive