Ισοτιμίες

• Κύριοι συγγραφείς: Πουλάκης, Δημήτριος, Poulakis, Dimitrios
• Μορφή: 7
• Γλώσσα: Greek
• Έκδοση: 2016
• Θέματα: ΥΠΟΛΟΓΙΣΤΙΚΗ ΘΕΩΡΙΑ ΑΡΙΘΜΩΝ; ΠΑΡΑΓΟΝΤΟΠΟΙΗΣΗ ΑΚΕΡΑΙΩΝ; ΚΡΥΠΤΟΓΡΑΦΙΑ.; Computational Number Theory; Integer Factorization; Cryptograpy

This chapter is devoted to one of the most important topics of the Computational Number Theory which is the integer factorization. We shall describe the methods of Fermat, Legendre, Dixon, Continuous Fractions and the algorithms p-1 and ρ of Pollard. Note that polynomial time algorithm for the integer factorization is not invented yet. The most effective integer factorization algorithms are the Number Field Sieve and the method of Elliptic Curves but the development of the necessary mathematical tools for their presentation is not in the aims of this book.