On the public citation graph

a full RNS implementation of RSA

0 signed · 232 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-34805-0_34openalex-snapshot
A Survey of Hardware Implementations of RSA
inferredcites →https://doi.org/10.1007/3-540-44709-1_30openalex-snapshot
Implementation of RSA Algorithm Based on RNS Montgomery Multiplication
inferredcites →https://doi.org/10.1007/3-540-45539-6_37openalex-snapshot
Cox-Rower Architecture for Fast Parallel Montgomery Multiplication
inferredcites →https://doi.org/10.1007/978-3-540-28632-5_5openalex-snapshot
Leak Resistant Arithmetic
inferredcites →https://doi.org/10.1049/el:19820617openalex-snapshot
Fast decipherment algorithm for RSA public-key cryptosystem
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.277287openalex-snapshot
Hardware implementation of Montgomery's modular multiplication algorithm
inferredcites →https://doi.org/10.1109/40.502403openalex-snapshot
Analyzing and comparing Montgomery multiplication algorithms
inferredcites →https://doi.org/10.1109/71.382314openalex-snapshot
Modulo reduction in residue number systems
inferredcites →https://doi.org/10.1109/arith.1993.378085openalex-snapshot
Fast implementations of RSA cryptography
inferredcites →https://doi.org/10.1109/arith.2001.930104openalex-snapshot
Modular multiplication and base extensions in residue number systems
inferredcites →https://doi.org/10.1109/mc.1984.1659138openalex-snapshot
Residue Arithmetic A Tutorial with Examples
inferredcites →https://doi.org/10.1109/tec.1959.5219515openalex-snapshot
The Residue Number System
inferredcites →https://doi.org/10.1145/1457838.1457864openalex-snapshot
The residue number system
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
inferredcites →https://doi.org/10.1201/9781439821916openalex-snapshot
Handbook of Applied Cryptography
inferredcites →https://doi.org/10.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography

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.1002/cta.3594openalex-snapshot
RNS processor using moduli sets of the form 2n±1
inferred← citeshttps://doi.org/10.1007/11902140_103openalex-snapshot
Finite Field Polynomial Multiplication in the Frequency Domain with Application to Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/978-0-387-73661-7_20openalex-snapshot
Current Mask Generation: an Analog Circuit to Thwart DPA Attacks
inferred← citeshttps://doi.org/10.1007/978-3-030-34339-2_22openalex-snapshot
Using Freivalds’ Algorithm to Accelerate Lattice-Based Signature Verifications
inferred← citeshttps://doi.org/10.1007/978-3-030-97020-8_23openalex-snapshot
Reference Points Based RNS Reverse Conversion for General Moduli Sets
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-73122-8_5openalex-snapshot
RISC-V Word-Size Modular Instructions for Residue Number Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-14971-4_4openalex-snapshot
Residue Number Systems in Cryptography: Design, Challenges, Robustness
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-49742-6_12openalex-snapshot
RNS-Based Public-Key Cryptography (RSA and ECC)
inferred← citeshttps://doi.org/10.1007/978-3-319-49742-6_2openalex-snapshot
RNS-Based Embedded Processor Design
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-28632-5_5openalex-snapshot
Leak Resistant Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-540-89985-3_138openalex-snapshot
A New Operator for Multi-addition Calculations
inferred← citeshttps://doi.org/10.1007/978-3-642-19706-2_4openalex-snapshot
High Radix Montgomery Multipliers for Residue Arithmetic Channels on FPGAs
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-81-322-1695-7_27openalex-snapshot
Improved RNS Montgomery Modular Multiplication with Residue Recovery
inferred← citeshttps://doi.org/10.1007/978-94-007-1488-5_14openalex-snapshot
SUT-RNS Forward and Reverse Converters
inferred← citeshttps://doi.org/10.1007/978-981-13-7091-5_32openalex-snapshot
Design and Functional Verification of Reversible Logic Based FFT Using OHRNS
inferred← citeshttps://doi.org/10.1007/978-981-96-4229-8_17openalex-snapshot
Secure Outsourcing Scheme for RNS-Based Paillier Cryptosystem in Cloud Computing
inferred← citeshttps://doi.org/10.1007/978-981-99-1410-4_35openalex-snapshot
A Security Enhanced Image Encryption and Compression Using Residue Number System and Discrete Cosine Transform
inferred← citeshttps://doi.org/10.1007/s00034-011-9326-5openalex-snapshot
On the Design of Modulo 2 n ±1 Subtractors and Adders/Subtractors
inferred← citeshttps://doi.org/10.1007/s00034-014-9798-1openalex-snapshot
Efficient Reverse Converters for 4-Moduli Sets {2 $$^{2n-1}-1$$ 2 n - 1 - 1 , 2 $$^{n}$$ n , 2 $$^{n}+1$$ n + 1 , 2 $$^{n}-1$$ n - 1 } and {2 $$^{2n-1}$$ 2 n - 1 , 2 $$^{2n-1}-1$$ 2 n - 1 - 1 , 2 $$^{n}+1$$ n + 1 , 2 $$^{n}-1$$ n - 1 } Based on CRTs Algorithm
inferred← citeshttps://doi.org/10.1007/s00034-014-9799-0openalex-snapshot
Method for Designing Efficient Mixed Radix Multipliers
inferred← citeshttps://doi.org/10.1007/s00034-016-0336-1openalex-snapshot
Highly Parallel Modular Multiplier for Elliptic Curve Cryptography in Residue Number System
inferred← citeshttps://doi.org/10.1007/s00034-018-0756-1openalex-snapshot
Designing Efficient Two-Level Reverse Converters for Moduli Set $$\{2^{2n+1}-1,2^{2n},2^{n}-1\}$$ { 2 2 n + 1 - 1 , 2 2 n , 2 n - 1 }
inferred← citeshttps://doi.org/10.1007/s10470-020-01749-zopenalex-snapshot
Efficient two-level reverse converters for the four-moduli set {2n−1, 2n–1, 2n−1–1, 2n+1–1}
inferred← citeshttps://doi.org/10.1007/s11107-021-00941-zopenalex-snapshot
A new sign detection design for the residue number system based on quantum-dot cellular automata
inferred← citeshttps://doi.org/10.1007/s11235-015-0098-2openalex-snapshot
RDTP: reliable data transport protocol in wireless sensor networks
inferred← citeshttps://doi.org/10.1007/s11265-007-0135-9openalex-snapshot
Parallel Memory Architecture for Elliptic Curve Cryptography over % MathType!Translator!2!1!AMS LaTeX.tdl!TeX -- AMS-LaTeX! % MathType!MTEF!2!1!+- % feaaeaart1ev0aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbbjxAHX % garmWu51MyVXgatuuDJXwAK1uy0HwmaeHbfv3ySLgzG0uy0Hgip5wz %…
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/s12209-012-1902-7openalex-snapshot
Hardware architecture for RSA cryptography based on residue number system
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-018-0195-8openalex-snapshot
RNS Montgomery reduction algorithms using quadratic residuosity
inferred← citeshttps://doi.org/10.1007/s13389-019-00221-7openalex-snapshot
Efficient modular operations using the adapted modular number system
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.1007/s13389-021-00260-zopenalex-snapshot
Montgomery-friendly primes and applications to cryptography
inferred← citeshttps://doi.org/10.1016/b978-0-12-819728-8.00063-2openalex-snapshot
Unconventional Arithmetic Circuits
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.compeleceng.2012.10.005openalex-snapshot
On the design of modulo 2n+1 dot product and generalized multiply–add units
inferred← citeshttps://doi.org/10.1016/j.ins.2006.02.012openalex-snapshot
An efficient parity detection technique using the two-moduli set {2h−1,2h+1}
inferred← citeshttps://doi.org/10.1016/j.micpro.2012.02.004openalex-snapshot
Area-time efficient multi-modulus adders and their applications
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.micpro.2023.104853openalex-snapshot
An improved residue multiplier using Montgomery modular multiplication
inferred← citeshttps://doi.org/10.1016/j.micpro.2023.104897openalex-snapshot
On the modulo 2 +1 addition and subtraction for weighted operands
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.2013.04.001openalex-snapshot
Efficient modulo 2 +1 multiply and multiply-add units based on modified Booth encoding
inferred← citeshttps://doi.org/10.1016/j.vlsi.2016.02.004openalex-snapshot
Method for designing two levels RNS reverse converters for large dynamic ranges
inferred← citeshttps://doi.org/10.1016/j.vlsi.2016.12.005openalex-snapshot
Area, energy, and time assessment for a distributed TPM for distributed trust in IoT clusters
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.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:20060059openalex-snapshot
Improving residue number system multiplication with more balanced moduli sets and enhanced modular arithmetic structures
inferred← citeshttps://doi.org/10.1049/tje2.12105openalex-snapshot
Radix‐16 CSA‐based low‐latency non‐Montgomery modular multiplier
inferred← citeshttps://doi.org/10.1080/00207160.2010.488689openalex-snapshot
An improved Chen's parity detection technique for the two-moduli set
inferred← citeshttps://doi.org/10.1080/00207160.2016.1247439openalex-snapshot
Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem
inferred← citeshttps://doi.org/10.1080/00207217.2015.1020528openalex-snapshot
Efficient architectures for modulo 2n − 2 arithmetic units
inferred← citeshttps://doi.org/10.1080/23799927.2017.1415978openalex-snapshot
RNS parity detection for the two-moduli set {2p − j,2p + j}
inferred← citeshttps://doi.org/10.1109/access.2020.2983020openalex-snapshot
The Role of Non-Positional Arithmetic on Efficient Emerging Cryptographic Algorithms
inferred← citeshttps://doi.org/10.1109/acit69831.2026.11700118openalex-snapshot
Encryption Methods in the RNS Based on Changing Parameters of the Chinese Remainder Theorem
inferred← citeshttps://doi.org/10.1109/apsipa.2016.7820790openalex-snapshot
Algorithms for comparison in residue number systems
inferred← citeshttps://doi.org/10.1109/arith.2009.20openalex-snapshot
Selected RNS Bases for Modular Multiplication
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.2017.39openalex-snapshot
Lazy Leak Resistant Exponentiation in RNS
inferred← citeshttps://doi.org/10.1109/arith.2019.00016openalex-snapshot
Hierarchical Approach in RNS Base Extension for Asymmetric Cryptography
inferred← citeshttps://doi.org/10.1109/arith.2019.00049openalex-snapshot
HyPoRes: An Hybrid Representation System for ECC
inferred← citeshttps://doi.org/10.1109/arith54963.2022.00025openalex-snapshot
A software comparison of RNS and PMNS
inferred← citeshttps://doi.org/10.1109/arith61463.2024.00013openalex-snapshot
Montgomery Modular Multiplication via Single-Base Residue Number Systems
inferred← citeshttps://doi.org/10.1109/asap.2015.7245723openalex-snapshot
Programmable RNS lattice-based parallel cryptographic decryption
inferred← citeshttps://doi.org/10.1109/asiajcis.2014.13openalex-snapshot
Parity Detection for Some Three-Modulus Residue Number System
inferred← citeshttps://doi.org/10.1109/aspdac.2012.6165068openalex-snapshot
Efficient implementation of multi-moduli architectures for Binary-to-RNS conversion
inferred← citeshttps://doi.org/10.1109/cns.2018.8433140openalex-snapshot
Delegating Elliptic-Curve Operations with Homomorphic Encryption
inferred← citeshttps://doi.org/10.1109/dsd.2011.64openalex-snapshot
On the Design of Modulo 2^n+1 Multipliers
inferred← citeshttps://doi.org/10.1109/dsd.2011.66openalex-snapshot
Modulo 2^n+1 Arithmetic Units with Embedded Diminished-to-Normal Conversion
inferred← citeshttps://doi.org/10.1109/dsd.2012.121openalex-snapshot
SUT-RNS Residue-to-Binary Converters Design
inferred← citeshttps://doi.org/10.1109/dsd.2012.92openalex-snapshot
On the Design of Configurable Modulo 2n±1 Residue Generators
inferred← citeshttps://doi.org/10.1109/dsd.2013.125openalex-snapshot
Comparison of FPGA and ASIC Implementation of a Linear Congruence Solver
inferred← citeshttps://doi.org/10.1109/dsd.2013.44openalex-snapshot
Electromagnetic Analysis on RSA Algorithm Based on RNS
inferred← citeshttps://doi.org/10.1109/dtis.2011.5941427openalex-snapshot
On the diminished-1 modulo 2N+1 fused multiply-add units
inferred← citeshttps://doi.org/10.1109/dtis.2014.6850645openalex-snapshot
On the design of efficient modulo 2n+1 multiply-add-add units
inferred← citeshttps://doi.org/10.1109/dtis.2016.7483875openalex-snapshot
Fused modulo 2n + 1 add-multiply unit for weighted operands
inferred← citeshttps://doi.org/10.1109/ecs.2017.8067858openalex-snapshot
Design of high speed area efficient OHRNS data path subsystems for FFT implementation
inferred← citeshttps://doi.org/10.1109/elconrus51938.2021.9396072openalex-snapshot
About One Property of Number Rank in RNS
inferred← citeshttps://doi.org/10.1109/ent47717.2019.9030549openalex-snapshot
The Accuracy Estimation of the Interval-Positional Characteristic in Residue Number System
inferred← citeshttps://doi.org/10.1109/eurocon.2013.6625222openalex-snapshot
Modulo 2n−2 arithmetic units
inferred← citeshttps://doi.org/10.1109/fpl.2006.311335openalex-snapshot
A Leak Resistant Architecture Against Side Channel Attacks
inferred← citeshttps://doi.org/10.1109/fpt.2006.270306openalex-snapshot
A novel memory architecture for elliptic curve cryptography with parallel modular multipliers
inferred← citeshttps://doi.org/10.1109/hpca.2018.00065openalex-snapshot
Memory System Design for Ultra Low Power, Computationally Error Resilient Processor Microarchitectures
inferred← citeshttps://doi.org/10.1109/iadcc.2010.5423007openalex-snapshot
Implementation of stream cipher system based on representation of integers in Residue Number System
inferred← citeshttps://doi.org/10.1109/icact.2008.4494087openalex-snapshot
A New Moduli Set {3n - 1,3n+1,3n + 2,3n - 2} in Residue Number System
inferred← citeshttps://doi.org/10.1109/iccasm.2010.5622857openalex-snapshot
An improved RNS Montgomery modular multiplier
inferred← citeshttps://doi.org/10.1109/iccd.2010.5647761openalex-snapshot
A unified addition structure for moduli set {2n−1, 2n, 2n+1} based on a novel RNS representation
inferred← citeshttps://doi.org/10.1109/iccit48885.2019.9038275openalex-snapshot
Parallelized RSA Algorithm: An Analysis with Performance Evaluation using OpenMP Library in High Performance Computing Environment
inferred← citeshttps://doi.org/10.1109/icears53579.2022.9752356openalex-snapshot
A study of AES and RSA algorithms based on GPUs
inferred← citeshttps://doi.org/10.1109/icecs.2009.5410842openalex-snapshot
Elliptic Curve Point Multiplication in GF(2n) using Polynomial Residue Arithmetic
inferred← citeshttps://doi.org/10.1109/icecs.2012.6463632openalex-snapshot
Dedicated hardware implementation of a linear congruence solver in FPGA
inferred← citeshttps://doi.org/10.1109/icecs.2014.7049916openalex-snapshot
Fused modulo 2n − 1 add-multiply unit
inferred← citeshttps://doi.org/10.1109/icecs.2014.7050083openalex-snapshot
An ASIC linear congruence solver synthesized with three cell libraries
inferred← citeshttps://doi.org/10.1109/icedsa.2010.5503091openalex-snapshot
An efficient adder/subtracter circuit for one-hot residue number 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/icoei48184.2020.9142974openalex-snapshot
Implementation of Efficient Modulo 2nAdders for Cryptographic Applications
inferred← citeshttps://doi.org/10.1109/icrccs.2009.40openalex-snapshot
An Improved Exponentiation Algorithm for RSA Cryptosystem
inferred← citeshttps://doi.org/10.1109/icscs.2008.4746907openalex-snapshot
On the modulo 2n+1 multiplication for diminished-1 operands
inferred← citeshttps://doi.org/10.1109/idt.2014.7038614openalex-snapshot
Modulo 2n+1 addition and multiplication for redundant operands
inferred← citeshttps://doi.org/10.1109/inis.2015.17openalex-snapshot
Area, Energy, and Time Assessment for a Distributed TPM for Distributed Trust in IoT Clusters
inferred← citeshttps://doi.org/10.1109/iotais.2018.8600881openalex-snapshot
FPGA Implementation of Modular Multiplier in Residue Number System
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/ipdps.2007.370380openalex-snapshot
A Cryptographic Coarse Grain Reconfigurable Architecture Robust Against DPA
inferred← citeshttps://doi.org/10.1109/ipdpsw.2014.187openalex-snapshot
A Distributed Speech Algorithm for Large Scale Data Communication Systems
inferred← citeshttps://doi.org/10.1109/iraniancee.2010.5507015openalex-snapshot
An efficient one-hot OHR adder circuit
inferred← citeshttps://doi.org/10.1109/iscas.2006.1693348openalex-snapshot
An RNS architecture of an F/sub p/ elliptic curve point multiplier
inferred← citeshttps://doi.org/10.1109/iscas.2009.5117780openalex-snapshot
Fixed and variable multi-modulus squarer architectures for triple moduli base of RNS
inferred← citeshttps://doi.org/10.1109/iscas.2011.5937776openalex-snapshot
A RNS Montgomery multiplication architecture
inferred← citeshttps://doi.org/10.1109/iscas.2013.6572280openalex-snapshot
Hardware-fault attack handling in RNS-based Montgomery multipliers
inferred← citeshttps://doi.org/10.1109/isicir.2014.7029521openalex-snapshot
ROM-less RNS-to-binary converter moduli {22n − 1, 22n + 1, 2n − 3, 2n + 3}
inferred← citeshttps://doi.org/10.1109/isit.2018.8437612openalex-snapshot
A Multi-layer Recursive Residue Number System
inferred← citeshttps://doi.org/10.1109/issoc.2006.322005openalex-snapshot
A Leak Resistant SoC to Counteract Side Channel Attacks
inferred← citeshttps://doi.org/10.1109/isvlsi.2010.23openalex-snapshot
SUT-RNS Forward and Reverse Converters
inferred← citeshttps://doi.org/10.1109/isvlsi.2015.12openalex-snapshot
Modulo 2n ± 1 Fused Add-Multiply Units
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/itng.2006.60openalex-snapshot
Efficient Methods in Converting to Modulo 2^n+1 and 2^n-1
inferred← citeshttps://doi.org/10.1109/itng.2008.32openalex-snapshot
Very Fast Multi Operand Addition Method by Bitwise Subtraction
inferred← citeshttps://doi.org/10.1109/jiot.2018.2881425openalex-snapshot
Signature Gateway: Offloading Signature Generation to IoT Gateway Accelerated by GPU
inferred← citeshttps://doi.org/10.1109/jiot.2020.2981276openalex-snapshot
Scalable Data Storage Design for Nonstationary IoT Environment With Adaptive Security and Reliability
inferred← citeshttps://doi.org/10.1109/mcas.2015.2484118openalex-snapshot
Residue Number Systems: A New Paradigm to Datapath Optimization for Low-Power and High-Performance Digital Signal Processing Applications
inferred← citeshttps://doi.org/10.1109/mcas.2016.2614714openalex-snapshot
Combining Residue Arithmetic to Design Efficient Cryptographic Circuits and Systems
inferred← citeshttps://doi.org/10.1109/mcas.2020.3027425openalex-snapshot
Nonconventional Computer Arithmetic Circuits, Systems and Applications
inferred← citeshttps://doi.org/10.1109/melcon.2006.1653327openalex-snapshot
A New Approach to Elliptic Curve Cryptography: an RNS Architecture
inferred← citeshttps://doi.org/10.1109/mocast.2016.7495110openalex-snapshot
Fused modulo 2n + 1 Add-Multiply unit for diminished-1 operands
inferred← citeshttps://doi.org/10.1109/mwscas.2013.6674830openalex-snapshot
Low latency modular multiplication for public-key cryptosystems using a scalable array of parallel processing elements
inferred← citeshttps://doi.org/10.1109/paap.2011.75openalex-snapshot
A Novel Architecture for Fast RSA Key Generation Based on RNS
inferred← citeshttps://doi.org/10.1109/sibcon.2015.7146986openalex-snapshot
Realization problems of cryptographic transformations by transfer of modular data in security systems
inferred← citeshttps://doi.org/10.1109/tc.2011.121openalex-snapshot
Homomorphic Property-Based Concurrent Error Detection of RSA: A Countermeasure to Fault Attack
inferred← citeshttps://doi.org/10.1109/tc.2012.84openalex-snapshot
An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS
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.2021.3055754openalex-snapshot
Scalable Energy-Efficient Microarchitectures With Computational Error Tolerance Via Redundant Residue Number Systems
inferred← citeshttps://doi.org/10.1109/tcsi.2008.2008507openalex-snapshot
An RNS Implementation of an $F_{p}$ Elliptic Curve Point Multiplier
inferred← citeshttps://doi.org/10.1109/tcsi.2010.2092133openalex-snapshot
Radix-8 Booth Encoded Modulo $2 ^{n} -1$ Multipliers With Adaptive Delay for High Dynamic Range Residue Number System
inferred← citeshttps://doi.org/10.1109/tcsi.2012.2185334openalex-snapshot
Area-Power Efficient Modulo $2^{n}-1$ and Modulo $2^{n}+1$ Multipliers for $\{2^{n}-1, 2^{n}, 2^{n}+1\}$ Based RNS
inferred← citeshttps://doi.org/10.1109/tcsi.2012.2220460openalex-snapshot
RNS Reverse Converters for Moduli Sets With Dynamic Ranges up to $(8n+1)$-bit
inferred← citeshttps://doi.org/10.1109/tcsi.2013.2283674openalex-snapshot
Multifunction Residue Architectures for Cryptography
inferred← citeshttps://doi.org/10.1109/tcsii.2008.2010157openalex-snapshot
A Generalization of a Fast RNS Conversion for a New 4-Modulus Base
inferred← citeshttps://doi.org/10.1109/tcsii.2013.2286433openalex-snapshot
Method to Design General RNS Reverse Converters for Extended Moduli Sets
inferred← citeshttps://doi.org/10.1109/tcsii.2016.2608335openalex-snapshot
An Efficient Reverse Converter for the Three-Moduli Set ( $ 2^{n+1}-1, 2^{n}, 2^{n}-1$ )
inferred← citeshttps://doi.org/10.1109/tcsii.2020.3035350openalex-snapshot
Evaluation of Mixed-Radix Digit Computation Techniques for the Three Moduli RNS {2 n −1, 2 n , 2 n+1−1}
inferred← citeshttps://doi.org/10.1109/tencon.2009.5396175openalex-snapshot
Elliptic curve digital signature algorithm over GF(p) on a residue number system enabled microprocessor
inferred← citeshttps://doi.org/10.1109/tetc.2021.3073475openalex-snapshot
Efficient Word Size Modular Arithmetic
inferred← citeshttps://doi.org/10.1109/trustcom/bigdatase/icess.2017.344openalex-snapshot
Base Extent Optimization for RNS Montgomery Algorithm
inferred← citeshttps://doi.org/10.1109/tvlsi.2014.2314174openalex-snapshot
Arithmetic-Based Binary-to-RNS Converter Modulo ${\{2^{n}{\pm}k\}}$ for $jn$ -bit Dynamic Range
inferred← citeshttps://doi.org/10.1109/uemcon.2016.7777905openalex-snapshot
Secuirity in cloud storage: An enhanced technique of data storage in cloud using RNS
inferred← citeshttps://doi.org/10.1109/upcon47278.2019.8980093openalex-snapshot
Design of Efficient Sign Detector for Moduli Set $\{2^{n}-1,2^{n}, 2^{n}+1\}$ in Residue Number System
inferred← citeshttps://doi.org/10.1109/vlsi-soc.2013.6673241openalex-snapshot
On the design of modulo 2n±1 residue generators
inferred← citeshttps://doi.org/10.1109/vlsisoc.2010.5642611openalex-snapshot
An improved RNS generator 2n ± k based on threshold logic
inferred← citeshttps://doi.org/10.1109/wicom.2009.5302313openalex-snapshot
Hardware Implement of the Forward Value Conversion Algorithm for Delta-Sigma System Based Direct Stream Digital
inferred← citeshttps://doi.org/10.1117/12.557891openalex-snapshot
RNS bases and conversions
inferred← citeshttps://doi.org/10.1117/12.617543openalex-snapshot
Study of modular inversion in RNS
inferred← citeshttps://doi.org/10.1117/12.679541openalex-snapshot
Residue systems efficiency for modular products summation: application to elliptic curves cryptography
inferred← citeshttps://doi.org/10.1142/s0218126611007906openalex-snapshot
AN EFFICIENT REVERSE CONVERTER FOR THE NEW FOUR-MODULI SET {22n, 2n+1 - 1, 2n/2 + 1, 2n/2 - 1}
inferred← citeshttps://doi.org/10.1142/s0218126615500164openalex-snapshot
Efficient RNS Converter via Two-Part RNS
inferred← citeshttps://doi.org/10.1142/s0218126620300056openalex-snapshot
On the Diminished-1 Modulo 2n+1 Addition and Subtraction
inferred← citeshttps://doi.org/10.1142/s0218126620300081openalex-snapshot
Perspective and Opportunities of Modulo 2n−1 Multipliers in Residue Number System: A Review
inferred← citeshttps://doi.org/10.1142/s0218126621501413openalex-snapshot
Design of Efficient Reverse Converters for Residue Number System
inferred← citeshttps://doi.org/10.1142/s0219519410003307openalex-snapshot
HIGH-SPEED AND SECURE ENCRYPTION SCHEMES BASED ON CHINESE REMAINDER THEOREM FOR STORAGE AND TRANSMISSION OF MEDICAL INFORMATION
inferred← citeshttps://doi.org/10.1145/2483028.2483104openalex-snapshot
On the design of modulo 2 n -1 cubing units
inferred← citeshttps://doi.org/10.1145/3136825.3136866openalex-snapshot
An enhanced parallel version of RSA public key crypto based algorithm using openMP
inferred← citeshttps://doi.org/10.1145/3177837openalex-snapshot
Extending Moore’s Law via Computationally Error-Tolerant Computing
inferred← citeshttps://doi.org/10.1145/3431920.3439299openalex-snapshot
Folded Integer Multiplication for FPGAs
inferred← citeshttps://doi.org/10.1155/2010/657076openalex-snapshot
Revisiting Sum of Residues Modular Multiplication
inferred← citeshttps://doi.org/10.1155/2014/107109openalex-snapshot
Efficient Big Integer Multiplication and Squaring Algorithms for Cryptographic Applications
inferred← citeshttps://doi.org/10.1155/2014/698125openalex-snapshot
Energy Efficient and High Speed Error Control Scheme for Real Time Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1155/2024/4894415openalex-snapshot
Symmetric Encryption Algorithms in a Polynomial Residue Number System
inferred← citeshttps://doi.org/10.11591/ijeecs.v22.i1.pp62-70openalex-snapshot
Design and analysis of RNS-based sign detector for moduli set {2^n, 2^n - 1, 2^n + 1}
inferred← citeshttps://doi.org/10.11606/t.3.2013.tde-23052014-010449openalex-snapshot
Método de multiplicação de baixa potência para criptosistema de chave-pública.
inferred← citeshttps://doi.org/10.11648/j.net.20180601.14openalex-snapshot
Rivest Shamir Adleman Encryption Scheme Based on the Chinese Remainder Theorem
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.1515/jmc-2016-0066openalex-snapshot
Enhancing Goldreich, Goldwasser and Halevi’s scheme with intersecting lattices
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.1523/jneurosci.5684-07.2008openalex-snapshot
What Grid Cells Convey about Rat Location
inferred← citeshttps://doi.org/10.1587/elex.9.1openalex-snapshot
Efficient RNS to binary converters for the new 4-moduli set {2n, 2n+1-1, 2n-1, 2n-1-1}
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.22199/issn.0717-6279-2934openalex-snapshot
A general method for to decompose modular multiplicative inverse operators over Group of units
inferred← citeshttps://doi.org/10.22214/ijraset.2018.4643openalex-snapshot
VLSI Implementation of a Reverse Converter for a Class of Six Moduli Set
inferred← citeshttps://doi.org/10.24425/ijet.2022.141263openalex-snapshot
Program for Simulation and Testing of Apply Cryptography of Advance Encryption Standard (AES) Algorithm with Rivest-Shamir-Adleman (RSA) Algorithm for Good Performance
inferred← citeshttps://doi.org/10.25209/2079-3316-2019-10-3-81-127openalex-snapshot
High-precision computations using residue-interval arithmetic on FPGAs
inferred← citeshttps://doi.org/10.26083/tuprints-00001327openalex-snapshot
Efficient and Flexible Cryptographic Co-Processor Architecture for Server Application
inferred← citeshttps://doi.org/10.29252/jsdp.15.1.127openalex-snapshot
Modulo 2n+1 Multiply and MAC Units Specified for DSPs
inferred← citeshttps://doi.org/10.31114/2078-7707-2022-3-102-107openalex-snapshot
Implementation of an RNS Reverse Converter for General Moduli Sets Based on LUTs with Reference Points
inferred← citeshttps://doi.org/10.3233/jid-2008-12102openalex-snapshot
RELIABLE AND SECURE CHIP LEVEL COMMUNICATION BY RESIDUE NUMBER SYSTEM CODE
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.32657/10356/50689openalex-snapshot
Novel modulo multipliers for moduli 2^n-1, 2^n and 2^n+1.
inferred← citeshttps://doi.org/10.32657/10356/70712openalex-snapshot
New algorithms for hardware-efficient implementation of sign detection and magnitude comparison in residue number systems
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/computation10010009openalex-snapshot
Improved Modular Division Implementation with the Akushsky Core Function
inferred← citeshttps://doi.org/10.3390/cryptography3020014openalex-snapshot
Improved Sum of Residues Modular Multiplication Algorithm
inferred← citeshttps://doi.org/10.3390/e23080967openalex-snapshot
Shannon Entropy Loss in Mixed-Radix Conversions
inferred← citeshttps://doi.org/10.3390/electronics8060694openalex-snapshot
Construction of Residue Number System Using Hardware Efficient Diagonal Function
inferred← citeshttps://doi.org/10.3390/math10010084openalex-snapshot
En-AR-PRNS: Entropy-Based Reliability for Configurable and Scalable Distributed Storage Systems
showing the first 200 of 213 · page through all 213
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.