First Page | Document Content | |
---|---|---|
Date: 2013-03-21 16:40:51Analytic number theory Elliptic curve Explicit formula Prime-counting function Prime number Supersingular elliptic curve Logarithm Supersingular prime Chebyshev function Mathematics Mathematical analysis Number theory | How explicit is the Explicit Formula? Barry Mazur and William Stein March 21, 2013 (Notes for our 20+20 minute talk at the AMS Special Session on Arithmetic Statistics in San Diego, January 2013)Add to Reading ListSource URL: www.math.harvard.eduDownload Document from Source WebsiteFile Size: 1,82 MBShare Document on Facebook |
On the discrete logarithm problem for plane curves Claus Diem October 26, 2012 AbstractDocID: 1vhrJ - View Document | |
Errata After now a year has passed since I submitted my Habilitation thesis “On arithmetic and the discrete logarithm problem in class groups of curves”, I realized some mistakes and inaccuracies. Two of the mistakeDocID: 1v8oL - View Document | |
Module 3.9 Page 504 ofModule 3.9: What is a Logarithm?DocID: 1v5ns - View Document | |
On the discrete logarithm problem in elliptic curves Claus Diem August 9, 2010 Dedicated to Gerhard FreyDocID: 1v15F - View Document | |
Systems of polynomial equations associated to elliptic curve discrete logarithm problems Claus Diem Institute for Experimental Mathematics, University of Duisburg-Essen October 27, 2004DocID: 1uWKu - View Document |