One-way permutations on elliptic curves

DOI10.1007/BF00196911zbMath0724.94012OpenAlexW2072307680MaRDI QIDQ2277234

Burton S. jun. Kaliski

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1007/bf00196911

zbMATH Keywords

cryptographyone-way functionsElliptic curvesdiscrete logarithms

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves ⋮ On the cyclicity of the rational points group of abelian varieties over finite fields ⋮ Batching base oblivious transfers ⋮ Isomorphic transformations of an elliptic curve over a finite field ⋮ Generation of solved instances of Multiconstraint Knapsack problem and its applications to Private Key Cipher ⋮ A Public-Key Encryption Scheme with Pseudo-random Ciphertexts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring integers with elliptic curves
• Discrete logarithms in \(\mathrm{GF}(p)\)
• Sequences of numbers generated by addition in formal groups and new primality and factorization tests
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Elliptic Curve Cryptosystems
• How to Generate Factored Random Numbers
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)

This page was built for publication: One-way permutations on elliptic curves