Trace representation of binary sequences derived from Euler quotients

DOI10.16783/J.CNKI.NWNUZ.2017.01.004MaRDI QIDQ5277272zbMATH OpenFDO

Authors Xiaoni Du, Zhixia Li, Yunqi Wan, Xiaodan Li

Publication date 14 July 2017

Full work available at URL https://doi.org/10.16783/J.CNKI.NWNUZ.2017.01.004

zbMATH Keywords

binary sequencesEuler quotientsFermat quotientslinear complexitytrace representation

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• Trace representation of pseudorandom binary sequences derived from Euler quotients
• Trace representation of r-ary sequences derived from Euler quotients with prime-power modulus
• Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients
• Trace representation and linear complexity of binary sequences derived from Fermat quotients
• Linear complexity of binary sequences derived from Euler quotients with prime-power modulus

Cited in

(6)

• Trace representation and linear complexity of binary sequences derived from Fermat quotients
• Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients
• Trace representation of r-ary sequences derived from Euler quotients with prime-power modulus
• Trace representation of Legendre sequences of Mersenne prime period
• Trace Representation and Linear Complexity of Binary eth Power Residue Sequences of Period p
• Trace representation of pseudorandom binary sequences derived from Euler quotients

This page was built for publication: Trace representation of binary sequences derived from Euler quotients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5277272)