Dynamic GOST
| dc.citation.epage | 861 | en_US |
| dc.citation.issue | 6 | en_US |
| dc.citation.spage | 857 | en_US |
| dc.citation.volume | 16 | en_US |
| dc.citation.woscount | 0 | |
| dc.contributor.author | Yeh, YS | en_US |
| dc.contributor.author | Lin, CH | en_US |
| dc.contributor.author | Wang, CC | en_US |
| dc.contributor.department | 資訊科學與工程研究所 | zh_TW |
| dc.contributor.department | Institute of Computer Science and Engineering | en_US |
| dc.date.accessioned | 2014-12-08T15:44:44Z | |
| dc.date.available | 2014-12-08T15:44:44Z | |
| dc.date.issued | 2000-11-01 | en_US |
| dc.description.abstract | GOST is a block algorithm which was adopted as a standard by the former Soviet Union. Because it keeps a lot of secret information, including S-boxes, the algorithm is secure and easy to understand. In this article, we propose a variant of COST, called dynamic COST, in which permutations are applied. With the permutation information securely kept: the new version of COST is more secure and better to withstand differential and linear attacks. | en_US |
| dc.identifier.issn | 1016-2364 | en_US |
| dc.identifier.journal | JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/30191 | |
| dc.identifier.wosnumber | WOS:000165795600005 | |
| dc.language.iso | en_US | en_US |
| dc.subject | GOST | en_US |
| dc.subject | block cipher | en_US |
| dc.subject | S-boxes | en_US |
| dc.subject | DES | en_US |
| dc.subject | subkey generation | en_US |
| dc.subject | cryptanalysis | en_US |
| dc.subject | differential attack | en_US |
| dc.subject | linear attack | en_US |
| dc.subject | random permutation | en_US |
| dc.title | Dynamic GOST | en_US |
| dc.type | Article | en_US |