Publication:5386130

zbMath1200.11043MaRDI QIDQ5386130

Lawrence C. Washington

Publication date: 18 April 2008

zbMATH Keywords

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

11G05: Elliptic curves over global fields

11G20: Curves over finite and local fields

14G10: Zeta functions and related questions in algebraic geometry (e.g., Birch-Swinnerton-Dyer conjecture)

11G50: Heights

14G50: Applications to coding theory and cryptography of arithmetic geometry

11-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory

Related Items

Division by $2$ of rational points on elliptic curves, On the exponent of the group of points of an elliptic curve over a finite field, Differential Addition on Binary Elliptic Curves, Adequate Elliptic Curves for Computing the Product of n Pairings, A Generalised Successive Resultants Algorithm, Modular polynomials via isogeny volcanoes, Isomorphism classes of Doche-Icart-Kohel curves over finite fields, On the linear complexity profile of some sequences derived from elliptic curves, Bicovering arcs and small complete caps from elliptic curves, Isomorphism classes of Edwards curves over finite fields, An ID-based signcryption scheme with compartmented secret sharing for unsigncryption, The number of twists with large torsion of an elliptic curve, A family of elliptic curves with rank $\geq 5$, An optimal representation for the trace zero subgroup, On a theorem of Mestre and Schoof, On the class numbers of certain number fields obtained from points on elliptic curves. III, The Diffie-Hellman problem and generalization of Verheul's theorem, Low-cost addition-subtraction sequences for the final exponentiation in pairings, On the number of distinct elliptic curves in some families, Recent progress on the elliptic curve discrete logarithm problem, Scalable zero knowledge via cycles of elliptic curves, $abc$ triples, Counting the order of the group of points of an elliptic curve over a finite field based on Shanks's algorithm, Generalised elliptic functions, On the representation of the number of integral points of an elliptic curve modulo a prime number, New explicit binary constant weight codes from Reed-Solomon codes, Predicting the elliptic curve congruential generator, Polynomial interpolation of the Naor-Reingold pseudo-random function, Elliptic curve cryptography: the serpentine course of a paradigm shift, Computing the endomorphism ring of an ordinary elliptic curve over a finite field, Analogues of Vélu’s formulas for isogenies on alternate models of elliptic curves, On Group Structures Realized by Elliptic Curves over a Fixed Finite Field, On Group Structures Realized by Elliptic Curves over Arbitrary Finite Fields, Constructing irreducible polynomials over finite fields, Computational Number Theory and Cryptography, Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography, On taking square roots without quadratic nonresidues over finite fields, Primality tests for 2^{𝑝}±2^{(𝑝+1)/2}+1 using elliptic curves, Computing Hilbert class polynomials with the Chinese remainder theorem, Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2, Compositeness test with nodal curves, A relation between embedding degrees and class numbers of binary quadratic forms

Uses Software

SageMath