完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLin, CHen_US
dc.contributor.authorLee, CYen_US
dc.contributor.authorLee, CYen_US
dc.date.accessioned2014-12-08T15:38:36Z-
dc.date.available2014-12-08T15:38:36Z-
dc.date.issued2004-09-01en_US
dc.identifier.issn0253-3839en_US
dc.identifier.urihttp://hdl.handle.net/11536/26412-
dc.description.abstractIn 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.language.isoen_USen_US
dc.subjectHill cipheren_US
dc.subjectknown-plaintext attacken_US
dc.subjectcryptosystemen_US
dc.subjectone-way hash functionen_US
dc.titleComments on Saeednia's improved scheme for the hill cipheren_US
dc.typeArticleen_US
dc.identifier.journalJOURNAL OF THE CHINESE INSTITUTE OF ENGINEERSen_US
dc.citation.volume27en_US
dc.citation.issue5en_US
dc.citation.spage743en_US
dc.citation.epage746en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000223895700013-
dc.citation.woscount5-
顯示於類別:期刊論文


文件中的檔案:

  1. 000223895700013.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。