A key-exchange system based on imaginary quadratic fields
From MaRDI portal
Publication:1112782
DOI10.1007/BF02351719zbMath0659.94004OpenAlexW1990820504MaRDI QIDQ1112782
Hugh C. Williams, Johannes A. Buchmann
Publication date: 1988
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02351719
Related Items (24)
Orders in quadratic fields. II ⋮ A key-exchange protocol using real quadratic fields ⋮ Quantum lattice enumeration and tweaking discrete pruning ⋮ Algorithms for Black-Box Fields and their Application to Cryptography ⋮ A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point ⋮ Orders in quadratic fields. IV ⋮ Algebraic generalization of Diffie-Hellman key exchange ⋮ A proof of the conjectured run time of the Hafner-McCurley class group algorithm ⋮ Certifying giant nonprimes ⋮ Practical statistically-sound proofs of exponentiation in any group ⋮ I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ On time-lock cryptographic assumptions in abelian hidden-order groups ⋮ The reduced ideals of a special order in a pure cubic number field ⋮ Towards practical key exchange from ordinary isogeny graphs ⋮ A note on cyclic groups, finite fields, and the discrete logarithm problem ⋮ New designing of cryptosystems based on quadratic fields ⋮ Linearly Homomorphic Encryption from $$\mathsf {DDH}$$ ⋮ Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом ⋮ Efficient verifiable delay functions ⋮ On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis ⋮ Generic compiler for publicly verifiable covert multi-party computation ⋮ On the complexity of the discrete logarithm and Diffie-Hellman problems ⋮ Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
Cites Work
- On principal ideal testing in algebraic number fields
- Approximate formulas for some functions of prime numbers
- The Expectation of Success Using a Monte Carlo Factoring Method--Some Statistics on Quadratic Class Numbers
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Elliptic Curve Cryptosystems
- Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A key-exchange system based on imaginary quadratic fields
