Cryptanalysis of a Public Key Encryption Scheme Using Ergodic Matrices

Rasslan, Mohamed; Youssef, Amr M.

doi:10.1587/transfun.e94.a.853

Search citation statements

Order By: Relevance

Paper Sections

Select...

Discussion2

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2013

2024

Publication Types

Select...

Article2

Book1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The method we used is linearity similar to that in Refs. [6,9,14]. The attack only needs to solve computational SEME problem instead of SEME problem or discrete logarithm problem.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Cryptanalysis of an Encryption Scheme Using Matrices over Finite Fields

Huang¹,

Deng²,

et al. 2018

Chin. j. electron.

View full text Add to dashboard Cite

“…The method we used is linearity similar to that in Refs. [6,9,14]. The attack only needs to solve computational SEME problem instead of SEME problem or discrete logarithm problem.…”

Section: Discussionmentioning

confidence: 99%

“…[11] proposed by Pei and Zhao is based on TEME problem. Rasslan and Youssef [14] showed that breaking this scheme is equivalent to solving a set of linear equations which renders this scheme insecure.…”

Section: Introductionmentioning

confidence: 99%

Cryptanalysis of an Encryption Scheme Using Matrices over Finite Fields

Huang¹,

Deng²,

et al. 2018

Chin. j. electron.

View full text Add to dashboard Cite

“…(e.g., see [9,13]) due to the inherent linearity of the underlying matrices' operations. Designing a secure key exchange algorithm based on matrices or other non-commutative finite groups/rings with efficient operations remains a very interesting and challenging research problem.…”

Section: Discussionmentioning

confidence: 99%