scientific article

Publication date: 1 November 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

finite field cryptography discrete logarithm problem elliptic curve cryptosystems supersingular elliptic curves Schoof's algorithm elliptic curve logarithm problem logarithm algorithms number of points on an elliptic curve over a finite field

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Curves over finite and local fields (11G20) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (52)

Faster Hashing to ${\mathbb G}_2$ ⋮ Group ring based public key cryptosystems ⋮ A fast addition algorithm for elliptic curve arithmetic in $\mathrm{GF}(2^{n})$ using projective coordinates ⋮ XTR Algorithm: Efficient and Compact Subgroup Trace Representation ⋮ On classical Kloosterman sums ⋮ Fast generation of prime numbers and secure public-key cryptographic parameters. ⋮ A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point ⋮ On the oracle complexity of factoring integers ⋮ Chevalley-Warning at the boundary ⋮ Scalar recoding and regular $2^w$-ary right-to-left EC scalar multiplication algorithm ⋮ On divisibility of exponential sums of polynomials of special type over fields of characteristic 2 ⋮ Isomorphism classes of Edwards curves over finite fields ⋮ Semi-systolic Modular Multiplier over GF(2m) ⋮ Monomial Boolean functions with large high-order nonlinearities ⋮ Interpolation of the Double Discrete Logarithm ⋮ An elliptic curve analogue of McCurley's key agreement scheme ⋮ The index calculus method using non-smooth polynomials ⋮ A random number generator based on elliptic curve operations ⋮ On Kloosterman sums over finite fields of characteristic 3 ⋮ Metrics on the sets of nonsupersingular elliptic curves in simplified Weierstrass form over finite fields of characteristic two ⋮ Orchards in elliptic curves over finite fields ⋮ A novel approach for bit-serial $AB^{2}$ multiplication in finite fields $\mathrm{GF}(2^m)$ ⋮ Improving e-payment security using elliptic curve cryptosystem ⋮ Elliptic curve cryptosystems in the presence of permanent and transient faults ⋮ Computing the order of points on an elliptic curve modulo $N$ is as difficult as factoring $N$ ⋮ Generating more MNT elliptic curves ⋮ Self-certified threshold proxy signature schemes with message recovery, nonrepudiation, and traceability ⋮ Protecting ECC against fault attacks: the ring extension method revisited ⋮ On the Connection between Kloosterman Sums and Elliptic Curves ⋮ An Analysis of the Vector Decomposition Problem ⋮ An Efficient Key Establishment Scheme for Self-organizing Sensor Networks ⋮ An identity-based strongly unforgeable signature without random oracles from bilinear pairings ⋮ The Diffie-Hellman problem and generalization of Verheul's theorem ⋮ New schemes for sharing points on an elliptic curve ⋮ Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm ⋮ Elliptic curve based hardware architecture using cellular automata ⋮ On the cyclicity of elliptic curves over finite field extensions ⋮ Fast Hashing to G 2 on Pairing-Friendly Curves ⋮ On the isomorphism classes of Legendre elliptic curves over finite fields ⋮ Construction of metrics on the set of elliptic curves over a finite field ⋮ On the complexity of the discrete logarithm and Diffie-Hellman problems ⋮ Cyclicity statistics for elliptic curves over finite fields ⋮ Subtraction-free almost Montgomery inverse algorithm ⋮ Partial known plaintext attack on Koyama scheme ⋮ Self-certified multi-proxy signature schemes with message recovery ⋮ Isomorphism classes of elliptic and hyperelliptic curves over finite fields $\mathbb F_{(2g+1)^n}$ ⋮ Recent developments in primality proving ⋮ Generic groups, collision resistance, and ECDSA ⋮ Efficient proxy signature schemes using self-certified public keys ⋮ Some computational problems of cryptographic significance concerning elliptic curves over rings ⋮ Computing the $p$-Selmer group of an elliptic curve ⋮ An iterative modular multiplication algorithm

This page was built for publication: