Comments on Saeednia's improved scheme for the hill cipher
| dc.citation.epage | 746 | en_US |
| dc.citation.issue | 5 | en_US |
| dc.citation.spage | 743 | en_US |
| dc.citation.volume | 27 | en_US |
| dc.citation.woscount | 5 | |
| dc.contributor.author | Lin, CH | en_US |
| dc.contributor.author | Lee, CY | en_US |
| dc.contributor.author | Lee, CY | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:38:36Z | |
| dc.date.available | 2014-12-08T15:38:36Z | |
| dc.date.issued | 2004-09-01 | en_US |
| dc.description.abstract | In 2000, Saeednia proposed a new scheme to make the Hill cipher secure. The author makes use of permutations of columns and rows of a matrix to get a different key for encrypting each message. This paper shows that the cipher key H-t can be obtained by parameter u. Besides, the Saeednia's scheme costs a lot of time in matrix computation. To overcome the drawbacks of Saeednia's scheme, a more secure cryptosystem with a one-way hash function is proposed. | en_US |
| dc.identifier.issn | 0253-3839 | en_US |
| dc.identifier.journal | JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/26412 | |
| dc.identifier.wosnumber | WOS:000223895700013 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Hill cipher | en_US |
| dc.subject | known-plaintext attack | en_US |
| dc.subject | cryptosystem | en_US |
| dc.subject | one-way hash function | en_US |
| dc.title | Comments on Saeednia's improved scheme for the hill cipher | en_US |
| dc.type | Article | en_US |