0 The Diophantine equation X^(2p)-Dy^2=1Let D be a positive integer which is square free,and p be a prime.In 1966,Ljunggren showed that if p=2 and D=q is a prime,then the Diophantine equationx^(2p)-Dy^2=1(1)has only p...0 The Diophantine equation X^(2p)-Dy^2=1Let D be a positive integer which is square free,and p be a prime.In 1966,Ljunggren showed that if p=2 and D=q is a prime,then the Diophantine equationx^(2p)-Dy^2=1(1)has only positive integer solutions(q,x,y)=(5,3,4),(29,99,1820).In 1979,KoChao and Sun Qi showed that if p=2 and D=2q,then Eq.(1)has no positive inte-展开更多
We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotie...We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotients modulo an odd prime p.If 2 is a primitive element modulo p2,the linear complexity equals to p2-p or p2-1,which is very close to the period and it is large enough for cryptographic purpose.展开更多
文摘0 The Diophantine equation X^(2p)-Dy^2=1Let D be a positive integer which is square free,and p be a prime.In 1966,Ljunggren showed that if p=2 and D=q is a prime,then the Diophantine equationx^(2p)-Dy^2=1(1)has only positive integer solutions(q,x,y)=(5,3,4),(29,99,1820).In 1979,KoChao and Sun Qi showed that if p=2 and D=2q,then Eq.(1)has no positive inte-
基金the National Natural Science Foundation of China，the Open Funds of State Key Laboratory of Information Security (Chinese Academy of Sciences)，the Program for New Century Excellent Talents in Fujian Province University
文摘We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotients modulo an odd prime p.If 2 is a primitive element modulo p2,the linear complexity equals to p2-p or p2-1,which is very close to the period and it is large enough for cryptographic purpose.
