Efficient and secure modular operations using the Adapted Modular Number System (original) (raw)
Related papers
Efficient modular operations using the adapted modular number system
Journal of Cryptographic Engineering
18th IEEE Symposium on Computer Arithmetic (ARITH '07), 2007
An Optimized Montgomery Modular Multiplication Algorithm for Cryptography
2013
Another look at some fast modular arithmetic methods
Journal of Mathematical Cryptology, 2009
Fast algorithm for modular reduction
IEE Proceedings - Computers and Digital Techniques, 1998
Randomization of Arithmetic Over Polynomial Modular Number System
2019 IEEE 26th Symposium on Computer Arithmetic (ARITH), 2019
On Polynomial Modular Number Systems over Z/pZ
2019
Fast Modular Multiplication Execution in Residue Number System
Victor Kuchukov, Andrei Tchernykh
Improved Sum of Residues Modular Multiplication Algorithm
Cryptography, 2019
Efficient Modular Multiplication Algorithms for Public Key Cryptography
Fast modular reduction for large-integer multiplication for cryptosystem application
2012
On Polynomial Modular Number Systems over $ \mathbb{Z}/{p}\mathbb{Z} $
Advances in Mathematics of Communications, 2022
An RNS Montgomery modular multiplication algorithm
IEEE Transactions on Computers, 1998
RNS modular multiplication through reduced base extensions
2014 IEEE 25th International Conference on Application-Specific Systems, Architectures and Processors, 2014
An Area-efficient Montgomery Modular Multiplier for Cryptosystems
Implementation of Modular Reduction and Modular Multiplication Algorithms
The Montgomery Modular Inverse-Revisited
IEEE Transactions on Computers, 2000
Montgomery modular multiplication in residue arithmetic
2000
Implementation of Modular Exponentiation Using Montgomery Algorithms
2015
Modular multiplication and base extensions in residue number systems
Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001, 2001
Improved Modular Multiplication for Optimal Prime Fields
Lecture Notes in Computer Science, 2015
Lecture Notes in Computer Science, 2016
2020
A modified radix-2 Montgomery modular multiplication with new recoding method
Ieice Electronic Express, 2010
2002
A review of modular multiplication methods and respective hardware implementations
High speed systolic Montgomery modular multipliers for RSA cryptosystems
2006
Efficient pipelining for modular multiplication architectures in prime fields
ACM Great Lakes Symposium on VLSI, 2007
On Modular Decomposition of Integers
Lecture Notes in Computer Science, 2009
Montgomery modular multiplier architectures and hardware implementations for an RSA cryptosystem
2003
Four Moduli RNS Bases for Efficient Design of Modular Multiplication
2011