scientific article; zbMATH DE number 4123895
From MaRDI portal
Publication:4204265
zbMath0686.14039MaRDI QIDQ4204265
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmscryptographyelliptic curvepoint counting theoremsprime factor decomposition problempseudo-prime test
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Special algebraic curves and curves of low genus (14H45) Elliptic curves (14H52) Software, source code, etc. for problems pertaining to algebraic geometry (14-04) Primes (11A41)
Related Items
Multiplicative functions in short intervals, Counting points on elliptic curves over finite fields, A survey on the group of points arising from elliptic curves with a Weierstrass model over a ring, Multiplication polynomials for elliptic curves over finite local rings, Elliptic loops, Group structure of elliptic curves over \(\mathbb{Z}/N\mathbb{Z}\), Factoring integers and oracles for elliptic and hyperelliptic curves, Smooth factors of integers and elliptic curve based factoring with an oracle, A complete set of addition laws for incomplete Edwards curves, On oracle factoring of integers, A framework for deterministic primality proving using elliptic curves with complex multiplication, Some remarks on primality proving and elliptic curves, Papers from the conference 21st Journées Arithmétiques held at the Università Lateranense, Rome, July 12--16, 2001, Some computational problems of cryptographic significance concerning elliptic curves over rings, Elliptic curves over a nonlocal ring 𝔽2d[𝜀,𝜀2 = 𝜀]
