MAJE4的密码分析

2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007) Pub Date : 2007-12-15 DOI:10.1109/CIS.WORKSHOPS.2007.161

M. A. Orumiehchiha, E. Shakour

{"title":"MAJE4的密码分析","authors":"M. A. Orumiehchiha, E. Shakour","doi":"10.1109/CIS.WORKSHOPS.2007.161","DOIUrl":null,"url":null,"abstract":"In this paper, some weak points in design of MAJE4 algorithm are probed and by exploiting them, two cryptographic attacks are proposed for both versions (128-bit, 256-bit). It is proved that MAJE4 is vulnerable against key recovery attack with complexity less than exhaustive search. We show the security of MAJE4-128, -256 are not greater than 296 and 2106 respectively. And also, a distinguish attack is examined that can recognize the output running keys from a truly random stream with data complexity of 278.8 and 284.8 output words for MAJE4-128 and MAJE4-256 respectively.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Cryptanalysis of MAJE4\",\"authors\":\"M. A. Orumiehchiha, E. Shakour\",\"doi\":\"10.1109/CIS.WORKSHOPS.2007.161\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, some weak points in design of MAJE4 algorithm are probed and by exploiting them, two cryptographic attacks are proposed for both versions (128-bit, 256-bit). It is proved that MAJE4 is vulnerable against key recovery attack with complexity less than exhaustive search. We show the security of MAJE4-128, -256 are not greater than 296 and 2106 respectively. And also, a distinguish attack is examined that can recognize the output running keys from a truly random stream with data complexity of 278.8 and 284.8 output words for MAJE4-128 and MAJE4-256 respectively.\",\"PeriodicalId\":409737,\"journal\":{\"name\":\"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.WORKSHOPS.2007.161\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文探讨了MAJE4算法设计中的一些弱点，并利用这些弱点，提出了针对128位和256位两种版本的加密攻击。证明了MAJE4易受密钥恢复攻击，且复杂度低于穷举搜索。结果表明，MAJE4-128、-256的安全性分别不大于296和2106。此外，本文还研究了一种区分攻击，该攻击可以从一个真正的随机流中识别输出的运行密钥，其中MAJE4-128和MAJE4-256的数据复杂度分别为278.8和284.8个输出字。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Cryptanalysis of MAJE4

In this paper, some weak points in design of MAJE4 algorithm are probed and by exploiting them, two cryptographic attacks are proposed for both versions (128-bit, 256-bit). It is proved that MAJE4 is vulnerable against key recovery attack with complexity less than exhaustive search. We show the security of MAJE4-128, -256 are not greater than 296 and 2106 respectively. And also, a distinguish attack is examined that can recognize the output running keys from a truly random stream with data complexity of 278.8 and 284.8 output words for MAJE4-128 and MAJE4-256 respectively.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)

自引率

0.00%

发文量