摘要
Two new families of finite binary sequences are constructed using multiplicative inverse. The sequences are shown to have strong pseudorandom properties by using some estimates of certain exponential sums over finite fields. The constructions can be implemented fast since multiplicative inverse over finite fields can be computed in polynomial time.
Two new families of finite binary sequences are constructed using multiplicative inverse. The sequences are shown to have strong pseudorandom properties by using some estimates of certain exponential sums over finite fields. The constructions can be implemented fast since multiplicative inverse over finite fields can be computed in polynomial time.
基金
Supported by the Open Funds of Key Lab of Fujian Province University Network Security and Cryptology (07B005)
the Funds of the Education Department of Fujian Province (JA07164)
the Natural Science Foundation of Fujian Province of China (2007F3086)
