Smooth Orders and Cryptographic Applications Carl Pomerance1 and Igor E. Shparlinski2 1 Department of Fundamental Mathematics, Bell Laboratories Murray Hill, NJ[removed], USA

First Page		Document Content
Date: 2005-03-02 15:21:08 Mathematical analysis Prime-counting function Prime number theorem Prime number Elliptic curve Riemann hypothesis Smooth number Elliott–Halberstam conjecture Algebraic number field Mathematics Analytic number theory Number theory		Smooth Orders and Cryptographic Applications Carl Pomerance1 and Igor E. Shparlinski2 1 Department of Fundamental Mathematics, Bell Laboratories Murray Hill, NJ[removed], USA Add to Reading List Source URL: www.math.dartmouth.edu Download Document from Source Website File Size: 164,27 KB Share Document on Facebook

	Algebraic techniques for number field computations (extended abstract) Jean-Fran¸cois Biasse1 , Michael J. Jacobson, Jr.2? , and Alan K. Silvester3 ´ Ecole Polytechnique, 91128 Palaiseau, France DocID: 1xVMw - View Document
	CLASS FIELD THEORY P. Stevenhagen Explicit Algebraic Number Theory Oberwolfach Seminar November 2002 DocID: 1voYb - View Document
	MATH 205 (TOPICS IN ALGEBRAIC NUMBER THEORY) - SPRINGProfessor: Cristian D. Popescu Course Topic: Global Fields Course Description: The main goal of this course is to understand global fields (finite field extensi DocID: 1uKaO - View Document
	The Id`ele Class Group Hendrik Lenstra 1. Definitions Let K be an algebraic number field. Let p be a prime of K. We denote by Kp the completion of K at the prime p: if p is a finite place, then Kp is a non-archimedean DocID: 1uugJ - View Document
	APPEARED IN BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY Volume 31, Number 1, July 1994, Pages 1-14 SELBERG’S CONJECTURES AND ARTIN L-FUNCTIONS DocID: 1rsPV - View Document