DiSSECT: distinguisher of standard and simulated elliptic curves via traits
From MaRDI portal
Publication:6103100
Recommendations
Cites work
- scientific article; zbMATH DE number 1583933 (Why is no real title available?)
- scientific article; zbMATH DE number 1689862 (Why is no real title available?)
- scientific article; zbMATH DE number 3708485 (Why is no real title available?)
- scientific article; zbMATH DE number 1221897 (Why is no real title available?)
- scientific article; zbMATH DE number 1952905 (Why is no real title available?)
- scientific article; zbMATH DE number 1842492 (Why is no real title available?)
- A Refined Power-Analysis Attack on Elliptic Curve Cryptosystems
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Counting points on elliptic curves over finite fields
- Curve41417: Karatsuba revisited
- Dual EC: a standardized back door
- Efficient ephemeral elliptic curve cryptographic keys
- Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
- Extended tower number field sieve: a new complexity for the medium prime case
- On computing logarithms on elliptic curves
- On the security properties of Russian standardized elliptic curves
- Public Key Cryptography - PKC 2006
- Reducing elliptic curve logarithms to logarithms in a finite field
- Security Analysis of the Strong Diffie-Hellman Problem
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests
- The NSA back door to NIST
- The discrete logarithm problem on elliptic curves of trace one
This page was built for publication: DiSSECT: distinguisher of standard and simulated elliptic curves via traits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103100)