Title Details: | |
Algorithms in Cryptography |
|
Authors: |
Pagourtzis, Aristeidis Zachos, Efstathios Grontas, Panagiotis |
Reviewer: |
Poulakis, Dimitrios |
Subject: | MATHEMATICS AND COMPUTER SCIENCE > > > MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > NUMBER THEORY > COMPUTATIONAL NUMBER THEORY MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS AND COMPUTER SCIENCE > > MATHEMATICS AND COMPUTER SCIENCE > > NATURAL SCIENCES AND AGRICULTURAL SCIENCES > PHYSICS > INDERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY > > ENGINEERING AND TECHNOLOGY > > > |
Description: | |
Abstract: |
Integer division. Exponentiation modulo n: repeated squaring. Finding GCD: Euclidean algorithm. Finding inverse modulo n: extended Euclidean algorithm. Computation of Jacobi symbol, checking quadratic residues, calculation of roots modulo a prime and composite number. Primality testing: probabilistic algorithms (Fermat, Solovay-Strassen, Miller-Rabin), deterministic AKS algorithm. The factorization problem. Factorization algorithms: rho method, Dixon's method. The Discrete Logarithm Problem and the Diffie-Hellman problem. Algorithms for computing discrete logarithms: Shanks, Pohlig-Hellman, index-calculus. Classification of problems into complexity classes.
|
Type: |
Chapter |
Creation Date: | 2015 |
Item Details: | |
License: |
Attribution - NonCommercial - ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
Handle | http://hdl.handle.net/11419/5443 |
Bibliographic Reference: | Pagourtzis, A., Zachos, E., & Grontas, P. (2015). Algorithms in Cryptography [Chapter]. In Pagourtzis, A., Zachos, E., & Grontas, P. 2015. Computational Cryptography [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/5443 |
Language: |
Greek |
Is Part of: |
Computational Cryptography |
Publication Origin: |
Kallipos, Open Academic Editions |