On the public citation graph
Fast Modular Reduction
0 signed · 47 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-39118-5_10openalex-snapshot
The RSA Cryptography Processor
inferredcites →https://doi.org/10.1007/3-540-47721-7_24openalex-snapshot
Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor
inferredcites →https://doi.org/10.1007/3-540-48059-5_10openalex-snapshot
A Scalable Architecture for Montgomery Nultiplication
inferredcites →https://doi.org/10.1007/bf02242355openalex-snapshot
Schnelle Multiplikation großer Zahlen
inferredcites →https://doi.org/10.1016/0165-6074(86)90094-3openalex-snapshot
An RSA cryptography processor
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1109/40.502403openalex-snapshot
Analyzing and comparing Montgomery multiplication algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-63092-8_58openalex-snapshot
An Application of Metacyclic and Miller-Moreno p-Groups to Generalization of Diffie-Hellman Protocol
inferred← citeshttps://doi.org/10.1007/978-3-032-10536-3_15openalex-snapshot
Unified MEDS Accelerator
inferred← citeshttps://doi.org/10.1007/978-3-319-19647-3_28openalex-snapshot
Efficient Modular Reduction Algorithm Without Correction Phase
inferred← citeshttps://doi.org/10.1007/978-3-319-49679-5_11openalex-snapshot
Towards Adaptive Cryptography and Security with Software Defined Platforms
inferred← citeshttps://doi.org/10.1007/978-3-319-55595-9_3openalex-snapshot
Secure, Green Implementation of Modular Arithmetic Operations for IoT and Cloud Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-33027-8_27openalex-snapshot
Reduce-by-Feedback: Timing Resistant and DPA-Aware Modular Multiplication Plus: How to Break RSA by DPA
inferred← citeshttps://doi.org/10.1007/978-981-96-0668-9_15openalex-snapshot
Bridging Algorithmic Foundations with Information Security and Privacy: Set-k-Multicover Problem and Homomorphic Secret Sharing
inferred← citeshttps://doi.org/10.1007/s10440-006-9046-1openalex-snapshot
Efficient Software-Implementation of Finite Fields with Applications to Cryptography
inferred← citeshttps://doi.org/10.1007/s10559-026-00860-9openalex-snapshot
Method and Algorithm for Interbase Conversion of Rademacher Binary Codes into Christensen Residue Codes
inferred← citeshttps://doi.org/10.1038/s41598-025-04987-1openalex-snapshot
Optimized quantum folding Barrett reduction for quantum modular multipliers
inferred← citeshttps://doi.org/10.1109/access.2024.3473901openalex-snapshot
Integer Modular Multiplication With Barrett Reduction and Its Variants for Homomorphic Encryption Applications: A Comprehensive Review and an Empirical Study
inferred← citeshttps://doi.org/10.1109/access.2024.3473903openalex-snapshot
Configurable Arithmetic Core Architecture for RNS-CKKS Homomorphic Encryption
inferred← citeshttps://doi.org/10.1109/apccas67402.2025.11377043openalex-snapshot
Comparison of Barrett Modular Reduction with Various Multipliers in the Context of BFV/BGV Homomorphic Encryption
inferred← citeshttps://doi.org/10.1109/arith.2011.11openalex-snapshot
Short Division of Long Integers
inferred← citeshttps://doi.org/10.1109/arith.2017.15openalex-snapshot
Fast Arithmetic Modulo 2^x p^y ± 1
inferred← citeshttps://doi.org/10.1109/arith.2018.8464771openalex-snapshot
A New Variant of the Barrett Algorithm Applied to Quotient Selection
inferred← citeshttps://doi.org/10.1109/dictap.2012.6215379openalex-snapshot
Fast modular reduction for large-integer multiplication for cryptosystem application
inferred← citeshttps://doi.org/10.1109/fpl64840.2024.00047openalex-snapshot
FPGA Modular Multipliers using Hybrid Reduction Techniques
inferred← citeshttps://doi.org/10.1109/icsict.2012.6467863openalex-snapshot
Modular multiplier by folding Barrett modular reduction
inferred← citeshttps://doi.org/10.1109/iscas56072.2025.11043933openalex-snapshot
An Efficient NTT-Based Polynomial Multiplication Architecture for BFV Homomorphic Encryption
inferred← citeshttps://doi.org/10.1109/isctrkiye61151.2023.10336068openalex-snapshot
Methods for Masking CRYSTALS-Kyber Against Side-Channel Attacks
inferred← citeshttps://doi.org/10.1109/islped52811.2021.9502490openalex-snapshot
A High-Performance Low-Power Barrett Modular Multiplier for Cryptosystems
inferred← citeshttps://doi.org/10.1109/tc.2018.2851238openalex-snapshot
Arithmetic Considerations for Isogeny-Based Cryptography
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/tcsii.2024.3357836openalex-snapshot
Hardware Circuits and Systems Design for Post-Quantum Cryptography—A Tutorial Brief
inferred← citeshttps://doi.org/10.1109/tvlsi.2024.3368002openalex-snapshot
Design of a High-Performance Iterative Barrett Modular Multiplier for Crypto Systems
inferred← citeshttps://doi.org/10.1109/worlds450073.2020.9210334openalex-snapshot
An application of Miller Moreno groups to establishment protocol Non commutative cryptography
inferred← citeshttps://doi.org/10.1145/2659651.2659693openalex-snapshot
Symmetric Fully Homomorphic Encryption Using Decidable Matrix Equations
inferred← citeshttps://doi.org/10.1145/2876503openalex-snapshot
Modular SIMD arithmetic in M athemagix
inferred← citeshttps://doi.org/10.1145/3431920.3439306openalex-snapshot
Efficient FPGA Modular Multiplication Implementation
inferred← citeshttps://doi.org/10.1145/3597066.3597076openalex-snapshot
Efficient Generic Quotients Using Exact Arithmetic
inferred← citeshttps://doi.org/10.11591/ijins.v1i2.436openalex-snapshot
SD-AREE: An Advanced Modified Caesar Cipher Method to Exclude Repetition from a Message
inferred← citeshttps://doi.org/10.34229/kca2522-9664.26.2.5openalex-snapshot
METHOD AND ALGORITHM FOR INTERBASE CONVERSION OF BINARY RADEMAKER CODES INTO CRESTENSON REDUNDANCY CODES
inferred← citeshttps://doi.org/10.37394/23206.2020.19.39openalex-snapshot
An Application of Metacyclic and Miller Moreno P-groups to Establishment Protocol
inferred← citeshttps://doi.org/10.46300/9101.2020.14.2openalex-snapshot
Some Approach to Key Exchange Protocol Based on Non-commutative Groups
inferred← citeshttps://doi.org/10.48550/arxiv.2007.01648openalex-snapshot
Fast Arithmetic Hardware Library For RLWE-Based Homomorphic Encryption
inferred← citeshttps://doi.org/10.5121/acij.2012.3510openalex-snapshot
Justification of Montgomery Modular Reduction
inferred← citeshttps://doi.org/10.5815/ijitcs.2023.04.01openalex-snapshot
Software Implementation of Modular Reduction by Pseudo-mersenne Primes
inferred← citeshttps://doi.org/10.5815/ijmecs.2012.05.01openalex-snapshot
An Integrated Symmetric Key Cryptographic Method – Amalgamation of TTJSA Algorithm, Advanced Caesar Cipher Algorithm, Bit Rotation and Reversal method: SJA Algorithm
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.