On the public citation graph
A one way function based on ideal arithmetic in number fields
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/3-540-38424-3_9openalex-snapshot
On the Computation of Discrete Logarithms in Class Groups
inferredcites →https://doi.org/10.1007/3-540-39757-4_20openalex-snapshot
Discrete logarithms in finite fields and their cryptographic significance
inferredcites →https://doi.org/10.1007/3-540-47555-9_29openalex-snapshot
Tools for Proving Zero Knowledge
inferredcites →https://doi.org/10.1007/978-3-662-02945-9openalex-snapshot
A Course in Computational Algebraic Number Theory
inferredcites →https://doi.org/10.1007/bf02351719openalex-snapshot
A key-exchange system based on imaginary quadratic fields
inferredcites →https://doi.org/10.1016/0304-3975(87)90064-8openalex-snapshot
A hierarchy of polynomial time lattice basis reduction algorithms
inferredcites →https://doi.org/10.1017/cbo9781107325838.003openalex-snapshot
Quadratic fields and cryptography
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1287/moor.12.3.415openalex-snapshot
Minkowski's Convex Body Theorem and Integer Programming
inferredcites →https://doi.org/10.22028/d291-25831openalex-snapshot
LiDIA : a library for computational number theory
inferredcites →https://doi.org/10.6028/nbs.rpt.3052openalex-snapshot
Some computational problems in algebraic number theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_18openalex-snapshot
Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders
inferred← citeshttps://doi.org/10.1007/3-540-45067-x_42openalex-snapshot
Public-Key Cryptosystems Based on Class Semigroups of Imaginary Quadratic Non-maximal Orders
inferred← citeshttps://doi.org/10.1007/3-540-47719-5_9openalex-snapshot
First Implementation of Cryptographic Protocols Based on Algebraic Number Fields
inferred← citeshttps://doi.org/10.1007/978-1-4615-0895-3_18openalex-snapshot
Lattices and Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-322-84957-1_7openalex-snapshot
Elliptische Kurven in HBCI Ein Backup zu RSA
inferred← citeshttps://doi.org/10.1023/a:1014927327846openalex-snapshot
A Signature Scheme Based on the Intractability of Computing Roots
inferred← citeshttps://doi.org/10.1023/b:mahu.0000040535.45427.38openalex-snapshot
A one-way function based on norm form equations
inferred← citeshttps://doi.org/10.1090/s0025-5718-01-01341-2openalex-snapshot
Comparison of algorithms to calculate quadratic irregularity of prime numbers
inferred← citeshttps://doi.org/10.1090/s0025-5718-03-01593-xopenalex-snapshot
First-hit analysis of algorithms for computing quadratic irregularity
inferred← citeshttps://doi.org/10.2478/v10127-010-0028-3openalex-snapshot
On a family of preimage-resistant functions
inferred← citeshttps://doi.org/10.2478/v10127-012-0041-9openalex-snapshot
Notes on A Preimage-Resistant Hash Function
inferred← citeshttps://doi.org/10.2498/cit.1002639openalex-snapshot
Building Secure and Fast Cryptographic Hash Functions Using Programmable Cellular Automata
inferred← citeshttps://doi.org/10.3934/amc.2014.8.407openalex-snapshot
Subexponential time relations in the class group of large degree number fields
inferred← citeshttps://doi.org/10.4213/mvk3openalex-snapshot
Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом
inferred← citeshttps://doi.org/10.5815/ijcnis.2015.06.04openalex-snapshot
Fast and Efficient Design of a PCA-Based Hash Function
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.