Regularity versus Complexity in the Binary Representation of 3^n

First Page		Document Content
Date: 2012-08-08 11:47:55 Field theory Integer sequences Binary arithmetic Combinatorics P-adic number Factorial Logarithm Binary numeral system Rational number Mathematics Mathematical analysis Number theory		Regularity versus Complexity in the Binary Representation of 3^n Add to Reading List Source URL: www.complex-systems.com Download Document from Source Website File Size: 3,30 MB Share Document on Facebook

	On the discrete logarithm problem for plane curves Claus Diem October 26, 2012 Abstract DocID: 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 mistake DocID: 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 Frey DocID: 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, 2004 DocID: 1uWKu - View Document