Zongduo Dai

According to our database, Zongduo Dai authored at least 43 papers between 1985 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

Trace Representation and Linear Complexity of Binary eth Power Residue Sequences of Period p.

Zongduo Dai, Guang Gong, Hong-Yeop Song, Dingfeng Ye

IEEE Trans. Inf. Theory, 2011

2009

A trace representation of binary Jacobi sequences.

Zongduo Dai, Guang Gong, Hong-Yeop Song

Discret. Math., 2009

2008

Levels of multi-continued fraction expansion of multi-formal Laurent series.

Zongduo Dai, Ping Wang

Finite Fields Their Appl., 2008

2007

On optimal simultaneous rational approximation to (omega, omega²)^tau with omega being some kind of cubic algebraic function.

Quanlong Wang, Kunpeng Wang, Zongduo Dai

J. Approx. Theory, 2007

Classification and counting on multi-continued fractions and its application to multi-sequences.

Zongduo Dai, Xiutao Feng

Sci. China Ser. F Inf. Sci., 2007

2006

Multi-continued fraction algorithm and generalized B-M algorithm over F_q.

Zongduo Dai, Junhui Yang

Finite Fields Their Appl., 2006

Implementation of Multi-continued Fraction Algorithm and Application to Multi-sequence Linear Synthesis.

Quanlong Wang, Kunpeng Wang, Zongduo Dai

Proceedings of the Sequences and Their Applications, 2006

Multi-Continued Fraction Algorithms and Their Applications to Sequences.

Zongduo Dai

Proceedings of the Sequences and Their Applications, 2006

2005

Multi-sequences with <i>d</i>-perfect property.

Xiutao Feng, Quanlong Wang, Zongduo Dai

J. Complex., 2005

2004

Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences.

Zongduo Dai, Shaoquan Jiang, Kyoki Imamura, Guang Gong

IEEE Trans. Inf. Theory, 2004

Multi-sequences with d-perfect property.

Xiutao Feng, Quanlong Wang, Zongduo Dai

IACR Cryptol. ePrint Arch., 2004

Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences.

Xiutao Feng, Zongduo Dai

Proceedings of the Sequences and Their Applications, 2004

Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences.

Zongduo Dai, Kyoki Imamura, Junhui Yang

Proceedings of the Sequences and Their Applications, 2004

Multi-continued Fraction Algorithm and Generalized B-M Algorithm over F₂.

Zongduo Dai, Xiutao Feng, Junhui Yang

Proceedings of the Sequences and Their Applications, 2004

Multisequences with d-perfect property.

Xiutao Feng, Quanlong Wang, Zongduo Dai

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Asymptotic behavior of normalized linear complexity of ultimately non-periodic binary sequences.

Zongduo Dai, Shaoquan Jiang, Kyoki Imamura, Guang Gong

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

On Linear Complexity of Kronecker Sequences.

Quanlong Wang, Lei Hu, Zongduo Dai

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

2002

On interleaved sequences over finite fields.

Shaoquan Jiang, Zongduo Dai, Guang Gong

Discret. Math., 2002

Cryptanalysis on AW digital signature scheme based on error-correcting codes.

Zhenfeng Zhang, Dengguo Feng, Zongduo Dai

Sci. China Ser. F Inf. Sci., 2002

2001

Decomposing Attacks on Asymmetric Cryptography Based on Mapping Compositions.

Dingfeng Ye, Zongduo Dai, Kwok-Yan Lam

J. Cryptol., 2001

On the Linear Complexity of Generalised Legendre Sequence.

Zongduo Dai, Junhui Yang, Guang Gong, Ping Wang

Proceedings of the Sequences and their Applications, 2001

Attacks on Two Digital Signature Schemes Based on Error Correcting Codes.

Dingfeng Ye, Junhui Yang, Zongduo Dai, Haiwen Ou

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.

Shaoquan Jiang, Zongduo Dai, Kyoki Imamura

IEEE Trans. Inf. Theory, 2000

Enumeration and criteria for cyclically shift-distinct GMW sequences.

Guang Gong, Zong-Duo Dai, Solomon W. Golomb

IEEE Trans. Inf. Theory, 2000

Cyclic inequivalence of cascaded GMW-sequences.

Solomon W. Golomb, Guang Gong, Zong-Duo Dai

Discret. Math., 2000

1999

Generating all linear orthomorphisms without repetition.

Zongduo Dai, Solomon W. Golomb, Guang Gong

Discret. Math., 1999

Cryptanalysis of "2 R" Schemes.

Dingfeng Ye, Kwok-Yan Lam, Zong-Duo Dai

Proceedings of the Advances in Cryptology, 1999

1998

Linear Complexity for One-Symbol Substitution of a Periodic Sequence over GF(q).

Zong-Duo Dai, Kyoki Imamura

IEEE Trans. Inf. Theory, 1998

Notes on q-ary Interleaved Sequences.

Shaoquan Jiang, Zongduo Dai, Guang Gong

Proceedings of the Sequences and their Applications, 1998

Weak Invertibiity of Finite Automata and Cryptanalysis on FAPKC.

Zong-Duo Dai, Dingfeng Ye, Kwok-Yan Lam

Proceedings of the Advances in Cryptology, 1998

1994

Some Cryptographic Properties of Exponential Functions.

Xingong Chang, Zong-Duo Dai, Guang Gong

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.

Zongduo Dai, Xuning Feng, Mulan Liu, Zhe-xian Wan

Discret. Math., 1993

1992

Binary Sequences Derived from ML-Sequences over Rings, I: Periods of Minimal Polynomials.

Zong-Duo Dai

J. Cryptol., 1992

Construction of m-ary de Bruijn Sequences (Extendet abstract).

Jun-Hui Yang, Zong-Duo Dai

Proceedings of the Advances in Cryptology, 1992

1991

Linear Complexity of Periodically Repeated Random Sequences.

Zong-Duo Dai, Jun-Hui Yang

Proceedings of the Advances in Cryptology, 1991

On Binary Sequences from Recursions modulo 2^e Made Non-Linear by the Bit-by-Bit XOR Function.

William G. Chambers, Zong-Duo Dai

Proceedings of the Advances in Cryptology, 1991

The Data Base of Selected Permutations (Extended Abstract).

Jun-Hui Yang, Zong-Duo Dai, Kencheng Zeng

Proceedings of the Advances in Cryptology, 1991

1990

Lower Bounds for the Linear Complexity of Sequences over Residue Rings.

Zong-Duo Dai, Thomas Beth, Dieter Gollmann

Proceedings of the Advances in Cryptology, 1990

Continued Fractions and the Berlekamp-Massey Algorithm.

Zong-Duo Dai, Kencheng Zeng

Proceedings of the Advances in Cryptology, 1990

1989

Feedforward Functions Defined By de Bruijn Sequences.

Zong-Duo Dai, Kencheng Zeng

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.

Thomas Beth, Zong-Duo Dai

Proceedings of the Advances in Cryptology, 1989

1986

Proof of Rueppel's linear complexity conjecture.

Zong-Duo Dai

IEEE Trans. Inf. Theory, 1986

1985

On Feedforward Transforms and p-Fold Periodic p-Arrays.

Dong-sheng Chen, Zong-Duo Dai

Proceedings of the Advances in Cryptology, 1985