The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Zong-Duo Dai: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Xingong Chang, Zong-Duo Dai, Guang Gong
    Some Cryptographic Properties of Exponential Functions. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1994, pp:415-418 [Conf]
  2. Zong-Duo Dai, Dingfeng Ye, Kwok-Yan Lam
    Weak Invertibiity of Finite Automata and Cryptanalysis on FAPKC. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1998, pp:227-241 [Conf]
  3. Zong-Duo Dai, Kencheng Zeng
    Continued Fractions and the Berlekamp-Massey Algorithm. [Citation Graph (0, 0)][DBLP]
    AUSCRYPT, 1990, pp:24-31 [Conf]
  4. Jun-Hui Yang, Zong-Duo Dai
    Construction of m-ary de Bruijn Sequences (Extendet abstract). [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1992, pp:357-363 [Conf]
  5. Jun-Hui Yang, Zong-Duo Dai, Kencheng Zeng
    The Data Base of Selected Permutations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1991, pp:73-81 [Conf]
  6. Dingfeng Ye, Kwok-Yan Lam, Zong-Duo Dai
    Cryptanalysis of ``2 R'' Schemes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1999, pp:315-325 [Conf]
  7. Thomas Beth, Zong-Duo Dai
    On the Complexity of Pseudo-Random Sequences - Or: If You Can Describe a Sequence It Can't be Random. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1989, pp:533-543 [Conf]
  8. William G. Chambers, Zong-Duo Dai
    On Binary Sequences from Recursions modulo 2e Made Non-Linear by the Bit-by-Bit XOR Function. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1991, pp:200-204 [Conf]
  9. Dong-sheng Chen, Zong-Duo Dai
    On Feedforward Transforms and p-Fold Periodic p-Arrays. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1985, pp:130-134 [Conf]
  10. Zong-Duo Dai, Thomas Beth, Dieter Gollmann
    Lower Bounds for the Linear Complexity of Sequences over Residue Rings. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:189-195 [Conf]
  11. Zong-Duo Dai, Jun-Hui Yang
    Linear Complexity of Periodically Repeated Random Sequences. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1991, pp:168-175 [Conf]
  12. Zong-Duo Dai, Kencheng Zeng
    Feedforward Functions Defined By de Bruijn Sequences. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1989, pp:544-548 [Conf]
  13. Solomon W. Golomb, Guang Gong, Zong-Duo Dai
    Cyclic inequivalence of cascaded GMW-sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:279-285 [Journal]
  14. Zong-Duo Dai
    Binary Sequences Derived from ML-Sequences over Rings, I: Periods of Minimal Polynomials. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1992, v:5, n:3, pp:193-207 [Journal]
  15. Zong-Duo Dai
    Proof of Rueppel's linear complexity conjecture. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:3, pp:440-0 [Journal]
  16. Zong-Duo Dai, Kyoki Imamura
    Linear Complexity for One-Symbol Substitution of a Periodic Sequence over GF(q). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:3, pp:1328-1331 [Journal]
  17. Guang Gong, Zong-Duo Dai, Solomon W. Golomb
    Enumeration and criteria for cyclically shift-distinct GMW sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:2, pp:474-484 [Journal]

Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002