Pseudo-randomness of discrete-log sequences from elliptic curves

被引：0
|
作者：
Chen, Zhixiong [1 ,2 ]
Zhang, Ning [3 ]
Xiao, Guozhen [3 ]
机构：
[1] Putian Univ, Dept Math, Putian 351100, Fujian, Peoples R China
[2] Fujian Normal Univ, Key Lab Network Secur & Cryptol, Fuzhou 350007, Peoples R China
[3] Xidian Univ, Minist Edu Key Lab Comp Network Informat Secur, Xian 710071, Peoples R China
来源：
INFORMATION SECURITY AND CRYPTOLOGY | 2008年 / 4990卷
基金：
中国国家自然科学基金;
关键词：
pseudo-random sequences; elliptic curves; discrete logarithm; character sums; discrepancy; linear complexity;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We investigate all tipper bound on the discrepancy and a lower bound on the linear complexity of a class of sequences, derived from elliptic curves by using discrete logarithm in this paper. The results indicate that these sequences may have 'nice' pseudo-random properties. The important tool in the proof is certain character sums estimate along elliptic curves. In addition, we apply linear recurrence relation over elliptic curves to output binary sequences with very interesting pseudo-random behavior.
引用
收藏
页码：231 / +
页数：3
相关论文
共 32 条
1234