流动密码域中BM算法的一种新的简单矩阵表示方法

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

Qian Yin, Ping Guo, Zukuan Wei, Zhiyong He

{"title":"流动密码域中BM算法的一种新的简单矩阵表示方法","authors":"Qian Yin, Ping Guo, Zukuan Wei, Zhiyong He","doi":"10.1109/CIS.WORKSHOPS.2007.79","DOIUrl":null,"url":null,"abstract":"In this paper, a new simple representation of the Berlekamp-Massey algorithm was proposed, which resolves the problem of the length of the shortest linear recurrence in the flowing cipher study. In the process of investigating the Berlekamp-Massey algorithm, using matrix-method can help to simplify the representation of the Berlekamp-Massey algorithm and easily calculate the distributing regulation of the shortest linear recurrence length compared to the traditional method.","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":"0","resultStr":"{\"title\":\"A New Simple Matrix Representation Method of the BM Algorithm Using in Flowing Cipher Field\",\"authors\":\"Qian Yin, Ping Guo, Zukuan Wei, Zhiyong He\",\"doi\":\"10.1109/CIS.WORKSHOPS.2007.79\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a new simple representation of the Berlekamp-Massey algorithm was proposed, which resolves the problem of the length of the shortest linear recurrence in the flowing cipher study. In the process of investigating the Berlekamp-Massey algorithm, using matrix-method can help to simplify the representation of the Berlekamp-Massey algorithm and easily calculate the distributing regulation of the shortest linear recurrence length compared to the traditional method.\",\"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\":\"0\",\"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.79\",\"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.79","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文提出了Berlekamp-Massey算法的一种新的简单表示，解决了流动密码研究中最短线性递归的长度问题。在研究Berlekamp-Massey算法的过程中，与传统方法相比，使用矩阵法有助于简化Berlekamp-Massey算法的表示，并且易于计算出最短线性递归长度的分布规律。

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

查看原文本刊更多论文

A New Simple Matrix Representation Method of the BM Algorithm Using in Flowing Cipher Field

In this paper, a new simple representation of the Berlekamp-Massey algorithm was proposed, which resolves the problem of the length of the shortest linear recurrence in the flowing cipher study. In the process of investigating the Berlekamp-Massey algorithm, using matrix-method can help to simplify the representation of the Berlekamp-Massey algorithm and easily calculate the distributing regulation of the shortest linear recurrence length compared to the traditional method.

求助全文

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

来源期刊

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

自引率

0.00%

发文量