| Trace Representation And Linear Complexity Of Binary Eth Power Residue Sequences Of Period P | 0 | 0.34 | 2011 |
| A trace representation of binary Jacobi sequences | 10 | 0.77 | 2009 |
| Levels of multi-continued fraction expansion of multi-formal Laurent series | 0 | 0.34 | 2008 |
| Classification and counting on multi-continued fractions and its application to multi-sequences | 0 | 0.34 | 2007 |
| On optimal simultaneous rational approximation to (omega, omega2)tau with omega being some kind of cubic algebraic function | 0 | 0.34 | 2007 |
| Multi-continued fraction algorithm and generalized B--M algorithm over Fq | 4 | 0.49 | 2006 |
| Multi-continued fraction algorithms and their applications to sequences | 3 | 0.43 | 2006 |
| Implementation of multi-continued fraction algorithm and application to multi-sequence linear synthesis | 0 | 0.34 | 2006 |
| Multi-continued fraction algorithm and generalized B-M algorithm over F2 | 12 | 0.85 | 2004 |
| Multi-sequences with d-perfect property | 9 | 0.59 | 2004 |
| Multisequences with d-perfect property | 1 | 0.36 | 2004 |
| Expected value of the linear complexity of two-dimensional binary sequences | 13 | 0.87 | 2004 |
| Asymptotic behavior of normalized linear complexity of multi-sequences | 17 | 0.83 | 2004 |
| Asymptotic behavior of normalized linear complexity of ultimately nonperiodic binary sequences | 7 | 0.63 | 2004 |
| On Linear Complexity Of Kronecker Sequences | 1 | 0.39 | 2003 |
| On interleaved sequences over finite fields | 5 | 0.52 | 2002 |
| Cryptanalysis on AW digital signature scheme based on error-correcting codes. | 1 | 0.34 | 2002 |
| Attacks on Two Digital Signature Schemes Based on Error Correcting Codes | 2 | 0.63 | 2001 |
| Decomposing Attacks on Asymmetric Cryptography Based on Mapping Compositions. | 8 | 0.64 | 2001 |
| Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period | 9 | 0.78 | 2000 |
| Generating all linear orthomorphisms without repetition | 2 | 0.41 | 1999 |
| Cryptanalysis of ``2 R'' Schemes | 10 | 0.66 | 1999 |
| Weak Invertibiity of Finite Automata and Cryptanalysis on FAPKC | 4 | 0.57 | 1998 |
| Notes on q-ary interleaved sequences | 0 | 0.34 | 1998 |
| Linear complexity for one-symbol substitution of a periodic sequence over GF(q) | 9 | 1.47 | 1998 |
| Some Cryptographic Properties of Exponential Functions | 5 | 0.83 | 1994 |
| Nonlinear feedforward sequences of m-sequences, I | 3 | 1.72 | 1993 |
| Construction of m-ary de Bruijn Sequences (Extendet abstract) | 0 | 0.34 | 1992 |
| Binary sequences derived from ML-sequences over rings I: periods and minimal polynomials | 34 | 3.96 | 1992 |
| The Data Base of Selected Permutations (Extended Abstract) | 2 | 0.37 | 1991 |
| Linear complexity of periodically repeated random sequences | 10 | 0.77 | 1991 |
| Lower bounds for the linear complexity of sequences over residue rings | 18 | 2.22 | 1990 |
| On the complexity of pseudo-random sequences—or: if you can describe a sequence it can't be Random | 2 | 0.36 | 1989 |
| Feedforward functions defined by De Brujin sequences | 1 | 0.34 | 1989 |
| On feedforward transforms and p-fold periodic p-arrays | 1 | 0.34 | 1985 |
