Correlation of the two-prime Sidel'nikov sequence
N Brandstätter, G Pirsic, A Winterhof - Designs, Codes and Cryptography, 2011 - Springer
N Brandstätter, G Pirsic, A Winterhof
Designs, Codes and Cryptography, 2011•SpringerMotivated by the concepts of Sidel'nikov sequences and two-prime generator (or Jacobi
sequences) we introduce and analyze some new binary sequences called two-prime
Sidel'nikov sequences. In the cases of twin primes and cousin primes equivalent 3 modulo 4
we show that these sequences are balanced. In the general case, besides balancedness we
also study the autocorrelation, the correlation measure of order k and the linear complexity
profile of these sequences showing that they have many nice pseudorandom features.
sequences) we introduce and analyze some new binary sequences called two-prime
Sidel'nikov sequences. In the cases of twin primes and cousin primes equivalent 3 modulo 4
we show that these sequences are balanced. In the general case, besides balancedness we
also study the autocorrelation, the correlation measure of order k and the linear complexity
profile of these sequences showing that they have many nice pseudorandom features.
Abstract
Motivated by the concepts of Sidel’nikov sequences and two-prime generator (or Jacobi sequences) we introduce and analyze some new binary sequences called two-prime Sidel’nikov sequences. In the cases of twin primes and cousin primes equivalent 3 modulo 4 we show that these sequences are balanced. In the general case, besides balancedness we also study the autocorrelation, the correlation measure of order k and the linear complexity profile of these sequences showing that they have many nice pseudorandom features.
Springer
Showing the best result for this search. See all results
