On the public citation graph

An RNS Montgomery modular multiplication algorithm

0 signed · 139 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/0-387-34799-2_18openalex-snapshot
An Improvement of the Fiat-Shamir Identification and Signature Scheme
inferredcites →https://doi.org/10.1007/0-387-34805-0_34openalex-snapshot
A Survey of Hardware Implementations of RSA
inferredcites →https://doi.org/10.1007/3-540-47721-7_12openalex-snapshot
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1109/12.16508openalex-snapshot
Fast base extension using a redundant modulus in RNS
inferredcites →https://doi.org/10.1109/12.210181openalex-snapshot
Systolic modular multiplication
inferredcites →https://doi.org/10.1109/12.277287openalex-snapshot
Hardware implementation of Montgomery's modular multiplication algorithm
inferredcites →https://doi.org/10.1109/arith.1989.72828openalex-snapshot
Incompletely specified numbers in the residue number system-definition and applications
inferredcites →https://doi.org/10.1109/arith.1993.378082openalex-snapshot
High-radix modular multiplication for cryptosystems
inferredcites →https://doi.org/10.1109/arith.1993.378083openalex-snapshot
A modular multiplication algorithm with triangle additions
inferredcites →https://doi.org/10.1109/arith.1993.378085openalex-snapshot
Fast implementations of RSA cryptography
inferredcites →https://doi.org/10.1109/arith.1995.465359openalex-snapshot
Simplifying quotient determination in high-radix modular multiplication
inferredcites →https://doi.org/10.1109/mc.1984.1659138openalex-snapshot
Residue Arithmetic A Tutorial with Examples
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781119206804.ch6openalex-snapshot
RNS‐Based Arithmetic Circuits and Applications
inferred← citeshttps://doi.org/10.1007/10931455_18openalex-snapshot
Faster Double-Size Modular Multiplication from Euclidean Multipliers
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_37openalex-snapshot
Cox-Rower Architecture for Fast Parallel Montgomery Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-030-02807-7_5openalex-snapshot
Lightweight Fault Tolerance for Secure Aggregation of Homomorphic Data
inferred← citeshttps://doi.org/10.1007/978-3-030-34142-8_5openalex-snapshot
Modular Addition and Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-030-74524-0_4openalex-snapshot
Review of Algorithmic Techniques for Improving the Performance of Modular Exponentiation
inferred← citeshttps://doi.org/10.1007/978-3-030-74524-0_6openalex-snapshot
Introduction to Montgomery Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-030-95161-0_12openalex-snapshot
The Data Control in the System of Residual Classes
inferred← citeshttps://doi.org/10.1007/978-3-031-22944-2_5openalex-snapshot
Finite Field Arithmetic in Large Characteristic for Classical and Post-quantum Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-031-72171-7_17openalex-snapshot
An Approach to Reducing Device Uncertainty in Fog-Cloud Computing
inferred← citeshttps://doi.org/10.1007/978-3-031-73122-8_5openalex-snapshot
RISC-V Word-Size Modular Instructions for Residue Number Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-77229-0_14openalex-snapshot
Research and Modification of Montgomery Multiplication Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-031-77229-0_17openalex-snapshot
An Efficient Implementation of the Montgomery Algorithm Using the Akushsky Core Function
inferred← citeshttps://doi.org/10.1007/978-3-319-04873-4_1openalex-snapshot
EAGL: An Elliptic Curve Arithmetic GPU-Based Library for Bilinear Pairing
inferred← citeshttps://doi.org/10.1007/978-3-319-08302-5_14openalex-snapshot
Practical Analysis of RSA Countermeasures Against Side-Channel Electromagnetic Attacks
inferred← citeshttps://doi.org/10.1007/978-3-319-10175-0_11openalex-snapshot
Attacking Randomized Exponentiations Using Unsupervised Learning
inferred← citeshttps://doi.org/10.1007/978-3-319-41385-3_10openalex-snapshot
RNS in Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-57972-6_14openalex-snapshot
A GPU Parallel Implementation of the RSA Private Operation
inferred← citeshttps://doi.org/10.1007/978-3-540-24669-5_133openalex-snapshot
Parallel Modular Multiplication Algorithm in Residue Number System
inferred← citeshttps://doi.org/10.1007/978-3-540-24709-8_23openalex-snapshot
Multiplier with Parallel CSA using CRT’s Specific Moduli (2 k -1, 2 k , 2 k +1)
inferred← citeshttps://doi.org/10.1007/978-3-540-70500-0_34openalex-snapshot
Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
inferred← citeshttps://doi.org/10.1007/978-3-642-04159-4_23openalex-snapshot
Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering
inferred← citeshttps://doi.org/10.1007/978-3-642-15031-9_4openalex-snapshot
A High Speed Coprocessor for Elliptic Curve Scalar Multiplications over $\mathbb{F}_p$
inferred← citeshttps://doi.org/10.1007/978-3-642-23951-9_28openalex-snapshot
FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-36812-7_11openalex-snapshot
Flexible Design of a Modular Simultaneous Exponentiation Core for Embedded Platforms
inferred← citeshttps://doi.org/10.1007/978-3-642-40349-1_14openalex-snapshot
Improving Modular Inversion in RNS Using the Plus-Minus Method
inferred← citeshttps://doi.org/10.1007/978-3-662-43414-7_24openalex-snapshot
Montgomery Multiplication Using Vector Instructions
inferred← citeshttps://doi.org/10.1007/978-3-662-48324-4_7openalex-snapshot
Single Base Modular Multiplication for Efficient Hardware RNS Implementations of ECC
inferred← citeshttps://doi.org/10.1007/978-81-322-1695-7_27openalex-snapshot
Improved RNS Montgomery Modular Multiplication with Residue Recovery
inferred← citeshttps://doi.org/10.1007/s11265-024-01925-8openalex-snapshot
Fast RNS Implementation of Elliptic Curve Point Multiplication on FPGAs
inferred← citeshttps://doi.org/10.1007/s13389-013-0062-6openalex-snapshot
A synthesis of side-channel attacks on elliptic curve cryptography in smart-cards
inferred← citeshttps://doi.org/10.1007/s13389-015-0095-0openalex-snapshot
Vertical and horizontal correlation attacks on RNS-based exponentiations
inferred← citeshttps://doi.org/10.1007/s13389-017-0154-9openalex-snapshot
Montgomery reduction within the context of residue number system arithmetic
inferred← citeshttps://doi.org/10.1007/s13389-020-00231-wopenalex-snapshot
Residue arithmetic systems in cryptography: a survey on modern security applications
inferred← citeshttps://doi.org/10.1016/j.aeue.2007.08.008openalex-snapshot
New reverse converters for the moduli set
inferred← citeshttps://doi.org/10.1016/j.amc.2005.01.076openalex-snapshot
An iterative modular multiplication algorithm in RNS
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2006.01.024openalex-snapshot
A parallel residue-to-binary conversion algorithm without trial division
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.06.005openalex-snapshot
New distributed algorithms for fast sign detection in residue number systems (RNS)
inferred← citeshttps://doi.org/10.1016/j.micpro.2020.103442openalex-snapshot
WITHDRAWN: Fast RNS elliptic curve point multiplication on FPGAs
inferred← citeshttps://doi.org/10.1016/j.vlsi.2011.03.006openalex-snapshot
Efficient modulo 2 ±1 squarers
inferred← citeshttps://doi.org/10.1016/j.vlsi.2021.12.006openalex-snapshot
Efficient FPGA implementation of RNS Montgomery multiplication using balanced RNS bases
inferred← citeshttps://doi.org/10.1016/j.vlsi.2026.102770openalex-snapshot
A low-latency and energy-efficient signed multiplier architecture using residue number system and deterministic bitstreams for edge AI
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00400-6openalex-snapshot
How to fake an RSA signature by encoding modular root finding as a SAT problem
inferred← citeshttps://doi.org/10.1016/s0167-9260(02)00053-6openalex-snapshot
Hardware architectures for public key cryptography
inferred← citeshttps://doi.org/10.1016/s1383-7621(02)00058-9openalex-snapshot
Fast modular exponentiation of large numbers with large exponents
inferred← citeshttps://doi.org/10.1049/iet-cdt.2017.0017openalex-snapshot
65‐nm CMOS low‐energy RNS modular multiplier for elliptic‐curve cryptography
inferred← citeshttps://doi.org/10.1049/iet-cdt:20070066openalex-snapshot
Efficient residue number system iterative modular multiplication algorithm for fast modular exponentiation
inferred← citeshttps://doi.org/10.1049/ip-cdt:20040033openalex-snapshot
Residue-to-binary decoder for an enhanced moduli set
inferred← citeshttps://doi.org/10.1049/ip-cdt:20055037openalex-snapshot
Diminished-1 modulo 2n+1 squarer design
inferred← citeshttps://doi.org/10.1080/00207210801924099openalex-snapshot
Horner's rule-based multiplication over GF(p) and GF(pn): a survey
inferred← citeshttps://doi.org/10.1109/12.833113openalex-snapshot
New efficient structure for a modular multiplier for RNS
inferred← citeshttps://doi.org/10.1109/access.2016.2599269openalex-snapshot
New Residue Arithmetic Based Barrett Algorithms: Modular Integer Computations
inferred← citeshttps://doi.org/10.1109/access.2020.2988379openalex-snapshot
Area-Time Efficient Hardware Implementation of Modular Multiplication for Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1109/acsat.2012.44openalex-snapshot
Hybrid Crypto Hardware Utilizing Symmetric-Key and Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.1109/acssc.1999.831919openalex-snapshot
Montgomery modular multiplication and exponentiation in the residue number system
inferred← citeshttps://doi.org/10.1109/acssc.2000.911210openalex-snapshot
Modular multiplication in the residue number system with application to massively-parallel public-key cryptography systems
inferred← citeshttps://doi.org/10.1109/aero.2004.1367654openalex-snapshot
An analogue to RNS converter based on RNS properties
inferred← citeshttps://doi.org/10.1109/arith.1999.762831openalex-snapshot
Montgomery modular exponentiation on reconfigurable hardware
inferred← citeshttps://doi.org/10.1109/arith.2001.930104openalex-snapshot
Modular multiplication and base extensions in residue number systems
inferred← citeshttps://doi.org/10.1109/arith.2011.35openalex-snapshot
A General Approach for Improving RNS Montgomery Exponentiation Using Pre-processing
inferred← citeshttps://doi.org/10.1109/arith.2013.31openalex-snapshot
Fault Detection in RNS Montgomery Modular Multiplication
inferred← citeshttps://doi.org/10.1109/arith.2016.15openalex-snapshot
Hybrid Position-Residues Number System
inferred← citeshttps://doi.org/10.1109/arith.2017.15openalex-snapshot
Fast Arithmetic Modulo 2^x p^y ± 1
inferred← citeshttps://doi.org/10.1109/arith54963.2022.00025openalex-snapshot
A software comparison of RNS and PMNS
inferred← citeshttps://doi.org/10.1109/asap.2003.1212863openalex-snapshot
Area and time efficient modular multiplication of large integers
inferred← citeshttps://doi.org/10.1109/asap.2004.8openalex-snapshot
Architectural support for arithmetic in optimal extension fields
inferred← citeshttps://doi.org/10.1109/asap.2014.6868631openalex-snapshot
RNS modular multiplication through reduced base extensions
inferred← citeshttps://doi.org/10.1109/ciss.2011.5766176openalex-snapshot
HORNS: A homomorphic encryption scheme for Cloud Computing using Residue Number System
inferred← citeshttps://doi.org/10.1109/cjece.2009.5599422openalex-snapshot
High-performance, low-power architecture for scalable radix 2 montgomery modular multiplication algorithm
inferred← citeshttps://doi.org/10.1109/dsd.2013.44openalex-snapshot
Electromagnetic Analysis on RSA Algorithm Based on RNS
inferred← citeshttps://doi.org/10.1109/grc.2013.6740392openalex-snapshot
Ensure privacy and security in the process of medical image analysis
inferred← citeshttps://doi.org/10.1109/icassp.2017.7952342openalex-snapshot
New residue arithmetic based Barrett algorithms: Modular polynomial computations
inferred← citeshttps://doi.org/10.1109/iccasm.2010.5622857openalex-snapshot
An improved RNS Montgomery modular multiplier
inferred← citeshttps://doi.org/10.1109/icccnt.2012.6479590openalex-snapshot
HORNS: A semi-perfectly secret homomorphic encryption system
inferred← citeshttps://doi.org/10.1109/icjece.2023.3243888openalex-snapshot
High-Performance RNS Modular Exponentiation by Sum-Residue Reduction
inferred← citeshttps://doi.org/10.1109/icoecit68303.2026.11497109openalex-snapshot
High-Speed Modular Multiplier Architecture for FPGA Implementation of Super singular Isogeny-Based Post-Quantum Cryptography
inferred← citeshttps://doi.org/10.1109/iemcon.2016.7746304openalex-snapshot
A novel approach to enhance the security dimension of RSA algorithm using bijective function
inferred← citeshttps://doi.org/10.1109/ipas.2016.7880137openalex-snapshot
Efficient software implementation of RNS-montgomery modular multiplication for embedded system
inferred← citeshttps://doi.org/10.1109/itmqis.2017.8085822openalex-snapshot
Experimental analysis of large prime numbers generation in residue number system
inferred← citeshttps://doi.org/10.1109/mwscas.2003.1562409openalex-snapshot
Parallel FPGA Implementation of RSA with Residue Number Systems—Can side-channel threats be avoided?
inferred← citeshttps://doi.org/10.1109/pacrim.2009.5291345openalex-snapshot
New processor array architecture for scalable radix 2 Montgomery modular multiplication algorithm
inferred← citeshttps://doi.org/10.1109/pacrim.2013.6625466openalex-snapshot
New and improved word-based unified and scalable architecture for radix 2 Montgomery modular multiplication algorithm
inferred← citeshttps://doi.org/10.1109/picst47496.2019.9061381openalex-snapshot
Method of Arithmetic Comparison of Data in the Residue Numeral System
inferred← citeshttps://doi.org/10.1109/samos.2017.8344638openalex-snapshot
Pipelined FPGA coprocessor for elliptic curve cryptography based on residue number system
inferred← citeshttps://doi.org/10.1109/tc.2005.1openalex-snapshot
A Hardware Algorithm for Modular Multiplication/Division
inferred← citeshttps://doi.org/10.1109/tc.2007.1084openalex-snapshot
Hardware Complexity of Modular Multiplication and Exponentiation
inferred← citeshttps://doi.org/10.1109/tc.2010.256openalex-snapshot
A Parallel Implementation of Montgomery Multiplication on Multicore Systems: Algorithm, Analysis, and Prototype
inferred← citeshttps://doi.org/10.1109/tc.2013.92openalex-snapshot
Novel RNS Parameter Selection for Fast Modular Multiplication
inferred← citeshttps://doi.org/10.1109/tc.2016.2529625openalex-snapshot
Binary-Ternary Plus-Minus Modular Inversion in RNS
inferred← citeshttps://doi.org/10.1109/tc.2017.2722440openalex-snapshot
Efficient Detection for Malicious and Random Errors in Additive Encrypted Computation
inferred← citeshttps://doi.org/10.1109/tcad.2023.3250603openalex-snapshot
A Generalized Residue Number System Design Approach for Ultralow-Power Arithmetic Circuits Based on Deterministic Bit-Streams
inferred← citeshttps://doi.org/10.1109/tcad.2025.3584844openalex-snapshot
Big Integer Parallel Stream Modular Multiplier With Variable Bit-Widths
inferred← citeshttps://doi.org/10.1109/tcsi.2013.2283674openalex-snapshot
Multifunction Residue Architectures for Cryptography
inferred← citeshttps://doi.org/10.1109/te.2010.2048329openalex-snapshot
How to Teach Residue Number System to Computer Scientists and Engineers
inferred← citeshttps://doi.org/10.1109/test.2015.7342419openalex-snapshot
Extending residue-based fault tolerance to encrypted computation
inferred← citeshttps://doi.org/10.1109/tetc.2021.3073475openalex-snapshot
Efficient Word Size Modular Arithmetic
inferred← citeshttps://doi.org/10.1109/tpds.2010.196openalex-snapshot
Processor Array Architectures for Scalable Radix 4 Montgomery Modular Multiplication Algorithm
inferred← citeshttps://doi.org/10.1109/tvlsi.2012.2210916openalex-snapshot
Efficient RNS Implementation of Elliptic Curve Point Multiplication Over ${\rm GF}(p)$
inferred← citeshttps://doi.org/10.1117/12.406499openalex-snapshot
Some improvements on RNS Montgomery modular multiplication
inferred← citeshttps://doi.org/10.1117/12.557891openalex-snapshot
RNS bases and conversions
inferred← citeshttps://doi.org/10.1142/s0218126610007134openalex-snapshot
GENERALIZED ALGORITHMS FOR BINARY MODULO MULTIPLICATION AND MULTIPLICATION-DIVISION
inferred← citeshttps://doi.org/10.1145/3431499openalex-snapshot
Efficient Cryptographic Hardware for Safety Message Verification in Internet of Connected Vehicles
inferred← citeshttps://doi.org/10.1201/b15006-22openalex-snapshot
Cryptography
inferred← citeshttps://doi.org/10.12928/telkomnika.v19i5.19416openalex-snapshot
Efficient hardware prototype of ECDSA modules for blockchain applications
inferred← citeshttps://doi.org/10.13021/mars/5029openalex-snapshot
DEVELOPMENT AND BENCHMARKING OF NEW HARDWARE ARCHITECTURES FOR EMERGING CRYPTOGRAPHIC TRANSFORMATIONS
inferred← citeshttps://doi.org/10.14569/ijacsa.2016.071014openalex-snapshot
A Coreference Resolution Approach using Morphological Features in Arabic
inferred← citeshttps://doi.org/10.1515/jmc.2011.006openalex-snapshot
RNS arithmetic in 𝔽 p k and application to fast pairing computation
inferred← citeshttps://doi.org/10.1587/elex.10.20130704openalex-snapshot
A scalable RNS Montgomery multiplier over F2m
inferred← citeshttps://doi.org/10.21203/rs.3.rs-86431/v1openalex-snapshot
High-Performance RNS Modular Exponentiation by Sum-Residue Reduction
inferred← citeshttps://doi.org/10.23919/fpl.2017.8056816openalex-snapshot
Fast RNS implementation of elliptic curve point multiplication in GF(p) with selected base pairs
inferred← citeshttps://doi.org/10.32657/10356/2379openalex-snapshot
VLSI efficient architectures for triple moduli based RNS computations
inferred← citeshttps://doi.org/10.32657/10356/2603openalex-snapshot
High performance hardware security components
inferred← citeshttps://doi.org/10.3390/app15105332openalex-snapshot
An Efficient Implementation of Montgomery Modular Multiplication Using a Minimally Redundant Residue Number System
inferred← citeshttps://doi.org/10.3390/cryptography10040047openalex-snapshot
ML-KEM (CRYSTALS-Kyber) on FPGA Using the Residue Number System
inferred← citeshttps://doi.org/10.3390/cryptography3020014openalex-snapshot
Improved Sum of Residues Modular Multiplication Algorithm
inferred← citeshttps://doi.org/10.46586/tches.v2019.i1.259-282openalex-snapshot
Practical Evaluation of Protected Residue Number System Scalar Multiplication
inferred← citeshttps://doi.org/10.47839/ijc.19.2.1767openalex-snapshot
DATA ERRORS CONTROL IN THE MODULAR NUMBER SYSTEM BASED ON THE NULLIFICATION PROCEDURE
inferred← citeshttps://doi.org/10.48550/arxiv.1602.01551openalex-snapshot
New Residue Arithmetic Based Barrett Algorithms, Part I: Modular Integer Computations
inferred← citeshttps://doi.org/10.48550/arxiv.1602.01553openalex-snapshot
New Residue Arithmetic Based Barrett Algorithms, Part II: Modular Polynomial Computations
inferred← citeshttps://doi.org/10.5121/acij.2012.3510openalex-snapshot
Justification of Montgomery Modular Reduction
inferred← citeshttps://doi.org/10.5772/56295openalex-snapshot
Efficient Computation for Pairing Based Cryptography: A State of the Art
inferred← citeshttps://doi.org/10.5802/aif.2233openalex-snapshot
Dynamical directions in numeration
inferred← citeshttps://doi.org/10.5802/pmb.a-152openalex-snapshot
Combining leak-resistant arithmetic for elliptic curves defined over 𝔽 p and RNS representation
inferred← citeshttps://doi.org/10.70675/b990f775zec44z49d5zb7ffzacb552415404openalex-snapshot
Contribution de l'arithmétique des ordinateurs aux implémentations résistantes aux attaques par canaux auxiliaires
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.