当前位置: X-MOL 学术Aut. Control Comp. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Decimation of M Sequences As a Way of Obtaining Primitive Polynomials
Automatic Control and Computer Sciences Pub Date : 2024-02-29 , DOI: 10.3103/s0146411623080138
D. V. Kushnir , S. N. Shemyakin

Abstract—

One approach to obtain a cryptographically strong encryption gamma is to use linear-feedback shift registers defined by primitive polynomials. The ability to quickly select the appropriate polynomial can provide the required degree of security of the stream cipher. Currently, primitive polynomials for sufficiently large degrees are known, but usually these are so-called sparse polynomials. To increase the correlational stability, it is necessary to be able to quickly generate new primitive polynomials of the given degrees, which is the focus of this study.



中文翻译:

M 序列的抽取作为获取原多项式的一种方法

摘要-

获得加密强度高的加密伽马的一种方法是使用由本原多项式定义的线性反馈移位寄存器。快速选择适当多项式的能力可以提供流密码所需的安全程度。目前,足够大次数的本原多项式是已知的,但通常这些是所谓的稀疏多项式。为了增加相关稳定性,需要能够快速生成给定次数的新的本原多项式,这是本研究的重点。

更新日期:2024-03-01
down
wechat
bug