Title Details: | |
Primality |
|
Authors: |
Poulakis, Dimitrios |
Reviewer: |
Tzanakis, Nikolaos |
Subject: | MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > NUMBER THEORY MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > NUMBER THEORY > COMPUTATIONAL NUMBER THEORY MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS AND COMPUTER SCIENCE > > MATHEMATICS AND COMPUTER SCIENCE > > > |
Keywords: |
Computational Number Theory
Discrete Logarithm Cryptography |
Description: | |
Abstract: |
In this chapter we study the problem of the computation of discrete logarithm and we present the most known algorithms for its solution. 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 .
|
Table of Contents: |
Chapter 8 contains the following sections:
8.1 Discrete Logarithm Problem 8.2 ‘‘Baby step - Giant step’’ 8.3 Αlgorithm ρ of Pollard 8.4 Αlgorithm of Pohlig − Hellman 8.5 Index Calculus Algorithm 8.6 Exercises Bibliography |
Technical Editors: |
Karakostas, Anastasios |
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/1051 |
Bibliographic Reference: | Poulakis, D. (2015). Primality [Chapter]. In Poulakis, D. 2015. Computational Number Theory [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/1051 |
Language: |
Greek |
Is Part of: |
Computational Number Theory |
Number of pages |
15 |
Publication Origin: |
Kallipos, Open Academic Editions |