Guozhen Xiao
According to our database1,
Guozhen Xiao authored at least 54 papers
between 1991 and 2016.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2016
2015
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015
2013
Divisible difference sets, relative difference sets and sequences with ideal autocorrelation.
Inf. Sci., 2013
Frontiers Comput. Sci., 2013
2012
The global avalanche characteristics of two Boolean functions and algebraic immunity.
Int. J. Comput. Math., 2012
2011
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011
Construction of almost optimal resilient Boolean functions via concatenating Maiorana-McFarland functions.
Sci. China Inf. Sci., 2011
2010
On the global avalanche characteristics between two Boolean functions and the higher order nonlinearity.
Inf. Sci., 2010
2009
Linear complexity of binary Whiteman generalized cyclotomic sequences of order 2<sup>k</sup>.
Inf. Sci., 2009
Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables
CoRR, 2009
Proceedings of the 2009 International Conference on Computational Intelligence and Security, 2009
2008
Cryptographic properties of some binary generalized cyclotomic sequences with the length p<sup>2</sup>.
Inf. Sci., 2008
Inf. Sci., 2008
Inf. Sci., 2008
Trace Representations and Multi-rate Constructions of Two Classes of Generalized Cyclotomic Sequences.
Int. J. Netw. Secur., 2008
Int. J. Netw. Secur., 2008
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008
On the linear complexity of generalized cyclotomic sequences with the period p<sup>m</sup>.
Appl. Math. Lett., 2008
Proceedings of the Provable Security, Second International Conference, 2008
2007
Autocorrelation Values of New Generalized Cyclotomic Sequences of Order Two and Length <i>pq</i>.
J. Comput. Sci. Technol., 2007
Efficient elliptic curve scalar multiplication algorithms resistant to power analysis.
Inf. Sci., 2007
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007
On the Randomness of Generalized Cyclotomic Sequences of Order Two and Length <i>pq</i>.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007
IEEE Commun. Lett., 2007
IACR Cryptol. ePrint Arch., 2007
Proceedings of the Arithmetic of Finite Fields, First International Workshop, 2007
Proceedings of the Information Security and Cryptology, Third SKLOIS Conference, 2007
2006
Construction of Pseudo-random Binary Sequences from Elliptic Curves by Using Discrete Logarithm.
Proceedings of the Sequences and Their Applications, 2006
2005
IEEE Trans. Inf. Theory, 2005
Analysis of the Linear Complexity and Its Stability for 2<i>p<sup>n</sup></i>-Periodic Binary Sequences.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005
Appl. Math. Comput., 2005
Proceedings of the Information Security and Cryptology, First SKLOIS Conference, 2005
2004
IACR Cryptol. ePrint Arch., 2004
Sci. China Ser. F Inf. Sci., 2004
Appl. Math. Comput., 2004
2003
2002
A fast algorithm for determining the minimal polynomial where of a sequence with period 2p<sup>n</sup> over GF(q).
IEEE Trans. Inf. Theory, 2002
Proceedings of the Progress in Cryptology, 2002
2001
A fast algorithm for determining the linear complexity of a binary sequence with period 2<sup>n</sup>p<sup>m</sup>.
Sci. China Ser. F Inf. Sci., 2001
2000
A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q).
IEEE Trans. Inf. Theory, 2000
Proceedings of the Information Security and Privacy, 5th Australasian Conference, 2000
1999
ACM SIGOPS Oper. Syst. Rev., 1999
1991
Lecture Notes in Computer Science 561, Springer, ISBN: 3-540-54973-0, 1991