Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Montgomery Multiplication in GF(2^k
Designs, Codes and Cryptography
The Montgomery Modular Inverse-Revisited
IEEE Transactions on Computers - Special issue on computer arithmetic
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
The Montgomery Inverse and Its Applications
IEEE Transactions on Computers
Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Faster Modular Multiplication by Operand Scaling
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
A Scalable Architecture for Montgomery Multiplication
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
The Montgomery Powering Ladder
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2)
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Proceedings of the 11th ACM conference on Computer and communications security
An RSA Implementation Resistant to Fault Attacks and to Simple Power Analysis
IEEE Transactions on Computers
An Efficient Hardware Implementation of the Tate Pairing in Characteristic Three
ICONS '08 Proceedings of the Third International Conference on Systems
A versatile Montgomery multiplier architecture with characteristic three support
Computers and Electrical Engineering
Parametric, Secure and Compact Implementation of RSA on FPGA
RECONFIG '08 Proceedings of the 2008 International Conference on Reconfigurable Computing and FPGAs
Highly Regular m-Ary Powering Ladders
Selected Areas in Cryptography
Identity based threshold ring signature
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
GF(2m) finite-field multipliers with reduced activity variations
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
| Hi-index | 0.00 |
Cryptography is one of the most prominent application areas of the finite field arithmetic. Almost all public-key cryptographic algorithms including the recent algorithms such as elliptic curve and pairing-based cryptography rely heavily on finite field arithmetic, which needs to be performed efficiently to meet the execution speed and design space constraints. These objectives constitute massive challenges that necessitate interdisciplinary research efforts that will render the best algorithms, architectures, implementations, and design practices. This paper aims to provide a concise perspective on designing architectures for efficient finite field arithmetic for usage in cryptography. We present different architectures, methods and techniques for fast execution of cryptographic operations as well as high utilization of resources in the realization of cryptographic algorithms. While it is difficult to have a complete coverage of all related work, this paper aims to reflect the current trends and important implementation issues of finite field arithmetic in the context of cryptography.