On the public citation graph

Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields

https://doi.org/10.1007/bfb0027920
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.
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/3-540-48329-2_13openalex-snapshot
A Subexponential Algorithm for Discrete Logarithms over All Finite Fields
inferredcites →https://doi.org/10.1007/3-540-61581-4_66openalex-snapshot
Discrete logarithms: The effectiveness of the index calculus method
inferredcites →https://doi.org/10.1007/978-1-4757-1089-2openalex-snapshot
Prime Numbers and Computer Methods for Factorization
inferredcites →https://doi.org/10.1007/bf00125200openalex-snapshot
Optimal normal bases
inferredcites →https://doi.org/10.1007/bf00196725openalex-snapshot
Efficient signature generation by smart cards
inferredcites →https://doi.org/10.1007/bf00196789openalex-snapshot
An implementation for a fast public-key cryptosystem
inferredcites →https://doi.org/10.1016/0166-218x(88)90090-xopenalex-snapshot
Optimal normal bases in GF(pn)
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50017-5openalex-snapshot
Algorithms in Number Theory
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1109/tit.1985.1057074openalex-snapshot
A public key cryptosystem and a signature scheme based on discrete logarithms
inferredcites →https://doi.org/10.1137/1012065openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms (Donald E. Knuth)
inferredcites →https://doi.org/10.2307/2317055openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical 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/11535218_5openalex-snapshot
On the Discrete Logarithm Problem on Algebraic Tori
inferred← citeshttps://doi.org/10.1007/11958239_15openalex-snapshot
Discrete Logarithm Variants of VSH
inferred← citeshttps://doi.org/10.1007/3-540-36178-2_3openalex-snapshot
Looking beyond XTR
inferred← citeshttps://doi.org/10.1007/3-540-36400-5_24openalex-snapshot
Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions
inferred← citeshttps://doi.org/10.1007/3-540-36492-7_24openalex-snapshot
Optimal Extension Fields for XTR
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_17openalex-snapshot
Key Improvements to XTR
inferred← citeshttps://doi.org/10.1007/3-540-44598-6_1openalex-snapshot
The XTR Public Key System
inferred← citeshttps://doi.org/10.1007/3-540-45311-3_29openalex-snapshot
Comments on a Signature Scheme Based on the Third Order LFSR Proposed at ACISP2001
inferred← citeshttps://doi.org/10.1007/3-540-45537-x_23openalex-snapshot
XTR Extended to GF(p 6m)
inferred← citeshttps://doi.org/10.1007/978-3-319-04873-4_13openalex-snapshot
Algorithms for Pairing-Friendly Primes
inferred← citeshttps://doi.org/10.1007/978-3-540-24654-1_23openalex-snapshot
Generic Efficient Arithmetic Algorithms for PAFFs (Processor Adequate Finite Fields) and Related Algebraic Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-24847-7_17openalex-snapshot
A Comparison of CEILIDH and XTR
inferred← citeshttps://doi.org/10.1007/978-3-540-24847-7_2openalex-snapshot
Using Primitive Subgroups to Do More with Fewer Bits
inferred← citeshttps://doi.org/10.1007/978-3-540-27800-9_39openalex-snapshot
On Security of XTR Public Key Cryptosystems Against Side Channel Attacks
inferred← citeshttps://doi.org/10.1007/978-3-540-28628-8_10openalex-snapshot
Asymptotically Optimal Communication for Torus-Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-540-28632-5_28openalex-snapshot
XTR Implementation on Reconfigurable Hardware
inferred← citeshttps://doi.org/10.1007/978-3-540-30564-4_4openalex-snapshot
On XTR and Side-Channel Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-46588-1_18openalex-snapshot
Certificates of Recoverability with Scalable Recovery Agent Security
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_26openalex-snapshot
Doing More with Fewer Bits
inferred← citeshttps://doi.org/10.1007/978-3-540-72738-5_27openalex-snapshot
Compressed XTR
inferred← citeshttps://doi.org/10.1007/978-3-642-10433-6_3openalex-snapshot
On Cryptographic Schemes Based on Discrete Logarithms and Factoring
inferred← citeshttps://doi.org/10.1007/978-3-642-16825-3_17openalex-snapshot
Preimage Attacks against Variants of Very Smooth Hash
inferred← citeshttps://doi.org/10.1007/978-981-97-4876-1_14openalex-snapshot
Structure of Cyclotomic Polynomials and Several Applications
inferred← citeshttps://doi.org/10.1007/bfb0030430openalex-snapshot
Signcryption and its applications in efficient public key solutions
inferred← citeshttps://doi.org/10.1090/s0025-5718-2013-02704-4openalex-snapshot
Generalised Mersenne numbers revisited
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.10.2843openalex-snapshot
A More Compact Representation of XTR Cryptosystem
inferred← citeshttps://doi.org/10.1109/csse.2008.355openalex-snapshot
Application of XTR Public Key System in Certificate Authority System
inferred← citeshttps://doi.org/10.1112/s1461157000001194openalex-snapshot
On Small Characteristic Algebraic Tori in Pairing-Based Cryptography
inferred← citeshttps://doi.org/10.1137/060676155openalex-snapshot
Compression in Finite Fields and Torus-Based Cryptography
inferred← citeshttps://doi.org/10.1142/9789812388841_0005openalex-snapshot
COMPUTATIONAL METHODS IN PUBLIC KEY CRYPTOLOGY
inferred← citeshttps://doi.org/10.1515/9783110881035.151openalex-snapshot
An overview of the XTR public key system
inferred← citeshttps://doi.org/10.1515/jmc-2017-0015openalex-snapshot
Algebraic generalization of Diffie–Hellman key exchange
inferred← citeshttps://doi.org/10.37055/sbn/135214openalex-snapshot
NEW CHALLENGES FOR POLISH CRYPTOLOGY IN SECOND DECADE OF XXI CENTURY
inferred← citeshttps://doi.org/10.3934/amc.2013.7.187openalex-snapshot
Discrete logarithm like problems and linear recurring sequences
inferred← citeshttps://doi.org/10.6100/ir564670openalex-snapshot
Speeding up subgroup cryptosystems
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.