Algebraic properties of cryptosystem PGM
Journal of Cryptology
Arithmetic Design for Permutation Groups
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
| Hi-index | 0.00 |
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.