期刊文献+

Construction of k-ary Pseudorandom Elliptic Curve Sequences

Construction of k-ary Pseudorandom Elliptic Curve Sequences
原文传递
导出
摘要 We present a method for constructing k-ary sequences over elliptic curves. Using the multiplicative character of order k of finite fields, we construct a family of k-ary pseudorandom elliptic curve sequences. The pseudorandom measures, such as the well-distribution measure, the correlation measure of order e, and the linear complexity are estimated by using certain character sums. Such sequences share the same order of magnitude on the well-distribution measure, the correlation measure of order e as the 'truly' random sequences. The method indicates that it is possible to construct 'good' pseudorandom sequences over elliptic curves widely used in public key cryptography. We present a method for constructing k-ary sequences over elliptic curves. Using the multiplicative character of order k of finite fields, we construct a family of k-ary pseudorandom elliptic curve sequences. The pseudorandom measures, such as the well-distribution measure, the correlation measure of order e, and the linear complexity are estimated by using certain character sums. Such sequences share the same order of magnitude on the well-distribution measure, the correlation measure of order e as the 'truly' random sequences. The method indicates that it is possible to construct 'good' pseudorandom sequences over elliptic curves widely used in public key cryptography.
出处 《Wuhan University Journal of Natural Sciences》 CAS 2011年第5期452-456,共5页 武汉大学学报(自然科学英文版)
基金 Supported by the National Natural Science Foundation of China (61063041) the Program for New Century Excellent Talents in Fujian Province University (JK2010047) the Open Funds of State Key Laboratory of Information Security (01-01-1)
关键词 pseudorandom sequences discrete logarithms elliptic curves character sums pseudorandom sequences discrete logarithms elliptic curves character sums
  • 相关文献

参考文献17

  • 1Shparlinski I E. Pseudorandom number generators from elliptic curves[C]//Recent Trends in Cryptography, Contem- porary Mathematics. New York: American Mathematical Society, 2009: 121-141.
  • 2Enge A. Elliptic Curves and Their Applications to Cryptogra phy: An Introduction[M]. Dordrecht: Kluwer Academic Publishers, 1999.
  • 3Chen Zhixiong. Elliptic curve analogue of Legendre sequences [J]. Monatsh Math, 2008, 154(1): 1-10.
  • 4Chen Zhixiong, Li Shengqiang, Xiao Guozhen. Construction of pseudo-random binary sequences from elliptic curves by using discrete logarithmiC]// Proc of Sequences and Their Applications, SETA'06 (LNCS 4086). Berlin: Springer-Verlag, 2006: 285-294.
  • 5Mauduit C, Sarkozy A. On finite pseudorandom sequences of k symbols[J]. Indagationes Mathernaticae--New Series, 2002, 13(1): 89-101.
  • 6Ahlswede R, Mauduit C, Sakozy A. Large families of pseudorandom sequences of k symbols and their complexity, Part I [C]// General Theory of Information Transfer and Combinatorics (LNCS 4123). Berlin: Springer-Verlag, 2006: 293- 307.
  • 7Ahlswede R, Mauduit C, Sakozy A. Large families of pseudorandom sequences of k symbols and their complexity, Part II [C]//General Theory of Information Transfer and Combin torics (LNCS 4123). Berlin: Springer-Verlag, 2006: 308- 325.
  • 8Mauduit C, Sarkozy A. On finite pseudorandom binary sequences I : Measures of pseudorandomness, the Legendre symbol [J]. Acta Arithmetica, 1997, 82: 365-377.
  • 9Goubin L, Mauduit C, Sarkozy A. Construction of large families of pseudorandom binary sequences[J]. Journal of Number Theory, 2004, 106(1): 56-69.
  • 10Beelen P H T, Doumen J M. Pseudorandom sequences from elliptic curves[C]//Proceedings of Finite Fields with Applications to Coding Theory, Cryptography and Related Areas. Berlin: Springer-Verlag, 2002: 37-52.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部