Computing discrete logarithms in quadratic orders

DOI10.1007/s001450010013zbMath0979.11059OpenAlexW1972197455MaRDI QIDQ1590363

Michael J. Jacobson jun.

Publication date: 19 February 2002

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.8366

zbMATH Keywords

class groupquadratic orderdiscrete logarithmcomputational number theoryprincipal ideal testing

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Related Items (5)

A New Look at an Old Equation ⋮ I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups ⋮ Practical fully secure unrestricted inner product functional encryption modulo \(p\) ⋮ Linearly Homomorphic Encryption from $$\mathsf {DDH}$$ ⋮ Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields

This page was built for publication: Computing discrete logarithms in quadratic orders