scientific article; zbMATH DE number 1024052
From MaRDI portal
Publication:4341740
zbMath0871.11094MaRDI QIDQ4341740
Leonard M. Adleman, Jonathan DeMarrais
Publication date: 20 July 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16)
Related Items (10)
Effective compression maps for torus-based cryptography ⋮ (EC)DSA lattice attacks based on Coppersmith's method ⋮ The generalized Weil pairing and the discrete logarithm problem on elliptic curves ⋮ Using symmetries in the index calculus for elliptic curves discrete logarithm ⋮ Computing Generator in Cyclotomic Integer Rings ⋮ Speeding up exponentiation using an untrusted computational resource ⋮ The Function Field Sieve in the Medium Prime Case ⋮ Subexponential time relations in the class group of large degree number fields ⋮ A probabilistic analysis on a lattice attack against DSA ⋮ A research on new public-key encryption schemes
This page was built for publication:
