[go: up one dir, main page]

Gordon, 1989 - Google Patents

On the number of elliptic pseudoprimes

Gordon, 1989

View PDF
Document ID
10389497271675334859
Author
Gordon D
Publication year
Publication venue
Mathematics of Computation

External Links

Snippet

For an elliptic curve E with complex multiplication by an order in $ K={\mathbf {Q}}(\sqrt {-d}) $, a point P of infinite order on E, and any prime p with $(-d| p)=-1$, we have that $(p+ 1)\cdot P= O\pmod p $, where O is the point at infinity and calculations are done using the …
Continue reading at scholar.archive.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/725—Finite field arithmetic over elliptic curves
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • G06F7/52—Multiplying; Dividing
    • G06F7/523—Multiplying only
    • G06F7/53—Multiplying only in parallel-parallel fashion, i.e. both operands being entered in parallel
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/729—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic using representation by a residue number system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F2207/72—Indexing scheme relating to groups G06F7/72 - G06F7/729
    • G06F2207/7209—Calculation via subfield, i.e. the subfield being GF(q) with q a prime power, e.g. GF ((2**m)**n) via GF(2**m)

Similar Documents

Publication Publication Date Title
Montgomery Modular multiplication without trial division
Gaudry An algorithm for solving the discrete log problem on hyperelliptic curves
Koblitz Constructing elliptic curve cryptosystems in characteristic 2
Brickell A fast modular multiplication algorithm with application to two key cryptography
Lenstra Jr Factoring integers with elliptic curves
Enge et al. A general framework for subexponential discrete logarithm algorithms
Brent Some integer factorization algorithms using elliptic curves
Doche et al. Efficient scalar multiplication by isogeny decompositions
Brent PARALLEL ALGORITHMS
Gordon On the number of elliptic pseudoprimes
Montgomery et al. An FFT extension to the 𝑃-1 factoring algorithm
Adleman et al. Counting rational points on curves and abelian varieties over finite fields
Bach et al. Sums of divisors, perfect numbers, and factoring
Kaliski Jr One-way permutations on elliptic curves
Wu Low complexity bit-parallel finite field arithmetic using polynomial basis
Lenstra Primality testing
Flynn et al. Covering collections and a challenge problem of Serre
Skjernaa Satoh’s algorithm in characteristic 2
Fateman Polynomial multiplication, powers and asymptotic analysis: Some comments
Lauter et al. Improved CRT algorithm for class polynomials in genus 2
Solinas Improved algorithms for arithmetic on anomalous binary curves
Costello et al. Constructing abelian surfaces for cryptography via Rosenhain invariants
Miyamoto et al. Elliptic pseudoprimes
Doche et al. New and improved methods to analyze and compute double-scalar multiplications
Bernstein Arbitrarily tight bounds on the distribution of smooth integers