Discrete Logarithms in Finite Fields Some Algorithms for Computing New Public Key Cryptosystem

Trendafilov, Ivan; Durcheva, Mariana; Venkov, George; Pasheva, Vesela; Kovacheva, Ralitza

doi:10.1063/1.3515599

Search citation statements

Order By: Relevance

Paper Sections

Select...

Some Work Based On Action Of Algebraic Structure1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

2020

Publication Types

Select...

Article1

Other1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [22] a bi-semigroup action problem (BSAP) is proposed and using this computational hard problem a new key exchange protocol is defined. In [8] some properties of semigroups are discussed which are useful for designing the public key cryptosystem.…”

Section: Some Work Based On Action Of Algebraic Structurementioning

confidence: 99%

Survey on SAP and its application in public-key cryptography

Goel

Gupta

Dass

2020

Journal of Mathematical Cryptology

View full text Add to dashboard Cite

AbstractThe 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.

show abstract

Section: Some Work Based On Action Of Algebraic Structurementioning

confidence: 99%