Πιστοποίηση Πρώτου

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

In this chapter we study the problem of the computation of discrete logarithm and we present the most known algorithms for its solution. <br/>More precisely, we describe the algorithms of Shanks, ρ of Pollard and Pohlig-Hellman for an arbitrary cyclic group and the algorithm of Adleman for the multiplicative group of integers modulo n .