Skip to main content

5 Result(s)

within English Remove this filter Algorithm Analysis and Problem Complexity Remove this filter Cryptology Remove this filter Guozhen **ng Remove this filter Conference Paper Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves

    We investigate an upper bound on the discrepancy and a lower bound on the linear complexity of a class of sequences, derived from elliptic curves by using discrete logarithm in this paper. The results indicate...

    Zhixiong Chen, Ning Zhang, Guozhen **ao in Information Security and Cryptology (2008)

  2. No Access

    Chapter and Conference Paper

    Some Notes on d-Form Functions with Difference-Balanced Property

    The relation between a cyclic relative difference set and a cyclic difference set is considered. Both the sets are with Singer parameters and can be constructed from a difference-balanced d-form function. Althoug...

    Tongjiang Yan, **aoni Du, Enjian Bai, Guozhen **ao in Arithmetic of Finite Fields (2007)

  3. No Access

    Chapter and Conference Paper

    Construction of Pseudo-random Binary Sequences from Elliptic Curves by Using Discrete Logarithm

    An upper bound is established for certain exponential sums with respect to multiplicative characters defined on the rational points of an elliptic curve over a prime field. The bound is applied to investigate ...

    Zhixiong Chen, Shengqiang Li, Guozhen **ao in Sequences and Their Applications – SETA 2006 (2006)

  4. No Access

    Chapter and Conference Paper

    A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences

    An efficient algorithm for determining the linear complexity and the minimal polynomial of sequence with period p m q ...

    Shimin Wei, Guolong Chen, Guozhen **ao in Information Security and Cryptology (2005)

  5. No Access

    Chapter and Conference Paper

    Fast Algorithms for Determining the Linear Complexity of Period Sequences

    We introduce a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period p n over GF(q) , where p is an odd prime, q is a prime and a primit...

    Guozhen **ao, Shimin Wei in Progress in Cryptology — INDOCRYPT 2002 (2002)