Guozhen Xiao

According to our database1, Guozhen Xiao authored at least 54 papers between 1991 and 2016.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2016
New developments in q-polynomial codes.
Cryptogr. Commun., 2016

2015
Multi-Rate Representation of Generalized Cyclotomic Sequences of Any Odd Period.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

2013
Divisible difference sets, relative difference sets and sequences with ideal autocorrelation.
Inf. Sci., 2013

The autocorrelation distribution of balanced Boolean function.
Frontiers Comput. Sci., 2013

2012
The global avalanche characteristics of two Boolean functions and algebraic immunity.
Int. J. Comput. Math., 2012

2011
Construction of <i>d</i>-Form Sequences with Ideal Autocorrelation.
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

On the equal-weight symmetric Boolean functions.
Frontiers Comput. Sci. China, 2009

Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables
CoRR, 2009

Anonymous Communication in Wireless Mesh Network.
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

The linear complexity of new generalized cyclotomic binary sequences of order four.
Inf. Sci., 2008

Trace representation of some generalized cyclotomic sequences of length pq.
Inf. Sci., 2008

On the linear complexity of some new q.
Inf. Sci., 2008

Trace Representations and Multi-rate Constructions of Two Classes of Generalized Cyclotomic Sequences.
Int. J. Netw. Secur., 2008

General Group Oriented ID-based Cryptosystems with Chosen Plaintext Security.
Int. J. Netw. Secur., 2008

On the Linear Complexity of Some Ternary Sequences with Ideal Autocorrelation.
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

Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem.
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

Sequences related to Legendre/Jacobi sequences.
Inf. Sci., 2007

Autocorrelation and Linear Complexity of the New Generalized Cyclotomic Sequences.
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

Relation Between Parity-Check Matrixes and Cycles of Associated Tanner Graphs.
IEEE Commun. Lett., 2007

'Good' Pseudo-Random Binary Sequences from Elliptic Curves.
IACR Cryptol. ePrint Arch., 2007

On constructing disjoint linear codes.
Frontiers Comput. Sci. China, 2007

Symmetric-key cryptosystem with DNA technology.
Sci. China Ser. F Inf. Sci., 2007

Some Notes on <i>d</i> -Form Functions with Difference-Balanced Property.
Proceedings of the Arithmetic of Finite Fields, First International Workshop, 2007

Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves.
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
Linear complexity of new generalized cyclotomic sequences of order two of length pq.
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

The Stability of the Lattice Structure of Pseudorandom Number Sequences.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

On the Linear Complexity of Generalized Cyclotomic Sequences of Order Four Over Zpq.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Multi-Proxy Multi-Signcryption Scheme from Pairings
CoRR, 2005

Improvement of Tseng et al.'s authenticated encryption scheme with message linkages.
Appl. Math. Comput., 2005

A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences.
Proceedings of the Information Security and Cryptology, First SKLOIS Conference, 2005

2004
Generalized self-shrinking generator.
IEEE Trans. Inf. Theory, 2004

Forgery Attacks on Chang et al.'s signature scheme with message recovery.
IACR Cryptol. ePrint Arch., 2004

Stream cipher based on GSS sequences.
Sci. China Ser. F Inf. Sci., 2004

Pseudo-randomness of the fourth class of GSS sequences.
Sci. China Ser. F Inf. Sci., 2004

New multisignature scheme for specified group of verifiers.
Appl. Math. Comput., 2004

2003
Resilient functions over finite fields.
IEEE Trans. Inf. Theory, 2003

On the Randomness of the Editing Generator.
IACR Cryptol. ePrint Arch., 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

Fast Algorithms for Determining the Linear Complexity of Period Sequences.
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

On Multiplicative Secret Sharing Schemes.
Proceedings of the Information Security and Privacy, 5th Australasian Conference, 2000

1999
An Approach to the Formal Verification of the Two-Party Crypographic Protocols.
ACM SIGOPS Oper. Syst. Rev., 1999

1991
The Stability Theory of Stream Ciphers
Lecture Notes in Computer Science 561, Springer, ISBN: 3-540-54973-0, 1991


  Loading...