<--- Back to Details
First PageDocument Content
Abstract algebra / Algebra / Mathematics / Primality tests / Finite fields / Elliptic curves / Elliptic curve primality / Group theory / Elliptic curve / Lenstra elliptic curve factorization / Quadratic residue / Prime number
Date: 2016-04-18 16:20:05
Abstract algebra
Algebra
Mathematics
Primality tests
Finite fields
Elliptic curves
Elliptic curve primality
Group theory
Elliptic curve
Lenstra elliptic curve factorization
Quadratic residue
Prime number

Annales Univ. Sci. Budapest., Sect. Comp–27 PRIMALITY PROOFS WITH ELLIPTIC CURVES: HEURISTICS AND ANALYSIS Wieb Bosma, Eric Cator (Nijmegen, The Netherlands)

Add to Reading List

Source URL: www.math.ru.nl

Download Document from Source Website

File Size: 255,28 KB

Share Document on Facebook

Similar Documents

Asymptotics of the minimal distance of quadratic residue codes Jos´ e Felipe Voloch The binary quadratic residue codes are defined as follows.  Given a prime p ≡

Asymptotics of the minimal distance of quadratic residue codes Jos´ e Felipe Voloch The binary quadratic residue codes are defined as follows. Given a prime p ≡

DocID: 1s8Dx - View Document

Double Circulant Quadratic Residue Codes ∗ Tor Helleseth †

Double Circulant Quadratic Residue Codes ∗ Tor Helleseth †

DocID: 1rXXC - View Document

ON A PROPERNESS OF THE HILBERT EIGENVARIETY AT INTEGRAL WEIGHTS: THE CASE OF QUADRATIC RESIDUE FIELDS SHIN HATTORI Abstract. Let p be a rational prime. Let F be a totally real number field such that F is unramified over

ON A PROPERNESS OF THE HILBERT EIGENVARIETY AT INTEGRAL WEIGHTS: THE CASE OF QUADRATIC RESIDUE FIELDS SHIN HATTORI Abstract. Let p be a rational prime. Let F be a totally real number field such that F is unramified over

DocID: 1roCB - View Document

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

DocID: 1rgbF - View Document

SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look at the last digit,” with the idea of cheaply pulling out possible factors of

SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look at the last digit,” with the idea of cheaply pulling out possible factors of

DocID: 1rfno - View Document