dblp.uni-trier.dewww.uni-trier.de

Zongduo Dai

Zong-Duo Dai

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2007
32EEQuanlong Wang, Kunpeng Wang, Zongduo Dai: On optimal simultaneous rational approximation to (omega, omega2)tau with omega being some kind of cubic algebraic function. Journal of Approximation Theory 148(2): 194-210 (2007)
31EEZongduo Dai, Xiutao Feng: Classification and counting on multi-continued fractions and its application to multi-sequences. Science in China Series F: Information Sciences 50(3): 351-358 (2007)
2006
30EEZongduo Dai: Multi-Continued Fraction Algorithms and Their Applications to Sequences. SETA 2006: 17-33
29EEQuanlong Wang, Kunpeng Wang, Zongduo Dai: Implementation of Multi-continued Fraction Algorithm and Application to Multi-sequence Linear Synthesis. SETA 2006: 248-258
2005
28EEXiutao Feng, Quanlong Wang, Zongduo Dai: Multi-sequences with d-perfect property. J. Complexity 21(2): 230-242 (2005)
2004
27EEXiutao Feng, Zongduo Dai: Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences. SETA 2004: 113-128
26EEZongduo Dai, Kyoki Imamura, Junhui Yang: Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences. SETA 2004: 129-142
25EEZongduo Dai, Xiutao Feng, Junhui Yang: Multi-continued Fraction Algorithm and Generalized B-M Algorithm over F2. SETA 2004: 339-354
24 Zongduo Dai, Shaoquan Jiang, Kyoki Imamura, Guang Gong: Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences. IEEE Transactions on Information Theory 50(11): 2911-2915 (2004)
2002
23EEShaoquan Jiang, Zongduo Dai, Guang Gong: On interleaved sequences over finite fields. Discrete Mathematics 252(1-3): 161-178 (2002)
2001
22EEDingfeng Ye, Junhui Yang, Zongduo Dai, Haiwen Ou: Attacks on Two Digital Signature Schemes Based on Error Correcting Codes. ICICS 2001: 84-89
21EEDingfeng Ye, Zongduo Dai, Kwok-Yan Lam: Decomposing Attacks on Asymmetric Cryptography Based on Mapping Compositions. J. Cryptology 14(2): 137-150 (2001)
2000
20EESolomon W. Golomb, Guang Gong, Zong-Duo Dai: Cyclic inequivalence of cascaded GMW-sequences. Discrete Mathematics 219(1-3): 279-285 (2000)
19 Guang Gong, Zong-Duo Dai, Solomon W. Golomb: Enumeration and criteria for cyclically shift-distinct GMW sequences. IEEE Transactions on Information Theory 46(2): 474-484 (2000)
18 Shaoquan Jiang, Zongduo Dai, Kyoki Imamura: Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting kappa; symbols within one period. IEEE Transactions on Information Theory 46(3): 1174-1177 (2000)
1999
17EEDingfeng Ye, Kwok-Yan Lam, Zong-Duo Dai: Cryptanalysis of ``2 R'' Schemes. CRYPTO 1999: 315-325
16EEZongduo Dai, Solomon W. Golomb, Guang Gong: Generating all linear orthomorphisms without repetition. Discrete Mathematics 205(1-3): 47-55 (1999)
1998
15EEZong-Duo Dai, Dingfeng Ye, Kwok-Yan Lam: Weak Invertibiity of Finite Automata and Cryptanalysis on FAPKC. ASIACRYPT 1998: 227-241
14 Zong-Duo Dai, Kyoki Imamura: Linear Complexity for One-Symbol Substitution of a Periodic Sequence over GF(q). IEEE Transactions on Information Theory 44(3): 1328-1331 (1998)
1994
13 Xingong Chang, Zong-Duo Dai, Guang Gong: Some Cryptographic Properties of Exponential Functions. ASIACRYPT 1994: 415-418
1993
12EEZongduo Dai, Xuning Feng, Mulan Liu, Zhe-xian Wan: Nonlinear feedforward sequences of m-sequences I. Discrete Mathematics 123(1-3): 17-34 (1993)
1992
11 Jun-Hui Yang, Zong-Duo Dai: Construction of m-ary de Bruijn Sequences (Extendet abstract). AUSCRYPT 1992: 357-363
10 Zong-Duo Dai: Binary Sequences Derived from ML-Sequences over Rings, I: Periods of Minimal Polynomials. J. Cryptology 5(3): 193-207 (1992)
1991
9 Jun-Hui Yang, Zong-Duo Dai, Kencheng Zeng: The Data Base of Selected Permutations (Extended Abstract). ASIACRYPT 1991: 73-81
8EEZong-Duo Dai, Jun-Hui Yang: Linear Complexity of Periodically Repeated Random Sequences. EUROCRYPT 1991: 168-175
7EEWilliam G. Chambers, Zong-Duo Dai: On Binary Sequences from Recursions modulo 2e Made Non-Linear by the Bit-by-Bit XOR Function. EUROCRYPT 1991: 200-204
1990
6 Zong-Duo Dai, Kencheng Zeng: Continued Fractions and the Berlekamp-Massey Algorithm. AUSCRYPT 1990: 24-31
5EEZong-Duo Dai, Thomas Beth, Dieter Gollmann: Lower Bounds for the Linear Complexity of Sequences over Residue Rings. EUROCRYPT 1990: 189-195
1989
4EEThomas Beth, Zong-Duo Dai: On the Complexity of Pseudo-Random Sequences - Or: If You Can Describe a Sequence It Can't be Random. EUROCRYPT 1989: 533-543
3EEZong-Duo Dai, Kencheng Zeng: Feedforward Functions Defined By de Bruijn Sequences. EUROCRYPT 1989: 544-548
1986
2 Zong-Duo Dai: Proof of Rueppel's linear complexity conjecture. IEEE Transactions on Information Theory 32(3): 440- (1986)
1985
1EEDong-sheng Chen, Zong-Duo Dai: On Feedforward Transforms and p-Fold Periodic p-Arrays. EUROCRYPT 1985: 130-134

Coauthor Index

1Thomas Beth [4] [5]
2William G. Chambers [7]
3Xingong Chang [13]
4Dong-sheng Chen [1]
5Xiutao Feng [25] [27] [28] [31]
6Xuning Feng [12]
7Dieter Gollmann [5]
8Solomon W. Golomb [16] [19] [20]
9Guang Gong [13] [16] [19] [20] [23] [24]
10Kyoki Imamura [14] [18] [24] [26]
11Shaoquan Jiang [18] [23] [24]
12Kwok-Yan Lam [15] [17] [21]
13Mulan Liu [12]
14Haiwen Ou [22]
15Zhe-xian Wan [12]
16Kunpeng Wang [29] [32]
17Quanlong Wang [28] [29] [32]
18Jun-Hui Yang [8] [9] [11]
19Junhui Yang [22] [25] [26]
20Dingfeng Ye [15] [17] [21] [22]
21Kencheng Zeng [3] [6] [9]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)