A symmetric key cryptosysteni, called PGM, based on log- arithmic 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.
CITATION STYLE
Horváth, T., Magliveras, S. S., & Van Trung, T. (1994). A parallel permutation multiplier for a PGM crypto-chip. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 839 LNCS, pp. 108–113). Springer Verlag. https://doi.org/10.1007/3-540-48658-5_12
Mendeley helps you to discover research relevant for your work.