Funder
National Key R&D Program of China
National Natural Science Foundation of China
Natural Science Foundation of Guangdong Province
Major Program of Guangdong Basic and Applied Research
the Open Fund of State Key Laboratory of Information Security
National Social Science Fund of China
Guangdong Basic and Applied Basic Research Foundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications
Reference33 articles.
1. Agoh, T., Dilcher, K., Skula, L.: Fermat quotients for composite moduli. J. Number Theory 66(1), 29–50 (1997)
2. Chen, Z.: Trace representation and linear complexity of binary sequences derived from Fermat quotients. Sci. China Inform. Sci. 57(11), 1–10 (2014)
3. Chen, Z.: Linear complexity and trace representation of quaternary sequences over $\mathbb {Z}_{4}$ based on generalized cyclotomic classes modulo pq. Cryptogr. Commun. 9(4), 445–458 (2017)
4. Chen, Z., Du, X.: On the linear complexity of binary threshold sequences derived from Fermat quotients. Des. Codes Crypt. 67(3), 317–323 (2013)
5. Chen, Z., Du, X., Marzouk, R.: Trace representation of pseudorandom binary sequences derived from Euler quotients. Appli. Alg. Eng. Commun. Comp. 26(6), 555–570 (2015)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献