Skip to main content

2 Result(s)

within English Remove this filter Cryptology Remove this filter Operating Systems Remove this filter Guozhen **ng Remove this filter Chapter Remove this filter

and

  1. 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)

  2. 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)