On the public citation graph
A key-exchange system based on imaginary quadratic fields
0 signed · 148 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-39757-4_20openalex-snapshot
Discrete logarithms in finite fields and their cryptographic significance
inferredcites →https://doi.org/10.1007/3-540-39799-x_31openalex-snapshot
Use of Elliptic Curves in Cryptography
inferredcites →https://doi.org/10.1007/978-3-642-68130-1openalex-snapshot
Introduction to Number Theory
inferredcites →https://doi.org/10.1007/bfb0099440openalex-snapshot
Heuristics on class groups of number fields
inferredcites →https://doi.org/10.1016/0196-6774(80)90021-8openalex-snapshot
Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
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.1017/cbo9780511662027.007openalex-snapshot
On the calculation of regulators and class numbers of quadratic fields
inferredcites →https://doi.org/10.1090/pspum/020/0316385openalex-snapshot
Class number, a theory of factorization, and genera
inferredcites →https://doi.org/10.1090/s0025-5718-1984-0744940-1openalex-snapshot
The Expectation of Success Using a Monte Carlo Factoring Method--Some Statistics on Quadratic Class Numbers
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1109/tit.1978.1055817openalex-snapshot
An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
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.1112/plms/s2-27.1.358openalex-snapshot
On the Class-Number of the Corpus P (√−k )
inferredcites →https://doi.org/10.1215/ijm/1255631807openalex-snapshot
Approximate formulas for some functions of prime numbers
inferredcites →https://doi.org/10.1515/crll.1928.159.210openalex-snapshot
Über die Klassenzahl des imaginären quadratischen Zahlkörpers.
inferredcites →https://doi.org/10.2307/3619551openalex-snapshot
Elementary and Analytic Theory of Algebraic Numbers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-387-34799-2_7openalex-snapshot
Intractable Problems in Number Theory
inferred← citeshttps://doi.org/10.1007/0-387-34805-0_31openalex-snapshot
A key exchange system based on real quadratic fields Extended abstract
inferred← citeshttps://doi.org/10.1007/10722028_39openalex-snapshot
Asymptotically Fast Discrete Logarithms in Quadratic Number Fields
inferred← citeshttps://doi.org/10.1007/11424826_26openalex-snapshot
New Key Management Systems for Multilevel Security
inferred← citeshttps://doi.org/10.1007/11766155_34openalex-snapshot
Quantum Algorithm for Solving the Discrete Logarithm Problem in the Class Group of an Imaginary Quadratic Field and Security Comparison of Current Cryptosystems at the Beginning of Quantum Computer Age
inferred← citeshttps://doi.org/10.1007/11774716_8openalex-snapshot
On the Security of Multilevel Cryptosystems over Class Semigroups of Imaginary Quadratic Non-maximal Orders
inferred← citeshttps://doi.org/10.1007/3-540-38424-3_9openalex-snapshot
On the Computation of Discrete Logarithms in Class Groups
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-44750-4_34openalex-snapshot
Quantum Cryptanalysis of Hidden Linear Functions
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-45450-0_1openalex-snapshot
A New Distributed Primality Test for Shared RSA Keys Using Quadratic Fields
inferred← citeshttps://doi.org/10.1007/3-540-45455-1_10openalex-snapshot
Computational Aspects of NUCOMP
inferred← citeshttps://doi.org/10.1007/3-540-45861-1_6openalex-snapshot
An IND-CCA2 Public-Key Cryptosystem with Fast Decryption
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_17openalex-snapshot
Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups
inferred← citeshttps://doi.org/10.1007/3-540-46513-8_11openalex-snapshot
Efficient Implementation of Cryptosystems Based on Non-maximal Imaginary Quadratic Orders
inferred← citeshttps://doi.org/10.1007/3-540-46885-4_57openalex-snapshot
On the Complexity and Efficiency of a New Key Exchange System
inferred← citeshttps://doi.org/10.1007/3-540-47719-5_8openalex-snapshot
New Public-Key Cryptosystem Using Divisor Class Groups
inferred← citeshttps://doi.org/10.1007/3-540-48059-5_28openalex-snapshot
NICE - New Ideal Coset Encryption -
inferred← citeshttps://doi.org/10.1007/3-540-48658-5_26openalex-snapshot
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_45openalex-snapshot
Number theoretic algorithms and cryptology
inferred← citeshttps://doi.org/10.1007/3-540-68697-5_22openalex-snapshot
Algorithms for Black-Box Fields and their Application to Cryptography
inferred← citeshttps://doi.org/10.1007/978-1-4613-0283-4_8openalex-snapshot
A General Framework for Subexponential Discrete Logarithm Algorithms in Groups of Unknown Order
inferred← citeshttps://doi.org/10.1007/978-1-4615-0895-3_18openalex-snapshot
Lattices and Cryptography
inferred← citeshttps://doi.org/10.1007/978-1-4757-2226-0_6openalex-snapshot
The Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-6856-5_1openalex-snapshot
Information Security, Mathematics, and Public-Key Cryptography
inferred← citeshttps://doi.org/10.1007/978-1-4757-6856-5_4openalex-snapshot
The Diffie-Hellman Protocol
inferred← citeshttps://doi.org/10.1007/978-1-4757-6856-5_5openalex-snapshot
The State of Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-03332-3_14openalex-snapshot
Towards Practical Key Exchange from Ordinary Isogeny Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-17659-4_13openalex-snapshot
Efficient Verifiable Delay Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-26948-7_19openalex-snapshot
Subvector Commitments with Application to Succinct Arguments
inferred← citeshttps://doi.org/10.1007/978-3-030-26948-7_22openalex-snapshot
Homomorphic Time-Lock Puzzles and Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-34621-8_11openalex-snapshot
Hard Isogeny Problems over RSA Moduli and Groups with Infeasible Inversion
inferred← citeshttps://doi.org/10.1007/978-3-030-56877-1_17openalex-snapshot
Generically Speeding-Up Repeated Squaring Is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-57990-6_4openalex-snapshot
Tight Verifiable Delay Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-58208-1_8openalex-snapshot
On Collisions Related to an Ideal Class of Order 3 in CSIDH
inferred← citeshttps://doi.org/10.1007/978-3-030-77886-6_27openalex-snapshot
Generic Compiler for Publicly Verifiable Covert Multi-Party Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-92075-3_13openalex-snapshot
On Time-Lock Cryptographic Assumptions in Abelian Hidden-Order Groups
inferred← citeshttps://doi.org/10.1007/978-3-031-15979-4_13openalex-snapshot
Practical Statistically-Sound Proofs of Exponentiation in Any Group
inferred← citeshttps://doi.org/10.1007/978-3-031-22966-4_4openalex-snapshot
Threshold Linearly Homomorphic Encryption on $\\mathbf{Z}/2^k\\mathbf{Z}$
inferred← citeshttps://doi.org/10.1007/978-3-031-31368-4_19openalex-snapshot
Certifying Giant Nonprimes
inferred← citeshttps://doi.org/10.1007/978-3-031-48624-1_13openalex-snapshot
(Verifiable) Delay Functions from Lucas Sequences
inferred← citeshttps://doi.org/10.1007/978-3-031-51479-1_18openalex-snapshot
Efficient Transparent Polynomial Commitments for zk-SNARKs
inferred← citeshttps://doi.org/10.1007/978-3-031-88661-4_13openalex-snapshot
How (Not) to Hash into Class Groups of Imaginary Quadratic Fields?
inferred← citeshttps://doi.org/10.1007/978-3-032-01887-8_18openalex-snapshot
DewTwo: A Transparent PCS with Quasi-Linear Prover, Logarithmic Verifier and 4.5KB Proofs from Falsifiable Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-032-35424-2_16openalex-snapshot
Morphic Accumulators and Applications
inferred← citeshttps://doi.org/10.1007/978-3-0348-7023-8_13openalex-snapshot
A Survey of Number Theory and Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-16715-2_26openalex-snapshot
Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
inferred← citeshttps://doi.org/10.1007/978-3-319-30301-7_39openalex-snapshot
The Password Authenticated Connection Establishment Protocol (PACE) Based on Imaginary Quadratic Fields
inferred← citeshttps://doi.org/10.1007/978-3-319-96884-1_25openalex-snapshot
Verifiable Delay Functions
inferred← citeshttps://doi.org/10.1007/978-3-322-84957-1_30openalex-snapshot
A Survey of Cryptosystems Based on Imaginary Quadratic Orders
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.1007/978-3-322-84957-1_8openalex-snapshot
NICE — Ein neues Kryptosystem mit schneller Entschlüsselung
inferred← citeshttps://doi.org/10.1007/978-3-540-27800-9_13openalex-snapshot
The Security of Cryptosystems Based on Class Semigroups of Imaginary Quadratic Non-maximal Orders
inferred← citeshttps://doi.org/10.1007/978-3-540-30580-4_11openalex-snapshot
Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_18openalex-snapshot
Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-540-68164-9_13openalex-snapshot
An Adaptation of the NICE Cryptosystem to Real Quadratic Orders
inferred← citeshttps://doi.org/10.1007/978-3-642-01001-9_15openalex-snapshot
On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7openalex-snapshot
Advances in cryptology - ASIACRYPT 2009 : 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6-10, 2009 : proceedings
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_28openalex-snapshot
Factoring pq 2 with Quadratic Forms: Nice Cryptanalyses
inferred← citeshttps://doi.org/10.1007/978-3-642-14081-5_15openalex-snapshot
Security Estimates for Quadratic Field Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-642-31284-7_14openalex-snapshot
Secure Accumulators from Euclidean Rings without Trusted Setup
inferred← citeshttps://doi.org/10.1007/978-3-642-33481-8_12openalex-snapshot
Improved Exponentiation and Key Agreement in the Infrastructure of a Real Quadratic Field
inferred← citeshttps://doi.org/10.1007/978-3-642-42001-6_16openalex-snapshot
A Constructive Perspective on Key Encapsulation
inferred← citeshttps://doi.org/10.1007/978-3-642-78502-3_27openalex-snapshot
Number Theory and Cryptography
inferred← citeshttps://doi.org/10.1007/978-93-86279-02-6_13openalex-snapshot
A Survey of Number Theory and Cryptography
inferred← citeshttps://doi.org/10.1007/bf01189025openalex-snapshot
A note on cyclic groups, finite fields, and the discrete logarithm problem
inferred← citeshttps://doi.org/10.1007/bf02318548openalex-snapshot
A key-exchange protocol using real quadratic fields
inferred← citeshttps://doi.org/10.1007/bfb0027937openalex-snapshot
Identity-based and self-certified key-exchange protocols
inferred← citeshttps://doi.org/10.1007/bfb0052250openalex-snapshot
A one way function based on ideal arithmetic in number fields
inferred← citeshttps://doi.org/10.1007/bfb0054134openalex-snapshot
A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption
inferred← citeshttps://doi.org/10.1007/s00145-020-09364-xopenalex-snapshot
Efficient Verifiable Delay Functions
inferred← citeshttps://doi.org/10.1007/s00145-023-09459-1openalex-snapshot
I Want to Ride My BICYCL : BICYCL Implements CryptographY in CLass Groups
inferred← citeshttps://doi.org/10.1007/s001450010013openalex-snapshot
Computing Discrete Logarithms in Quadratic Orders
inferred← citeshttps://doi.org/10.1007/s001459910010openalex-snapshot
A New Public-Key Cryptosystem over a Quadratic Order with Quadratic Decryption Time
inferred← citeshttps://doi.org/10.1007/s002000100092openalex-snapshot
Isomorphism Classes of Genus-2 Hyperelliptic Curves Over Finite Fields
inferred← citeshttps://doi.org/10.1007/s10440-006-9045-2openalex-snapshot
A Review on the Isomorphism Classes of Hyperelliptic Curves of Genus 2 over Finite Fields Admitting a Weierstrass Point
inferred← citeshttps://doi.org/10.1007/s11432-008-0091-4openalex-snapshot
New designing of cryptosystems based on quadratic fields
inferred← citeshttps://doi.org/10.1007/s11831-021-09561-2openalex-snapshot
State-of-the-Art Survey of Quantum Cryptography
inferred← citeshttps://doi.org/10.1016/b978-0-323-95703-8.00259-7openalex-snapshot
Quantum Computation
inferred← citeshttps://doi.org/10.1016/j.jco.2004.01.002openalex-snapshot
On the complexity of the discrete logarithm and Diffie–Hellman problems
inferred← citeshttps://doi.org/10.1016/s1570-7954(96)80013-1openalex-snapshot
Finite Fields and Their Applications
inferred← citeshttps://doi.org/10.1023/a:1008345904539openalex-snapshot
Information Security, Mathematics, and Public-Key Cryptography
inferred← citeshttps://doi.org/10.1023/a:1008346322837openalex-snapshot
Cryptography in Quadratic Function Fields
inferred← citeshttps://doi.org/10.1023/a:1008354106356openalex-snapshot
The State of Elliptic Curve Cryptography
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:desi.0000012439.20075.16openalex-snapshot
Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders
inferred← citeshttps://doi.org/10.1080/23742917.2016.1226650openalex-snapshot
Will quantum computers be the end of public key encryption?
inferred← citeshttps://doi.org/10.1109/eurosp60621.2024.00020openalex-snapshot
SoK: Public Randomness
inferred← citeshttps://doi.org/10.1109/fpga.2003.1227237openalex-snapshot
Congruential sieves on reconfigurable computer
inferred← citeshttps://doi.org/10.1109/icacci.2017.8126015openalex-snapshot
An efficient digital signature scheme by using integer factorization and discrete logarithm problem
inferred← citeshttps://doi.org/10.1109/icmcs.2014.6911343openalex-snapshot
A key exchange system based on some bicyclic biquadratic number fields
inferred← citeshttps://doi.org/10.1109/tc.2022.3219723openalex-snapshot
Low-latency Hardware Architecture for VDF Evaluation in Class Groups
inferred← citeshttps://doi.org/10.1109/tii.2024.3367364openalex-snapshot
Stateless Blockchain-Based Lightweight Identity Management Architecture for Industrial IoT Applications
inferred← citeshttps://doi.org/10.1109/tnse.2023.3245326openalex-snapshot
An Incentive-Compatible Mechanism for Decentralized Storage Network
inferred← citeshttps://doi.org/10.1137/s0036144503439190openalex-snapshot
A Survey of Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.1137/s0097539796302749openalex-snapshot
The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
inferred← citeshttps://doi.org/10.1145/3460120.3484773openalex-snapshot
Efficient CCA Timed Commitments in Class Groups
inferred← citeshttps://doi.org/10.1145/3717823.3718286openalex-snapshot
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials V: Over Commutative Rings
inferred← citeshttps://doi.org/10.1146/annurev.cs.04.060190.001003openalex-snapshot
Number-Theoretic Algorithms
inferred← citeshttps://doi.org/10.13067/jkiecs.2012.7.3.545openalex-snapshot
Computational Complexity in Imaginary Quadratic Order
inferred← citeshttps://doi.org/10.14722/ndss.2021.24116openalex-snapshot
RandRunner: Distributed Randomness from Trapdoor VDFs with Strong Uniqueness
inferred← citeshttps://doi.org/10.14722/ndss.2022.24234openalex-snapshot
HeadStart: Efficiently Verifiable and Low-Latency Participatory Randomness Generation at Scale
inferred← citeshttps://doi.org/10.1515/9783110881035.89openalex-snapshot
The efficiency and security of a real quadratic field based key exchange protocol
inferred← citeshttps://doi.org/10.19026/rjaset.8.950openalex-snapshot
Buchmann-Williams Authenticated Key Agreement Protocol With Pre-shared Password
inferred← citeshttps://doi.org/10.26083/tuprints-00000494openalex-snapshot
Rigorously Analyzed Algorithms for the Discrete Logarithm Problem in Quadratic Number Fields
inferred← citeshttps://doi.org/10.33044/revuma.3862openalex-snapshot
Principality by reduced ideals in pure cubic number fields
inferred← citeshttps://doi.org/10.3390/electronics11010131openalex-snapshot
An Approach to the Construction of a Recursive Argument of Polynomial Evaluation in the Discrete Log Setting
inferred← citeshttps://doi.org/10.3934/amc.2021055openalex-snapshot
A proof of the conjectured run time of the Hafner-McCurley class group algorithm
inferred← citeshttps://doi.org/10.4018/978-1-7998-2253-0.ch001openalex-snapshot
Post-Quantum Cryptography and Quantum Cloning
inferred← citeshttps://doi.org/10.4018/978-1-7998-8593-1.ch011openalex-snapshot
Post-Quantum Cryptography and Quantum Cloning
inferred← citeshttps://doi.org/10.4134/ckms.2006.21.3.577openalex-snapshot
ON THE PUBLIC KEY CRYPTOSYSTEMS OVER CLASS SEMIGROUPS OF IMAGINARY QUADRATIC NON-MAXIMAL ORDERS
inferred← citeshttps://doi.org/10.4213/mvk3openalex-snapshot
Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом
inferred← citeshttps://doi.org/10.48550/arxiv.1811.06246openalex-snapshot
McEliece Cryptosystem Based On Extended Golay Code
inferred← citeshttps://doi.org/10.48550/arxiv.1908.02327openalex-snapshot
Proof of All: Verifiable Computation in a Nutshell
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0404061openalex-snapshot
Classical Cryptosystems In A Quantum Setting
inferred← citeshttps://doi.org/10.52846/ami.v48i1.1331openalex-snapshot
On the key-exchange protocol using real quadratic fields
inferred← citeshttps://doi.org/10.5817/am2020-3-171openalex-snapshot
The reduced ideals of a special order in a pure cubic number field
inferred← citeshttps://doi.org/10.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography
inferred← citeshttps://doi.org/10.62056/a66chevtwopenalex-snapshot
Efficient DDH Distinguishers in Class Groups of Orders in $ℚ(√(-3))$
inferred← citeshttps://doi.org/10.70675/2f58bf7bzbfcdz49d7z9d3fz33ae2b820fcaopenalex-snapshot
Class group computations in number fields and applications to cryptology
inferred← citeshttps://doi.org/10.70675/90507331z61c5z4378zb146z0dca82ef4571openalex-snapshot
Functional encryption and distributed signatures based on projective hash functions, the benefit of class groups
inferred← citeshttps://doi.org/10.70675/c51a18fbz5b6fz4912zb5a1z470c35920675openalex-snapshot
Quantum key distribution and quantum error correction with bosonic systems
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.