The distribution functions for the linear complexity of periodic sequences
Abstract Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given complexity measure value. In this paper, we mainly determine the distribut...
Ausführliche Beschreibung
Autor*in: |
Yang, Minghui [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2012 |
---|
Anmerkung: |
© Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg 2012 |
---|
Übergeordnetes Werk: |
Enthalten in: Journal of electronics (China) - Beijing : Science Pr., 1984, 29(2012), 3-4 vom: Juli, Seite 211-214 |
---|---|
Übergeordnetes Werk: |
volume:29 ; year:2012 ; number:3-4 ; month:07 ; pages:211-214 |
Links: |
---|
DOI / URN: |
10.1007/s11767-012-0825-8 |
---|
Katalog-ID: |
SPR022307613 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | SPR022307613 | ||
003 | DE-627 | ||
005 | 20230330073725.0 | ||
007 | cr uuu---uuuuu | ||
008 | 201006s2012 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1007/s11767-012-0825-8 |2 doi | |
035 | |a (DE-627)SPR022307613 | ||
035 | |a (SPR)s11767-012-0825-8-e | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
100 | 1 | |a Yang, Minghui |e verfasserin |4 aut | |
245 | 1 | 4 | |a The distribution functions for the linear complexity of periodic sequences |
264 | 1 | |c 2012 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
500 | |a © Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg 2012 | ||
520 | |a Abstract Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given complexity measure value. In this paper, we mainly determine the distribution function of sequences with period N =2nl = over Fq using Discrete Fourier Transform (DFT), where n and the characteristics of Fq are odd primes, gcd (n, q) = 1 and q is a primitive root modulo 2nl. The results presented can be used to study the randomness of periodic sequences and the analysis and design of stream cipher. | ||
700 | 1 | |a Zhu, Shixin |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Journal of electronics (China) |d Beijing : Science Pr., 1984 |g 29(2012), 3-4 vom: Juli, Seite 211-214 |w (DE-627)537443169 |w (DE-600)2376287-1 |x 1993-0615 |7 nnns |
773 | 1 | 8 | |g volume:29 |g year:2012 |g number:3-4 |g month:07 |g pages:211-214 |
856 | 4 | 0 | |u https://dx.doi.org/10.1007/s11767-012-0825-8 |z lizenzpflichtig |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_SPRINGER | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_31 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_60 | ||
912 | |a GBV_ILN_63 | ||
912 | |a GBV_ILN_65 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_73 | ||
912 | |a GBV_ILN_74 | ||
912 | |a GBV_ILN_90 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_110 | ||
912 | |a GBV_ILN_120 | ||
912 | |a GBV_ILN_150 | ||
912 | |a GBV_ILN_161 | ||
912 | |a GBV_ILN_213 | ||
912 | |a GBV_ILN_230 | ||
912 | |a GBV_ILN_285 | ||
912 | |a GBV_ILN_293 | ||
912 | |a GBV_ILN_370 | ||
912 | |a GBV_ILN_702 | ||
912 | |a GBV_ILN_2190 | ||
912 | |a GBV_ILN_4313 | ||
912 | |a GBV_ILN_4328 | ||
951 | |a AR | ||
952 | |d 29 |j 2012 |e 3-4 |c 07 |h 211-214 |
author_variant |
m y my s z sz |
---|---|
matchkey_str |
article:19930615:2012----::hdsrbtofntosoteieropeiyf |
hierarchy_sort_str |
2012 |
publishDate |
2012 |
allfields |
10.1007/s11767-012-0825-8 doi (DE-627)SPR022307613 (SPR)s11767-012-0825-8-e DE-627 ger DE-627 rakwb eng Yang, Minghui verfasserin aut The distribution functions for the linear complexity of periodic sequences 2012 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg 2012 Abstract Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given complexity measure value. In this paper, we mainly determine the distribution function of sequences with period N =2nl = over Fq using Discrete Fourier Transform (DFT), where n and the characteristics of Fq are odd primes, gcd (n, q) = 1 and q is a primitive root modulo 2nl. The results presented can be used to study the randomness of periodic sequences and the analysis and design of stream cipher. Zhu, Shixin aut Enthalten in Journal of electronics (China) Beijing : Science Pr., 1984 29(2012), 3-4 vom: Juli, Seite 211-214 (DE-627)537443169 (DE-600)2376287-1 1993-0615 nnns volume:29 year:2012 number:3-4 month:07 pages:211-214 https://dx.doi.org/10.1007/s11767-012-0825-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_63 GBV_ILN_65 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_110 GBV_ILN_120 GBV_ILN_150 GBV_ILN_161 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_702 GBV_ILN_2190 GBV_ILN_4313 GBV_ILN_4328 AR 29 2012 3-4 07 211-214 |
spelling |
10.1007/s11767-012-0825-8 doi (DE-627)SPR022307613 (SPR)s11767-012-0825-8-e DE-627 ger DE-627 rakwb eng Yang, Minghui verfasserin aut The distribution functions for the linear complexity of periodic sequences 2012 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg 2012 Abstract Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given complexity measure value. In this paper, we mainly determine the distribution function of sequences with period N =2nl = over Fq using Discrete Fourier Transform (DFT), where n and the characteristics of Fq are odd primes, gcd (n, q) = 1 and q is a primitive root modulo 2nl. The results presented can be used to study the randomness of periodic sequences and the analysis and design of stream cipher. Zhu, Shixin aut Enthalten in Journal of electronics (China) Beijing : Science Pr., 1984 29(2012), 3-4 vom: Juli, Seite 211-214 (DE-627)537443169 (DE-600)2376287-1 1993-0615 nnns volume:29 year:2012 number:3-4 month:07 pages:211-214 https://dx.doi.org/10.1007/s11767-012-0825-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_63 GBV_ILN_65 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_110 GBV_ILN_120 GBV_ILN_150 GBV_ILN_161 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_702 GBV_ILN_2190 GBV_ILN_4313 GBV_ILN_4328 AR 29 2012 3-4 07 211-214 |
allfields_unstemmed |
10.1007/s11767-012-0825-8 doi (DE-627)SPR022307613 (SPR)s11767-012-0825-8-e DE-627 ger DE-627 rakwb eng Yang, Minghui verfasserin aut The distribution functions for the linear complexity of periodic sequences 2012 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg 2012 Abstract Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given complexity measure value. In this paper, we mainly determine the distribution function of sequences with period N =2nl = over Fq using Discrete Fourier Transform (DFT), where n and the characteristics of Fq are odd primes, gcd (n, q) = 1 and q is a primitive root modulo 2nl. The results presented can be used to study the randomness of periodic sequences and the analysis and design of stream cipher. Zhu, Shixin aut Enthalten in Journal of electronics (China) Beijing : Science Pr., 1984 29(2012), 3-4 vom: Juli, Seite 211-214 (DE-627)537443169 (DE-600)2376287-1 1993-0615 nnns volume:29 year:2012 number:3-4 month:07 pages:211-214 https://dx.doi.org/10.1007/s11767-012-0825-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_63 GBV_ILN_65 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_110 GBV_ILN_120 GBV_ILN_150 GBV_ILN_161 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_702 GBV_ILN_2190 GBV_ILN_4313 GBV_ILN_4328 AR 29 2012 3-4 07 211-214 |
allfieldsGer |
10.1007/s11767-012-0825-8 doi (DE-627)SPR022307613 (SPR)s11767-012-0825-8-e DE-627 ger DE-627 rakwb eng Yang, Minghui verfasserin aut The distribution functions for the linear complexity of periodic sequences 2012 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg 2012 Abstract Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given complexity measure value. In this paper, we mainly determine the distribution function of sequences with period N =2nl = over Fq using Discrete Fourier Transform (DFT), where n and the characteristics of Fq are odd primes, gcd (n, q) = 1 and q is a primitive root modulo 2nl. The results presented can be used to study the randomness of periodic sequences and the analysis and design of stream cipher. Zhu, Shixin aut Enthalten in Journal of electronics (China) Beijing : Science Pr., 1984 29(2012), 3-4 vom: Juli, Seite 211-214 (DE-627)537443169 (DE-600)2376287-1 1993-0615 nnns volume:29 year:2012 number:3-4 month:07 pages:211-214 https://dx.doi.org/10.1007/s11767-012-0825-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_63 GBV_ILN_65 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_110 GBV_ILN_120 GBV_ILN_150 GBV_ILN_161 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_702 GBV_ILN_2190 GBV_ILN_4313 GBV_ILN_4328 AR 29 2012 3-4 07 211-214 |
allfieldsSound |
10.1007/s11767-012-0825-8 doi (DE-627)SPR022307613 (SPR)s11767-012-0825-8-e DE-627 ger DE-627 rakwb eng Yang, Minghui verfasserin aut The distribution functions for the linear complexity of periodic sequences 2012 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg 2012 Abstract Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given complexity measure value. In this paper, we mainly determine the distribution function of sequences with period N =2nl = over Fq using Discrete Fourier Transform (DFT), where n and the characteristics of Fq are odd primes, gcd (n, q) = 1 and q is a primitive root modulo 2nl. The results presented can be used to study the randomness of periodic sequences and the analysis and design of stream cipher. Zhu, Shixin aut Enthalten in Journal of electronics (China) Beijing : Science Pr., 1984 29(2012), 3-4 vom: Juli, Seite 211-214 (DE-627)537443169 (DE-600)2376287-1 1993-0615 nnns volume:29 year:2012 number:3-4 month:07 pages:211-214 https://dx.doi.org/10.1007/s11767-012-0825-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_63 GBV_ILN_65 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_110 GBV_ILN_120 GBV_ILN_150 GBV_ILN_161 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_702 GBV_ILN_2190 GBV_ILN_4313 GBV_ILN_4328 AR 29 2012 3-4 07 211-214 |
language |
English |
source |
Enthalten in Journal of electronics (China) 29(2012), 3-4 vom: Juli, Seite 211-214 volume:29 year:2012 number:3-4 month:07 pages:211-214 |
sourceStr |
Enthalten in Journal of electronics (China) 29(2012), 3-4 vom: Juli, Seite 211-214 volume:29 year:2012 number:3-4 month:07 pages:211-214 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
isfreeaccess_bool |
false |
container_title |
Journal of electronics (China) |
authorswithroles_txt_mv |
Yang, Minghui @@aut@@ Zhu, Shixin @@aut@@ |
publishDateDaySort_date |
2012-07-01T00:00:00Z |
hierarchy_top_id |
537443169 |
id |
SPR022307613 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR022307613</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230330073725.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201006s2012 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11767-012-0825-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR022307613</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s11767-012-0825-8-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Yang, Minghui</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The distribution functions for the linear complexity of periodic sequences</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2012</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg 2012</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given complexity measure value. In this paper, we mainly determine the distribution function of sequences with period N =2nl = over Fq using Discrete Fourier Transform (DFT), where n and the characteristics of Fq are odd primes, gcd (n, q) = 1 and q is a primitive root modulo 2nl. The results presented can be used to study the randomness of periodic sequences and the analysis and design of stream cipher.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhu, Shixin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of electronics (China)</subfield><subfield code="d">Beijing : Science Pr., 1984</subfield><subfield code="g">29(2012), 3-4 vom: Juli, Seite 211-214</subfield><subfield code="w">(DE-627)537443169</subfield><subfield code="w">(DE-600)2376287-1</subfield><subfield code="x">1993-0615</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:29</subfield><subfield code="g">year:2012</subfield><subfield code="g">number:3-4</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:211-214</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s11767-012-0825-8</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4328</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">29</subfield><subfield code="j">2012</subfield><subfield code="e">3-4</subfield><subfield code="c">07</subfield><subfield code="h">211-214</subfield></datafield></record></collection>
|
author |
Yang, Minghui |
spellingShingle |
Yang, Minghui The distribution functions for the linear complexity of periodic sequences |
authorStr |
Yang, Minghui |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)537443169 |
format |
electronic Article |
delete_txt_mv |
keep |
author_role |
aut aut |
collection |
springer |
remote_str |
true |
illustrated |
Not Illustrated |
issn |
1993-0615 |
topic_title |
The distribution functions for the linear complexity of periodic sequences |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
Journal of electronics (China) |
hierarchy_parent_id |
537443169 |
hierarchy_top_title |
Journal of electronics (China) |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)537443169 (DE-600)2376287-1 |
title |
The distribution functions for the linear complexity of periodic sequences |
ctrlnum |
(DE-627)SPR022307613 (SPR)s11767-012-0825-8-e |
title_full |
The distribution functions for the linear complexity of periodic sequences |
author_sort |
Yang, Minghui |
journal |
Journal of electronics (China) |
journalStr |
Journal of electronics (China) |
lang_code |
eng |
isOA_bool |
false |
recordtype |
marc |
publishDateSort |
2012 |
contenttype_str_mv |
txt |
container_start_page |
211 |
author_browse |
Yang, Minghui Zhu, Shixin |
container_volume |
29 |
format_se |
Elektronische Aufsätze |
author-letter |
Yang, Minghui |
doi_str_mv |
10.1007/s11767-012-0825-8 |
title_sort |
distribution functions for the linear complexity of periodic sequences |
title_auth |
The distribution functions for the linear complexity of periodic sequences |
abstract |
Abstract Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given complexity measure value. In this paper, we mainly determine the distribution function of sequences with period N =2nl = over Fq using Discrete Fourier Transform (DFT), where n and the characteristics of Fq are odd primes, gcd (n, q) = 1 and q is a primitive root modulo 2nl. The results presented can be used to study the randomness of periodic sequences and the analysis and design of stream cipher. © Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg 2012 |
abstractGer |
Abstract Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given complexity measure value. In this paper, we mainly determine the distribution function of sequences with period N =2nl = over Fq using Discrete Fourier Transform (DFT), where n and the characteristics of Fq are odd primes, gcd (n, q) = 1 and q is a primitive root modulo 2nl. The results presented can be used to study the randomness of periodic sequences and the analysis and design of stream cipher. © Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg 2012 |
abstract_unstemmed |
Abstract Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given complexity measure value. In this paper, we mainly determine the distribution function of sequences with period N =2nl = over Fq using Discrete Fourier Transform (DFT), where n and the characteristics of Fq are odd primes, gcd (n, q) = 1 and q is a primitive root modulo 2nl. The results presented can be used to study the randomness of periodic sequences and the analysis and design of stream cipher. © Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg 2012 |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_20 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_63 GBV_ILN_65 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_110 GBV_ILN_120 GBV_ILN_150 GBV_ILN_161 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_702 GBV_ILN_2190 GBV_ILN_4313 GBV_ILN_4328 |
container_issue |
3-4 |
title_short |
The distribution functions for the linear complexity of periodic sequences |
url |
https://dx.doi.org/10.1007/s11767-012-0825-8 |
remote_bool |
true |
author2 |
Zhu, Shixin |
author2Str |
Zhu, Shixin |
ppnlink |
537443169 |
mediatype_str_mv |
c |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1007/s11767-012-0825-8 |
up_date |
2024-07-04T02:37:25.666Z |
_version_ |
1803614311591968768 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR022307613</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230330073725.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201006s2012 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11767-012-0825-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR022307613</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s11767-012-0825-8-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Yang, Minghui</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The distribution functions for the linear complexity of periodic sequences</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2012</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg 2012</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given complexity measure value. In this paper, we mainly determine the distribution function of sequences with period N =2nl = over Fq using Discrete Fourier Transform (DFT), where n and the characteristics of Fq are odd primes, gcd (n, q) = 1 and q is a primitive root modulo 2nl. The results presented can be used to study the randomness of periodic sequences and the analysis and design of stream cipher.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhu, Shixin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of electronics (China)</subfield><subfield code="d">Beijing : Science Pr., 1984</subfield><subfield code="g">29(2012), 3-4 vom: Juli, Seite 211-214</subfield><subfield code="w">(DE-627)537443169</subfield><subfield code="w">(DE-600)2376287-1</subfield><subfield code="x">1993-0615</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:29</subfield><subfield code="g">year:2012</subfield><subfield code="g">number:3-4</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:211-214</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s11767-012-0825-8</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4328</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">29</subfield><subfield code="j">2012</subfield><subfield code="e">3-4</subfield><subfield code="c">07</subfield><subfield code="h">211-214</subfield></datafield></record></collection>
|
score |
7.397662 |