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

Unnamed Item, Combinatorial identities involving degenerate harmonic and hyperharmonic numbers, Lower-Order Biases in the Second Moment of Dirichlet Coefficients in Families of L-Functions, Proving knowledge of isogenies: a survey, A geometric approach to elliptic curves with torsion groups Z/10Z, Z/12Z, Z/14Z, and Z/16Z, SCALLOP: scaling the CSI-FiSh, Fast subgroup membership testings for $\mathbb{G}_1, \mathbb{G}_2$ and $\mathbb{G}_T$ on pairing-friendly curves, Families of ϕ‐congruence subgroups of the modular group, An innovative approach towards image encryption by using novel PRNs and S-boxes modeling techniques, Odd torsion Brauer elements and arithmetic of diagonal quartic surfaces over number fields, Efficiently computable complex multiplication of elliptic curves, Fast hashing to $\mathbb{G}_2$ on pairing-friendly curves with the lack of twists, Arithmetic progressions in certain subsets of finite fields, RANK JUMPS AND GROWTH OF SHAFAREVICH–TATE GROUPS FOR ELLIPTIC CURVES IN -EXTENSIONS, A formula for disaster: a unified approach to elliptic curve special-point-based attacks, Elliptic loops, Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II, Parallel isogeny path finding with limited memory, On the Galois group over $\mathbb Q$ of a truncated binomial expansion, Division by $2$ of rational points on elliptic curves, Orthogonal and symplectic 𝑛-level densities, Unnamed Item, Division by on odd-degree hyperelliptic curves and their Jacobians, Factoring polynomials over finite fields, Improved supersingularity testing of elliptic curves, AN IDENTITY-BASED ENCRYPTION SCHEME USING ISOGENY OF ELLIPTIC CURVES, Elliptic curve cryptography arithmetic in terms of one variable polynomial division, The soft graphic integer sub-decomposition method for elliptic scalar multiplication, The elliptic scalar multiplication graph and its application in elliptic curve cryptography, An elementary linear-algebraic proof without computer-aided arguments for the group law on elliptic curves, Elliptic divisibility sequences over the Edwards model of elliptic curves, Discretization and superintegrability all rolled into one, Deterministic methods of Ramanujan graph construction for use in cryptographic algorithms based on generalized cellular automata, Explicit characterization of the torsion growth of rational elliptic curves with complex multiplication over quadratic fields, On the exponent of the group of points of an elliptic curve over a finite field, Algebro-geometric aspectsof the Christoffel-Darboux kernelsfor classical orthogonal polynomials, Torsion groups of a family of elliptic curves over number fields, Families of elliptic curves with rational torsion points of even order, 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, AGM and Jellyfish Swarms of Elliptic Curves, Quadratic points on bielliptic modular curves, A survey on the group of points arising from elliptic curves with a Weierstrass model over a ring, An Algorithm for Determining Torsion Growth of Elliptic Curves, 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, Uniform encodings to elliptic curves and indistinguishable point representation, Practical isogeny-based key-exchange with optimal tightness, On the number of distinct elliptic curves in some families, Recent progress on the elliptic curve discrete logarithm problem, Hesse pencils and 3-torsion structures, Classics revisited: Éléments de géométrie algébrique, On division polynomial PIT and supersingularity, On isogeny graphs of supersingular elliptic curves over finite fields, Scalable zero knowledge via cycles of elliptic curves, Certificateless public key encryption scheme with hybrid problems and its application to Internet of things, Injective encodings to binary ordinary 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, Extending the GLS endomorphism to speed up GHS Weil descent using Magma, Computational problems in supersingular elliptic curve isogenies, Orchards in elliptic curves over finite fields, A new public key cryptosystem based on Edwards curves, On the representation of the number of integral points of an elliptic curve modulo a prime number, Image cipher applications using the elliptical curve and chaos, Isogenies on twisted Hessian curves, Constructing cycles in isogeny graphs of supersingular elliptic curves, On the $p$-th division polynomial, Strong pseudoprimes to base 2, Construction of an infinite family of elliptic curves of 2-Selmer rank 1 from Heron triangles, SimS: a simplification of SiGamal, On the Mordell-Weil lattice of $y^2=x^3+bx+t^{3^n+1}$ in characteristic 3, Multiple images encryption based on 3D scrambling and hyper-chaotic system, Families of cubic elliptic curves containing sequences of consecutive powers, Elliptic curve and integer factorization, A new adaptive attack on SIDH, Inferring sequences produced by elliptic curve generators using Coppersmith's methods, Isogeny formulas for Jacobi intersection and twisted Hessian curves, A proof of the Hasse-Weil inequality for genus 2 à la Manin, Torsion growth of rational elliptic curves in sextic number fields, Rational points of the symmetric diagonal equations, Supersingular twisted Edwards curves over prime fields. II: Supersingular twisted Edwards curves with the $j$-invariant equal to $66^3$, Supersingular twisted Edwards curves over prime fields. I: Supersingular twisted Edwards curves with $j$-invariants equal to zero and $12^3$, 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, Evaluation of Gaussian hypergeometric series using Huff's models of elliptic curves, Special properties of the point addition law for non-cyclic Edwards curves, Differential addition on binary elliptic curves, On the universal $p$-adic sigma and Weierstrass zeta functions, 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