On the public citation graph

RNS arithmetic in 𝔽 p k and application to fast pairing computation

0 signed Β· 38 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/11693383_22openalex-snapshot
Pairing-Friendly Elliptic Curves of Prime Order
inferredcites β†’https://doi.org/10.1007/3-540-44647-8_13openalex-snapshot
Identity-Based Encryption from the Weil Pairing
inferredcites β†’https://doi.org/10.1007/3-540-48329-2_16openalex-snapshot
Comparison of three modular reduction functions
inferredcites β†’https://doi.org/10.1007/978-3-540-24654-1_2openalex-snapshot
On the Selection of Pairing-Friendly Groups
inferredcites β†’https://doi.org/10.1007/978-3-540-24654-1_24openalex-snapshot
More Generalized Mersenne Numbers
inferredcites β†’https://doi.org/10.1007/978-3-642-13013-7_14openalex-snapshot
Faster Pairing Computations on Curves with High-Degree Twists
inferredcites β†’https://doi.org/10.1007/978-3-642-15031-9_4openalex-snapshot
A High Speed Coprocessor for Elliptic Curve Scalar Multiplications over $\mathbb{F}_p$
inferredcites β†’https://doi.org/10.1007/s00145-004-0311-zopenalex-snapshot
Efficient Implementation of Pairing-Based Cryptosystems
inferredcites β†’https://doi.org/10.1007/s00145-004-0312-yopenalex-snapshot
A One Round Protocol for Tripartite Diffie–Hellman
inferredcites β†’https://doi.org/10.1007/s00145-004-0314-9openalex-snapshot
Short Signatures from the Weil Pairing
inferredcites β†’https://doi.org/10.1007/s00145-004-0315-8openalex-snapshot
The Weil Pairing, and Its Efficient Calculation
inferredcites β†’https://doi.org/10.1007/s00145-009-9048-zopenalex-snapshot
A Taxonomy of Pairing-Friendly Elliptic Curves
inferredcites β†’https://doi.org/10.1007/s10623-004-3808-4openalex-snapshot
Elliptic Curves Suitable for Pairing Based Cryptography
inferredcites β†’https://doi.org/10.1007/s10623-005-0538-1openalex-snapshot
Generating More MNT Elliptic Curves
inferredcites β†’https://doi.org/10.1016/j.ffa.2007.02.003openalex-snapshot
Ordinary abelian varieties having small embedding degree
inferredcites β†’https://doi.org/10.1090/s0025-5718-09-02198-xopenalex-snapshot
The number field sieve for integers of low weight
inferredcites β†’https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites β†’https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites β†’https://doi.org/10.1109/12.709376openalex-snapshot
An RNS Montgomery modular multiplication algorithm
inferredcites β†’https://doi.org/10.1109/18.259647openalex-snapshot
Reducing elliptic curve logarithms to logarithms in a finite field
inferredcites β†’https://doi.org/10.1109/tc.2004.2openalex-snapshot
a full RNS implementation of RSA
inferredcites β†’https://doi.org/10.1109/tec.1959.5219515openalex-snapshot
The Residue Number System
inferredcites β†’https://doi.org/10.1109/tit.2006.881709openalex-snapshot
The Eta Pairing Revisited
inferredcites β†’https://doi.org/10.1109/tit.2009.2013048openalex-snapshot
Efficient and Generalized Pairing Computation on Abelian Varieties
inferredcites β†’https://doi.org/10.1109/tit.2009.2034881openalex-snapshot
Optimal Pairings
inferredcites β†’https://doi.org/10.1145/322261.322269openalex-snapshot
The Area-Time Complexity of Binary Multiplication
inferredcites β†’https://doi.org/10.2307/2153546openalex-snapshot
A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves

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/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-319-41385-3_10openalex-snapshot
RNS in Cryptography
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-40349-1_14openalex-snapshot
Improving Modular Inversion in RNS Using the Plus-Minus Method
inferred← citeshttps://doi.org/10.1109/edssc.2019.8753928openalex-snapshot
A High Speed Extension Field Multiplier for Pairing Acceleration
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/tc.2016.2529625openalex-snapshot
Binary-Ternary Plus-Minus Modular Inversion in RNS
inferred← citeshttps://doi.org/10.1109/tetc.2022.3187072openalex-snapshot
Generating Very Large RNS Bases
inferred← citeshttps://doi.org/10.1109/trustcom/bigdatase/icess.2017.344openalex-snapshot
Base Extent Optimization for RNS Montgomery Algorithm
inferred← citeshttps://doi.org/10.5802/pmb.a-152openalex-snapshot
Combining leak-resistant arithmetic for elliptic curves defined over 𝔽 p and RNS representation
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.