Cryptanalysis of a Public Key Encryption Scheme Using Ergodic Matrices
Summary :
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 4n2 bits, secret key of length 2n bits and block length of length n2 bits), is equivalent to solving a set of n4 linear equations over GF(2) which renders this system insecure for practical choices of n.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E94-A No.2 pp.853-854
- Publication Date
- 2011/02/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E94.A.853
- Type of Manuscript
- LETTER
- Category
- Cryptography and Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Mohamed RASSLAN, Amr YOUSSEF, "Cryptanalysis of a Public Key Encryption Scheme Using Ergodic Matrices" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 2, pp. 853-854, February 2011, doi: 10.1587/transfun.E94.A.853.
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 4n2 bits, secret key of length 2n bits and block length of length n2 bits), is equivalent to solving a set of n4 linear equations over GF(2) which renders this system insecure for practical choices of n.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.853/_p
Copy
@ARTICLE{e94-a_2_853,
author={Mohamed RASSLAN, Amr YOUSSEF, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Cryptanalysis of a Public Key Encryption Scheme Using Ergodic Matrices},
year={2011},
volume={E94-A},
number={2},
pages={853-854},
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 4n2 bits, secret key of length 2n bits and block length of length n2 bits), is equivalent to solving a set of n4 linear equations over GF(2) which renders this system insecure for practical choices of n.},
keywords={},
doi={10.1587/transfun.E94.A.853},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - Cryptanalysis of a Public Key Encryption Scheme Using Ergodic Matrices
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 853
EP - 854
AU - Mohamed RASSLAN
AU - Amr YOUSSEF
PY - 2011
DO - 10.1587/transfun.E94.A.853
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2011
AB - 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 4n2 bits, secret key of length 2n bits and block length of length n2 bits), is equivalent to solving a set of n4 linear equations over GF(2) which renders this system insecure for practical choices of n.
ER -
English
