Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZongduo Dai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2011
[j20]Zongduo Dai, Guang Gong, Hong-Yeop Song, Dingfeng Ye:
Trace Representation and Linear Complexity of Binary eth Power Residue Sequences of Period p. IEEE Trans. Inf. Theory 57(3): 1530-1547 (2011)- 2009
- [j19]Zongduo Dai, Guang Gong, Hong-Yeop Song:
A trace representation of binary Jacobi sequences. Discret. Math. 309(6): 1517-1527 (2009) - 2008
- [j18]Zongduo Dai, Ping Wang:
Levels of multi-continued fraction expansion of multi-formal Laurent series. Finite Fields Their Appl. 14(2): 438-455 (2008) - 2007
- [j17]Zongduo Dai, Xiutao Feng:
Classification and counting on multi-continued fractions and its application to multi-sequences. Sci. China Ser. F Inf. Sci. 50(3): 351-358 (2007) - [j16]Quanlong Wang, Kunpeng Wang, Zongduo Dai:
On optimal simultaneous rational approximation to (omega, omega2)tau with omega being some kind of cubic algebraic function. J. Approx. Theory 148(2): 194-210 (2007) - 2006
- [j15]Zongduo Dai, Junhui Yang:
Multi-continued fraction algorithm and generalized B-M algorithm over Fq. Finite Fields Their Appl. 12(3): 379-402 (2006) - 2005
- [j14]Xiutao Feng, Quanlong Wang, Zongduo Dai:
Multi-sequences with d-perfect property. J. Complex. 21(2): 230-242 (2005) - 2004
- [j13]Zongduo Dai, Shaoquan Jiang, Kyoki Imamura, Guang Gong:
Asymptotic Behavior of Normalized Linear Complexity of Ultimately Nonperiodic Binary Sequences. IEEE Trans. Inf. Theory 50(11): 2911-2915 (2004) - 2003
- [j12]Quanlong Wang, Lei Hu, Zongduo Dai:
On Linear Complexity of Kronecker Sequences. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(11): 2853-2859 (2003) - 2002
- [j11]Zhenfeng Zhang, Dengguo Feng, Zongduo Dai:
Cryptanalysis on AW digital signature scheme based on error-correcting codes. Sci. China Ser. F Inf. Sci. 45(5): 397-400 (2002) - [j10]Shaoquan Jiang, Zongduo Dai, Guang Gong:
On interleaved sequences over finite fields. Discret. Math. 252(1-3): 161-178 (2002) - 2001
- [j9]Dingfeng Ye, Zongduo Dai, Kwok-Yan Lam:
Decomposing Attacks on Asymmetric Cryptography Based on Mapping Compositions. J. Cryptol. 14(2): 137-150 (2001) - 2000
- [j8]Solomon W. Golomb, Guang Gong, Zong-Duo Dai:
Cyclic inequivalence of cascaded GMW-sequences. Discret. Math. 219(1-3): 279-285 (2000) - [j7]Guang Gong
, Zong-Duo Dai, Solomon W. Golomb:
Enumeration and criteria for cyclically shift-distinct GMW sequences. IEEE Trans. Inf. Theory 46(2): 474-484 (2000) - [j6]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 Trans. Inf. Theory 46(3): 1174-1177 (2000) - 1999
- [j5]Zongduo Dai, Solomon W. Golomb, Guang Gong:
Generating all linear orthomorphisms without repetition. Discret. Math. 205(1-3): 47-55 (1999) - 1998
- [j4]Zong-Duo Dai, Kyoki Imamura:
Linear Complexity for One-Symbol Substitution of a Periodic Sequence over GF(q). IEEE Trans. Inf. Theory 44(3): 1328-1331 (1998) - 1993
- [j3]Zongduo Dai, Xuning Feng, Mulan Liu, Zhe-xian Wan:
Nonlinear feedforward sequences of m-sequences I. Discret. Math. 123(1-3): 17-34 (1993) - 1992
- [j2]Zong-Duo Dai:
Binary Sequences Derived from ML-Sequences over Rings, I: Periods of Minimal Polynomials. J. Cryptol. 5(3): 193-207 (1992) - 1986
- [j1]Zong-Duo Dai:
Proof of Rueppel's linear complexity conjecture. IEEE Trans. Inf. Theory 32(3): 440-443 (1986)
Conference and Workshop Papers
- 2006
- [c22]Zongduo Dai:
Multi-Continued Fraction Algorithms and Their Applications to Sequences. SETA 2006: 17-33 - [c21]Quanlong Wang, Kunpeng Wang, Zongduo Dai:
Implementation of Multi-continued Fraction Algorithm and Application to Multi-sequence Linear Synthesis. SETA 2006: 248-258 - 2004
- [c20]Xiutao Feng, Quanlong Wang, Zongduo Dai:
Multisequences with d-perfect property. ISIT 2004: 86 - [c19]Zongduo Dai, Shaoquan Jiang, Kyoki Imamura, Guang Gong:
Asymptotic behavior of normalized linear complexity of ultimately non-periodic binary sequences. ISIT 2004: 123 - [c18]Xiutao Feng, Zongduo Dai:
Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences. SETA 2004: 113-128 - [c17]Zongduo Dai, Kyoki Imamura, Junhui Yang:
Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences. SETA 2004: 129-142 - [c16]Zongduo Dai, Xiutao Feng, Junhui Yang:
Multi-continued Fraction Algorithm and Generalized B-M Algorithm over F2. SETA 2004: 339-354 - 2001
- [c15]Dingfeng Ye, Junhui Yang, Zongduo Dai, Haiwen Ou:
Attacks on Two Digital Signature Schemes Based on Error Correcting Codes. ICICS 2001: 84-89 - [c14]Zongduo Dai, Junhui Yang, Guang Gong, Ping Wang:
On the Linear Complexity of Generalised Legendre Sequence. SETA 2001: 145-153 - 1999
- [c13]Dingfeng Ye, Kwok-Yan Lam, Zong-Duo Dai:
Cryptanalysis of "2 R" Schemes. CRYPTO 1999: 315-325 - 1998
- [c12]Zong-Duo Dai, Dingfeng Ye, Kwok-Yan Lam:
Weak Invertibiity of Finite Automata and Cryptanalysis on FAPKC. ASIACRYPT 1998: 227-241 - [c11]Shaoquan Jiang, Zongduo Dai, Guang Gong:
Notes on q-ary Interleaved Sequences. SETA 1998: 273-283 - 1994
- [c10]Xingong Chang, Zong-Duo Dai, Guang Gong:
Some Cryptographic Properties of Exponential Functions. ASIACRYPT 1994: 415-418 - 1992
- [c9]Jun-Hui Yang, Zong-Duo Dai:
Construction of m-ary de Bruijn Sequences (Extendet abstract). AUSCRYPT 1992: 357-363 - 1991
- [c8]Jun-Hui Yang, Zong-Duo Dai, Kencheng Zeng:
The Data Base of Selected Permutations (Extended Abstract). ASIACRYPT 1991: 73-81 - [c7]Zong-Duo Dai, Jun-Hui Yang:
Linear Complexity of Periodically Repeated Random Sequences. EUROCRYPT 1991: 168-175 - [c6]William 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
- [c5]Zong-Duo Dai, Kencheng Zeng:
Continued Fractions and the Berlekamp-Massey Algorithm. AUSCRYPT 1990: 24-31 - [c4]Zong-Duo Dai, Thomas Beth, Dieter Gollmann:
Lower Bounds for the Linear Complexity of Sequences over Residue Rings. EUROCRYPT 1990: 189-195 - 1989
- [c3]Thomas 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 - [c2]Zong-Duo Dai, Kencheng Zeng:
Feedforward Functions Defined By de Bruijn Sequences. EUROCRYPT 1989: 544-548 - 1985
- [c1]Dong-sheng Chen, Zong-Duo Dai:
On Feedforward Transforms and p-Fold Periodic p-Arrays. EUROCRYPT 1985: 130-134
Informal and Other Publications
- 2004
- [i1]Xiutao Feng, Quanlong Wang, Zongduo Dai:
Multi-sequences with d-perfect property. IACR Cryptol. ePrint Arch. 2004: 43 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
