Survey on SAP and its application in public-key cryptography
| Autor: | B. K. Dass, Indivar Gupta, Neha Goel |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
elgamal cryptosystem
Computer science Physics::Medical Physics 0102 computer and information sciences 02 engineering and technology Computer security computer.software_genre 01 natural sciences Diffie–Hellman key exchange Public-key cryptography diffie–hellman key exchange QA1-939 0202 electrical engineering electronic engineering information engineering 94a60 Computer Science::Databases Physics::Biological Physics business.industry Applied Mathematics 020206 networking & telecommunications semigroup action problem Computer Science Applications Computational Mathematics 010201 computation theory & mathematics Elgamal cryptosystem business computer Mathematics |
| Zdroj: | Journal of Mathematical Cryptology, Vol 14, Iss 1, Pp 144-152 (2020) |
| ISSN: | 1862-2984 1862-2976 |
| DOI: | 10.1515/jmc-2016-0004 |
| Popis: | The concept of the semigroup action problem (SAP) was first introduced by Monico in 2002. Monico explained in his paper that the discrete logarithm problem (DLP) can be generalized to SAP. After defining the action problem in a semigroup, the concept was extended using different mathematical structures. In this paper, we discuss the concept of SAP and present a detailed survey of the work which has been done using it in public-key cryptography. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|