Further results on the distinctness of modulo 2 reductions of primitive sequences over $$\mathbf{Z}/(2^{32}-1)$$ Z / ( 2 32

Further results on the distinctness of modulo 2 reductions of primitive sequences over $$\mathbf{Z}/(2^{32}-1)$$ Z / ( 2 32 - 1 )

Published:2013-08-21 Issue:2 Volume:74 Page:467-480
ISSN:0925-1022
Container-title:Designs, Codes and Cryptography
language:en
Short-container-title:Des. Codes Cryptogr.

Author:

Yang Dong,Qi Wen-Feng,Zheng Qun-Xiong

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10623-013-9871-y.pdf

Reference9 articles.

1. ETSI/SAGE Specification: Specification of the 3GPP confidentiality and integrity algorithms 128-EEA3 & 128-EIA3. Document 4: Design and Evaluation Report, Version: 2.0. Technicl Report, ETSI 2011. http://www.gsmworld.com/our-work/programmes-and-initiatives/fraud-and-security/gsm_security_algorithms.htm (2011). Accessed 9 Sept 2011.

2. Zhu X.Y., Qi W.F.: On the distinctness of modular reduction of maximal length modulo odd prime numbers. Math. Comput. 77(7), 1623–1637 (2008).

3. Zheng Q.X., Qi W.F., Tian T.: On the distinctness of modular reduction of primitive sequences over $${ Z}/(2^{32}-1)$$ Z / ( 2 32 - 1 ) . Des. Codes Cryptogr. 112(22), 872–875 (2012). doi: 10.1007/s10623-012-9698-y .

4. Lidl R., Niedereiter H.: Finite Field. Addison-Wesley, Don Mills (1983).

5. Hall M.: An isomorphism between linear recurring sequences and algebraic rings. Trans. Am. Math. Soc. 44, 196–218 (1938).

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Survey on cyberspace security;Science China Information Sciences;2015-11

2. On the distinctness of primitive sequences over Z/(p e q) modulo 2;Cryptography and Communications;2015-08-07