A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
A high security log-in procedure
Communications of the ACM
Computer Arithmetic: Principles, Architecture and Design
Computer Arithmetic: Principles, Architecture and Design
VLSI implementation of public-key encryption algorithms
Proceedings on Advances in cryptology---CRYPTO '86
VICTOR: an efficient RSA hardware implementation
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Modular exponentiation using recursive sums of residues
CRYPTO '89 Proceedings on Advances in cryptology
A fast modular-multiplication algorithm based on a higher radix
CRYPTO '89 Proceedings on Advances in cryptology
A Countermeasure against One Physical Cryptanalysis May Benefit Another Attack
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
A Bit-Serial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Scalable hardware implementing high-radix Montgomery multiplication algorithm
Journal of Systems Architecture: the EUROMICRO Journal
A Timing Attack on Blakley's Modular Multiplication Algorithm, and Applications to DSA
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Computers and Electrical Engineering
An efficient signed digit montgomery multiplication for RSA
Journal of Systems Architecture: the EUROMICRO Journal
Simulations of modular multipliers on FPGA
AsiaMS '07 Proceedings of the IASTED Asian Conference on Modelling and Simulation
Journal of Signal Processing Systems
Unified 3GPP and 3GPP2 turbo encoder FPGA implementation using run-time partial reconfiguration
WTS'10 Proceedings of the 9th conference on Wireless telecommunications symposium
Improving multiplication and reminder using implementation based on word and index
Proceedings of the 1st Amrita ACM-W Celebration on Women in Computing in India
Multimode flex-interleaver core for baseband processor platform
Journal of Computer Systems, Networks, and Communications - Special issue on WiMAX, LTE, and WiFi interworking
High speed flexible pairing cryptoprocessor on FPGA platform
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Revisiting sum of residues modular multiplication
Journal of Electrical and Computer Engineering
Fast parallel DNA-based algorithms for molecular computation: discrete logarithm
The Journal of Supercomputing
Memory-constrained implementations of elliptic curve cryptography in co-Z coordinate representation
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Bipartite modular multiplication
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
High-Speed RSA crypto-processor with radix-4 modular multiplication and chinese remainder theorem
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Research note: A fast modular multiplication method based on the Lempel-Ziv binary tree
Computer Communications
An efficient RSA implementation without precomputation
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Secure dual-core cryptoprocessor for pairings over Barreto-Naehrig curves on FPGA platform
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
PRIME: private RSA infrastructure for memory-less encryption
Proceedings of the 29th Annual Computer Security Applications Conference
SN-SEC: a secure wireless sensor platform with hardware cryptographic primitives
Personal and Ubiquitous Computing
| Hi-index | 14.98 |
It is possible to find the smallest nonnegative integer R congruent modulo M to the product AB of two nonnegative integers without dividing by M. In multiple precision arithmetic, doing away with the division cuts the calculation time by varying amounts, depending on machine architecture. It also cuts storage space.