Name
Abstract | ||
|---|---|---|
Shi-Hui et al. proposed a new public key cryptosystem using ergodic binary matrices. The security of the system is derived from some assumed hard problem based on ergodic matrices over GF(2). In this note, we show that breaking this system, with a security parameter n (public key of length 4n(2) bits, secret key of length 2n bits and block length of length n(2) bits), is equivalent to solving a set of n(4) linear equations over GF(2) which renders this system insecure for practical choices of n. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1587/transfun.E94.A.853 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
public key cryptosystems, cryptanalysis | Key generation,Discrete mathematics,Matrix (mathematics),Ergodic theory,Cryptanalysis,Cryptosystem,Theoretical computer science,Security parameter,Public-key cryptography,Mathematics,Key size | Journal |
Volume | Issue | ISSN |
E94A | 2 | 0916-8508 |
Citations | PageRank | References |
1 | 0.37 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohamed M. Nasreldin Rasslan | 1 | 10 | 3.13 |
| Amr Youssef | 2 | 238 | 29.69 |