A Unified theory of interconnection network structure
Theoretical Computer Science
Computer architecture and organization; (2nd ed.)
Computer architecture and organization; (2nd ed.)
Efficient parallel algorithms
Introduction to algorithms
Computer architecture and design
Computer architecture and design
Algebraic properties of cryptosystem PGM
Journal of Cryptology
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Parallel Sorting Algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A Parallel Permutation Multiplier for a PGM Crypto-chip
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
A Survey of Interconnection Networks
Computer
Fast Primitives for Internal Data Scrambling in Tamper Resistant Hardware
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
| Hi-index | 0.00 |
This paper investigates the hardware implementation of arithmetical operations (multiplication and inversion) in symmetric and alternating groups, as well as in binary permutation groups (permutation groups of order 2r). Various fast and space-efficient hardware architectures will be presented. High speed is achieved by employing switching networks, which effect multiplication in one clock cycle (full parallelism). Space-efficiency is achieved by choosing, on one hand, proper network architectures and, on the other hand, the proper representation of the group elements. We introduce a non-redundant representation of the elements of binary groups, the so-called compact representation, which allows lowcost realization of arithmetic for binary groups of large degrees such as 128 or even 256. We present highly optimized multiplier architectures operating directly on the compact form of permutations. Finally, we give complexity and performance estimations for the presented architectures.