Algorithm engineering for public key algorithms
- 1 May 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 7 (4) , 458-466
- https://doi.org/10.1109/49.17708
Abstract
Methods of implementing public key algorithms based on modular integer arithmetic (RSA) and finite-field arithmetic (Diffie-Hellman, El Gamal) are examined. Architectures for VLSI implementations are emphasized.Keywords
This publication has 6 references indexed in Scilit:
- Architectures for exponentiation in GF(2n)Published by Springer Nature ,2000
- A Framework for the Study of Cryptographic ProtocolsPublished by Springer Nature ,2000
- Parallel implementation of the quadratic sieveThe Journal of Supercomputing, 1988
- Efficient Zero-Knowledge Identification Scheme for Smart CardsPublished by Springer Nature ,1988
- Fast evaluation of logarithms in fields of characteristic twoIEEE Transactions on Information Theory, 1984
- Bit-serial Reed - Solomon encodersIEEE Transactions on Information Theory, 1982