On the public citation graph
Finite Field Polynomial Multiplication in the Frequency Domain with Application to Elliptic Curve Cryptography
0 signed · 30 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/978-1-4613-1983-2openalex-snapshot
Finite Fields for Computer Scientists and Engineers
inferredcites →https://doi.org/10.1007/978-1-4757-2226-0openalex-snapshot
Applications of Finite Fields
inferredcites →https://doi.org/10.1007/bf02242355openalex-snapshot
Schnelle Multiplikation großer Zahlen
inferredcites →https://doi.org/10.1017/cbo9781107360211openalex-snapshot
Elliptic Curves in Cryptography
inferredcites →https://doi.org/10.1023/a:1008208521515openalex-snapshot
Montgomery Multiplication in GF(2k)
inferredcites →https://doi.org/10.1090/s0025-5718-1965-0178586-1openalex-snapshot
An Algorithm for the Machine Calculation of Complex Fourier Series
inferredcites →https://doi.org/10.1090/s0025-5718-1971-0301966-0openalex-snapshot
The Fast Fourier Transform in a Finite Field
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
inferredcites →https://doi.org/10.1109/arith.2003.1207677openalex-snapshot
Efficient multiplication in GF(p/sup k/) for elliptic curve cryptography
inferredcites →https://doi.org/10.1109/t-c.1972.223497openalex-snapshot
Discrete Convolutions via Mersenne Transforms
inferredcites →https://doi.org/10.1109/tassp.1986.1164800openalex-snapshot
Fast algorithms for digital signal processing
inferredcites →https://doi.org/10.1145/357980.358017openalex-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/sec.1670openalex-snapshot
Elliptic‐curve cryptography for wireless sensor network nodes without hardware multiplier support
inferred← citeshttps://doi.org/10.1007/978-0-387-71817-0_7openalex-snapshot
Spectral Modular Arithmetic for Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-09153-2_37openalex-snapshot
Elliptic Curve Cryptography on Constrained Microcontrollers Using Frequency Domain Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-319-21356-9_7openalex-snapshot
An Elliptic Curve Cryptographic Processor Using Edwards Curves and the Number Theoretic Transform
inferred← citeshttps://doi.org/10.1007/978-3-540-69499-1_5openalex-snapshot
Optimal Extension Field Inversion in the Frequency Domain
inferred← citeshttps://doi.org/10.1007/s00200-011-0158-0openalex-snapshot
Finite field trigonometric transforms
inferred← citeshttps://doi.org/10.1007/s10586-022-03611-5openalex-snapshot
An ECC processor for IoT using Edwards curves and DFT modular multiplication
inferred← citeshttps://doi.org/10.1007/s10958-013-1350-5openalex-snapshot
Complexity of computation in finite fields
inferred← citeshttps://doi.org/10.1007/s11036-007-0022-4openalex-snapshot
A State-of-the-art Elliptic Curve Cryptographic Processor Operating in the Frequency Domain
inferred← citeshttps://doi.org/10.1109/access.2024.3495995openalex-snapshot
Efficient ECC Processor Designs for IoT Using Edwards Curves and Exploiting FPGA Embedded Components
inferred← citeshttps://doi.org/10.1109/asap.2009.31openalex-snapshot
A High-Performance Hardware Architecture for Spectral Hash Algorithm
inferred← citeshttps://doi.org/10.1109/icics52457.2021.9464611openalex-snapshot
FPGA Implementation of an ECC Processor Using Edwards Curves and DFT Modular Multiplication
inferred← citeshttps://doi.org/10.48084/etasr.17754openalex-snapshot
A Lightweight Enhanced Montgomery Elliptic Curve Cryptography Scheme for Secure Communication in Wireless Sensor Networks
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.