On the public citation graph
A public-key cryptosystem utilizing cyclotomic fields
0 signed · 41 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-39799-xopenalex-snapshot
Advances in Cryptology — CRYPTO ’85 Proceedings
inferredcites →https://doi.org/10.1007/3-540-39799-x_26openalex-snapshot
An M3 Public-Key Encryption Scheme
inferredcites →https://doi.org/10.1007/978-3-642-52795-1openalex-snapshot
Vorlesungen über Zahlentheorie
inferredcites →https://doi.org/10.1007/bf00193566openalex-snapshot
A cubic RSA code equivalent to factorization
inferredcites →https://doi.org/10.1007/bf01450916openalex-snapshot
Note sur les nombres entiers d�pendant d'une racine cinqui�me de l'unit�
inferredcites →https://doi.org/10.1016/0022-314x(87)90092-8openalex-snapshot
On the computation of units and class numbers by a generalization of Lagrange's algorithm
inferredcites →https://doi.org/10.1016/s0747-7171(87)80049-4openalex-snapshot
On principal ideal testing in algebraic number fields
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866098-3openalex-snapshot
On Principal Ideal Testing in Totally Complex Quartic Fields and the Determination of Certain Cyclotomic Constants
inferredcites →https://doi.org/10.1090/s0025-5718-1990-1023756-8openalex-snapshot
Explicit Bounds for Primality Testing and Related Problems
inferredcites →https://doi.org/10.1109/tit.1980.1056264openalex-snapshot
A modification of the RSA public-key encryption procedure (Corresp.)
inferredcites →https://doi.org/10.1112/jlms/s2-10.4.457openalex-snapshot
Euclid's Algorithm in Cyclotomic Fields
inferredcites →https://doi.org/10.1515/crll.1976.286-287.248openalex-snapshot
Cyclotomic fields with unique factorization.
inferredcites →https://doi.org/10.1515/crll.1976.288.207openalex-snapshot
Explicit forms of Kummer's complementary theorems to his law of quintic reciprocity.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1520-6440(200008)83:8<19::aid-ecjc3>3.0.co;2-0openalex-snapshot
Construction of RSA cryptosystem over the algebraic field using ideal theory and investigation of its security
inferred← citeshttps://doi.org/10.1006/jsco.1998.0226openalex-snapshot
Efficient Algorithms for Computing the Jacobi Symbol
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_1openalex-snapshot
Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001
inferred← citeshttps://doi.org/10.1007/3-540-48970-3_12openalex-snapshot
On the Security of an RSA Based Encryption Scheme
inferred← citeshttps://doi.org/10.1007/3-540-61581-4_58openalex-snapshot
Efficient algorithms for computing the Jacobi symbol
inferred← citeshttps://doi.org/10.1007/978-3-031-91820-9_3openalex-snapshot
Higher Residuosity Attacks on Small RSA Subgroup Decision Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24632-9_6openalex-snapshot
Undeniable Signatures Based on Characters: How to Sign with One Bit
inferred← citeshttps://doi.org/10.1007/978-3-540-24847-7_4openalex-snapshot
Binary GCD Like Algorithms for Some Complex Quadratic Rings
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_11openalex-snapshot
Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers
inferred← citeshttps://doi.org/10.1007/978-3-642-38348-9_5openalex-snapshot
Efficient Cryptosystems from 2 k -th Power Residue Symbols
inferred← citeshttps://doi.org/10.1007/bfb0053717openalex-snapshot
The security of public key cryptosystems based on integer factorization
inferred← citeshttps://doi.org/10.1007/s00145-016-9229-5openalex-snapshot
Efficient Cryptosystems From $$\mathbf{2}^{{\varvec{k}}}$$ 2 k -th Power Residue Symbols
inferred← citeshttps://doi.org/10.1007/s001459900038openalex-snapshot
A Public-Key Cryptosystem Using Purely Cubic Fields
inferred← citeshttps://doi.org/10.1007/s10623-020-00816-wopenalex-snapshot
Extended Galbraith’s test on the anonymity of IBE schemes from higher residuosity
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.02.006openalex-snapshot
Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers
inferred← citeshttps://doi.org/10.1080/00150517.2006.12428314openalex-snapshot
Some remarks on Williams’ public-key crypto functions
inferred← citeshttps://doi.org/10.1142/s1793042110003770openalex-snapshot
AN EFFICIENT SEVENTH POWER RESIDUE SYMBOL ALGORITHM
inferred← citeshttps://doi.org/10.1515/jmc-2019-0035openalex-snapshot
New number-theoretic cryptographic primitives
inferred← citeshttps://doi.org/10.1515/jmc-2020-0077openalex-snapshot
The Eleventh Power Residue Symbol
inferred← citeshttps://doi.org/10.2140/obs.2020.4.371openalex-snapshot
An algorithm and estimates for the Erdős–Selfridge function
inferred← citeshttps://doi.org/10.48550/arxiv.math/0309387openalex-snapshot
Bit retrieval: intractability and application to digital watermarking
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3691openalex-snapshot
Short undeniable signatures : design, analysis, and applications
inferred← citeshttps://doi.org/10.7146/brics.v10i8.21779openalex-snapshot
Efficient Algorithms for gcd and Cubic Residuosity in the Ring of Eisenstein Integers
inferred← citeshttps://doi.org/10.7146/brics.v10i9.21780openalex-snapshot
An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates
inferred← citeshttps://doi.org/10.82308/49952openalex-snapshot
Survey of computational assumptions used in cryptography broken or not by Shor's 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.