<--- Back to Details
First PageDocument Content
Modular arithmetic / Primality tests / Euclidean algorithm / Prime number / Quadratic residue / Randomized algorithm / Factorization of polynomials over a finite field and irreducibility tests / Miller–Rabin primality test / Mathematics / Number theory / Abstract algebra
Date: 2010-11-16 14:00:41
Modular arithmetic
Primality tests
Euclidean algorithm
Prime number
Quadratic residue
Randomized algorithm
Factorization of polynomials over a finite field and irreducibility tests
Miller–Rabin primality test
Mathematics
Number theory
Abstract algebra

J. Cryptology[removed]:[removed]Journal of Cryptology[removed]International Association for Cryptologic Research

Add to Reading List

Source URL: www.math.dartmouth.edu

Download Document from Source Website

File Size: 660,18 KB

Share Document on Facebook

Similar Documents

Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm / Factorial / Factorization of polynomials over a finite field and irreducibility tests / Euclidean algorithm / Mathematics / Combinatorics / Number theory

Approximation Algorithms for Projective Clustering  Pankaj K. Agarwalz y Cecilia M. Procopiuc z

DocID: 1fTRq - View Document

Cryptography / Finite fields / Public-key cryptography / Euclidean algorithm / Factorization of polynomials over a finite field and irreducibility tests / Mathematics / Mathematical analysis / Polynomials

Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme P. Delsarte Philips Research Laboratory, Avenue Van Becelaere, 2 B-1170 Brussels, Belgium Y. Desmedt

DocID: 1fSPH - View Document

Computational number theory / Cryptography / Factorization of polynomials over a finite field and irreducibility tests / Polynomials / Anatolii Alexeevitch Karatsuba / Mathematics / Algebra / Coding theory

Department of Mathematics Texas A&M University 3368 TAMU College Station, TXF

DocID: 1aivU - View Document

Algebra / Function / Summation / Factorization of polynomials over a finite field and irreducibility tests / Irreducible polynomial / Mathematics / Abstract algebra / Polynomials

THINK 37 (AND 37A) PROBLEM SET 2 This set is due by noon on Thursday, October 11 in the manilla envelope in Otis Chodosh’s mailbox. Write solutions to four of the following eight problems. Pick problems suitable to yo

DocID: 19Ca2 - View Document

Computational number theory / Cryptography / Factorization of polynomials over a finite field and irreducibility tests / Polynomials / Markov decision process / Mathematics / Coding theory / Algebra

Department of Mathematics Texas A&M University 3368 TAMU College Station, TXF

DocID: 19nzZ - View Document