Security of the cryptosystems based on ergodic matrices

The security of the public-key cryptosystems based on ergodicmatrices over finite field was analysed.According to the public key,a system of linear equations for the forged secret key bits is obtained by inverse matrix elimination method.It is proved that the computational TEME problem is solvablein...

Full description

Saved in:
Bibliographic Details
Main Authors: Hua-wei HUANG, Chang-wen PENG, Yun-yun QU, Chun-hua LI
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2015-08-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015128/
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1841539628066144256
author Hua-wei HUANG
Chang-wen PENG
Yun-yun QU
Chun-hua LI
author_facet Hua-wei HUANG
Chang-wen PENG
Yun-yun QU
Chun-hua LI
author_sort Hua-wei HUANG
collection DOAJ
description The security of the public-key cryptosystems based on ergodicmatrices over finite field was analysed.According to the public key,a system of linear equations for the forged secret key bits is obtained by inverse matrix elimination method.It is proved that the computational TEME problem is solvablein polynomial time and the ciphertext of the PZZ1 cryptosystem can be decrypted by the forged secret key.In some case the SEME problem can be reduced to discrete logarithm problem in polynomial time.If the key parameters are chosen improperly,then PZZ2 cryptosystem is based on discrete logarithm problem instead of NP hard problem.
format Article
id doaj-art-051168d980fc42959580f1caede0ae04
institution Kabale University
issn 1000-436X
language zho
publishDate 2015-08-01
publisher Editorial Department of Journal on Communications
record_format Article
series Tongxin xuebao
spelling doaj-art-051168d980fc42959580f1caede0ae042025-01-14T06:53:19ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2015-08-0136616759694756Security of the cryptosystems based on ergodic matricesHua-wei HUANGChang-wen PENGYun-yun QUChun-hua LIThe security of the public-key cryptosystems based on ergodicmatrices over finite field was analysed.According to the public key,a system of linear equations for the forged secret key bits is obtained by inverse matrix elimination method.It is proved that the computational TEME problem is solvablein polynomial time and the ciphertext of the PZZ1 cryptosystem can be decrypted by the forged secret key.In some case the SEME problem can be reduced to discrete logarithm problem in polynomial time.If the key parameters are chosen improperly,then PZZ2 cryptosystem is based on discrete logarithm problem instead of NP hard problem.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015128/ergodic matrixpublic-key cryptographycomputational complexityfinite fieldalgorithm
spellingShingle Hua-wei HUANG
Chang-wen PENG
Yun-yun QU
Chun-hua LI
Security of the cryptosystems based on ergodic matrices
Tongxin xuebao
ergodic matrix
public-key cryptography
computational complexity
finite field
algorithm
title Security of the cryptosystems based on ergodic matrices
title_full Security of the cryptosystems based on ergodic matrices
title_fullStr Security of the cryptosystems based on ergodic matrices
title_full_unstemmed Security of the cryptosystems based on ergodic matrices
title_short Security of the cryptosystems based on ergodic matrices
title_sort security of the cryptosystems based on ergodic matrices
topic ergodic matrix
public-key cryptography
computational complexity
finite field
algorithm
url http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015128/
work_keys_str_mv AT huaweihuang securityofthecryptosystemsbasedonergodicmatrices
AT changwenpeng securityofthecryptosystemsbasedonergodicmatrices
AT yunyunqu securityofthecryptosystemsbasedonergodicmatrices
AT chunhuali securityofthecryptosystemsbasedonergodicmatrices