2011
Trace Representation and Linear Complexity of Binary eth Power Residue Sequences of Period p.
IEEE Trans. Inf. Theory, 2011
2009
A trace representation of binary Jacobi sequences.
Discret. Math., 2009
2008
Levels of multi-continued fraction expansion of multi-formal Laurent series.
Finite Fields Their Appl., 2008
2007
On optimal simultaneous rational approximation to (omega, omega<sup>2</sup>)<sup>tau</sup> with omega being some kind of cubic algebraic function.
J. Approx. Theory, 2007
Classification and counting on multi-continued fractions and its application to multi-sequences.
Sci. China Ser. F Inf. Sci., 2007
2006
Multi-continued fraction algorithm and generalized B-M algorithm over F<sub>q</sub>.
Finite Fields Their Appl., 2006
Implementation of Multi-continued Fraction Algorithm and Application to Multi-sequence Linear Synthesis.
Proceedings of the Sequences and Their Applications, 2006
Multi-Continued Fraction Algorithms and Their Applications to Sequences.
Proceedings of the Sequences and Their Applications, 2006
2005
Multi-sequences with <i>d</i>-perfect property.
J. Complex., 2005
2004
Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences.
IEEE Trans. Inf. Theory, 2004
Multi-sequences with d-perfect property.
IACR Cryptol. ePrint Arch., 2004
Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences.
Proceedings of the Sequences and Their Applications, 2004
Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences.
Proceedings of the Sequences and Their Applications, 2004
Multi-continued Fraction Algorithm and Generalized B-M Algorithm over F<sub>2</sub>.
Proceedings of the Sequences and Their Applications, 2004
Multisequences with d-perfect property.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004
Asymptotic behavior of normalized linear complexity of ultimately non-periodic binary sequences.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004
2003
On Linear Complexity of Kronecker Sequences.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003
2002
On interleaved sequences over finite fields.
Discret. Math., 2002
Cryptanalysis on AW digital signature scheme based on error-correcting codes.
Sci. China Ser. F Inf. Sci., 2002
2001
Decomposing Attacks on Asymmetric Cryptography Based on Mapping Compositions.
J. Cryptol., 2001
On the Linear Complexity of Generalised Legendre Sequence.
Proceedings of the Sequences and their Applications, 2001
Attacks on Two Digital Signature Schemes Based on Error Correcting Codes.
Proceedings of the Information and Communications Security, Third International Conference, 2001
2000
Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting kappa; symbols within one period.
IEEE Trans. Inf. Theory, 2000
Enumeration and criteria for cyclically shift-distinct GMW sequences.
IEEE Trans. Inf. Theory, 2000
Cyclic inequivalence of cascaded GMW-sequences.
Discret. Math., 2000
1999
Generating all linear orthomorphisms without repetition.
Discret. Math., 1999
Cryptanalysis of "2 R" Schemes.
Proceedings of the Advances in Cryptology, 1999
1998
Linear Complexity for One-Symbol Substitution of a Periodic Sequence over GF(q).
IEEE Trans. Inf. Theory, 1998
Notes on q-ary Interleaved Sequences.
Proceedings of the Sequences and their Applications, 1998
Weak Invertibiity of Finite Automata and Cryptanalysis on FAPKC.
Proceedings of the Advances in Cryptology, 1998
1994
Some Cryptographic Properties of Exponential Functions.
Proceedings of the Advances in Cryptology - ASIACRYPT '94, 4th International Conference on the Theory and Applications of Cryptology, Wollongong, Australia, November 28, 1994
1993
Nonlinear feedforward sequences of m-sequences I.
Discret. Math., 1993
1992
Binary Sequences Derived from ML-Sequences over Rings, I: Periods of Minimal Polynomials.
J. Cryptol., 1992
Construction of m-ary de Bruijn Sequences (Extendet abstract).
Proceedings of the Advances in Cryptology, 1992
1991
Linear Complexity of Periodically Repeated Random Sequences.
Proceedings of the Advances in Cryptology, 1991
On Binary Sequences from Recursions modulo 2<sup>e</sup> Made Non-Linear by the Bit-by-Bit XOR Function.
Proceedings of the Advances in Cryptology, 1991
The Data Base of Selected Permutations (Extended Abstract).
Proceedings of the Advances in Cryptology, 1991
1990
Lower Bounds for the Linear Complexity of Sequences over Residue Rings.
Proceedings of the Advances in Cryptology, 1990
Continued Fractions and the Berlekamp-Massey Algorithm.
Proceedings of the Advances in Cryptology, 1990
1989
Feedforward Functions Defined By de Bruijn Sequences.
Proceedings of the Advances in Cryptology, 1989
On the Complexity of Pseudo-Random Sequences - Or: If You Can Describe a Sequence It Can't be Random.
Proceedings of the Advances in Cryptology, 1989
1986
Proof of Rueppel's linear complexity conjecture.
IEEE Trans. Inf. Theory, 1986
1985
On Feedforward Transforms and p-Fold Periodic p-Arrays.
Proceedings of the Advances in Cryptology, 1985