Articles liés à Integer factorization: Number theory, Composite number,...

Integer factorization: Number theory, Composite number, Factorization, Algorithm, Cryptography, Elliptic curve, Algebraic number theory, Quantum computer, RSA problem - Couverture souple

 
9786132650801: Integer factorization: Number theory, Composite number, Factorization, Algorithm, Cryptography, Elliptic curve, Algebraic number theory, Quantum computer, RSA problem
Couverture souple
ISBN 10 : 6132650806 ISBN 13 : 9786132650801
Editeur : Alphascript Publishing, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In number theory, integer factorization or prime factorization is the breaking down of a composite number into smaller non-trivial divisors, which when multiplied together equal the original integer. When the numbers are very large, no efficient integer factorization algorithm is publicly known; an effort concluded in 2009 by several researchers factored a 232-digit number (RSA-768) utilizing hundreds of machines over a span of 2 years. The presumed difficulty of this problem is at the heart of certain algorithms in cryptography such as RSA.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Éditeur
Alphascript Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
6132650806
ISBN 13 
9786132650801
Reliure
Broché
Nombre de pages
128
Éditeur
Miller Frederic P., Vandome Agnes F., McBrewster John
Coordonnées du fabricant
non disponible
Personne responsable
non disponible