2010
DOI: 10.1109/tit.2009.2034782
|View full text |Cite
|
Sign up to set email alerts
|

Distribution Properties of Compressing Sequences Derived From Primitive Sequences Over $\BBZ /(p^{e})$

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
16
0
2

Year Published

2012
2012
2019
2019

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 16 publications
(18 citation statements)
references
References 14 publications
0
16
0
2
Order By: Relevance
“…First, since and , it follows from Condition 2) of Theorem 19 and Lemma 23 that there exist two positive integers and such that (17) and ( (19) Note that is also a typical primitive polynomial of degree over , and so by (2) (22) and (23) together with the fact that is an odd integer give a contradiction to the assumption that . If then (22) and (23) …”
Section: Lemma 23mentioning
confidence: 97%
See 1 more Smart Citation
“…First, since and , it follows from Condition 2) of Theorem 19 and Lemma 23 that there exist two positive integers and such that (17) and ( (19) Note that is also a typical primitive polynomial of degree over , and so by (2) (22) and (23) together with the fact that is an odd integer give a contradiction to the assumption that . If then (22) and (23) …”
Section: Lemma 23mentioning
confidence: 97%
“…Then is a sequence over and is called a compressing sequence derived from . When is a primitive sequence over , many cryptographical properties of such compressing sequence have been studied during the last 20 years [2]- [17], in particular the distinctness of compressing sequences, that is, if and only if , where and are two primitive sequences generated by a primitive polynomial over . Obviously, for a given primitive polynomial over , if the compressing sequences of all primitive sequences generated by are pairwise distinct, then there is a one-to-one correspondence between primitive sequences and their compressing sequences, which implies that every compressing sequence preserves all the information of its original primitive sequence.…”
Section: Introductionmentioning
confidence: 99%
“…Zhu and Qi [33,34] proved that a = b iff ϕ(a) and ϕ(b) are 0-uniform, i.e., under the compressing map x → x e−1 the distribution of 0 in the compressed sequence implies all information of the original sequence. Zheng and Qi [27,31] proved that for s ∈ F p and k ∈ F * p , under the compressing map x → x e−1 + η(x 0 , . .…”
Section: Introductionmentioning
confidence: 99%
“…Последовательность u n−1 изучалась многими авторами (см., например, работы [3]- [18]). Результаты этих исследований показали, что последователь-ность u n−1 , полученная из ЛРП u максимального периода над кольцом Z p n , пригодна для использования в качестве псевдослучайной последовательности.…”
unclassified
“…, a n−1 определены равенством (1). Такие отображения Ψ достаточ-но широко исследуются на пригодность в качестве функции усложнения (см., например, работы [6], [18] и цитированную в них литературу).…”
unclassified