<--- Back to Details
First PageDocument Content
Algebraic number theory / Modular arithmetic / Finite fields / Frobenius endomorphism / Galois theory / Quadratic residue / Proofs of quadratic reciprocity / Abstract algebra / Mathematics / Number theory
Date: 2007-05-15 00:07:27
Algebraic number theory
Modular arithmetic
Finite fields
Frobenius endomorphism
Galois theory
Quadratic residue
Proofs of quadratic reciprocity
Abstract algebra
Mathematics
Number theory

Add to Reading List

Source URL: matwbn.icm.edu.pl

Download Document from Source Website

File Size: 190,67 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