2020
DOI: 10.1007/s11416-020-00360-0
|View full text |Cite
|
Sign up to set email alerts
|

Finding distinguishers for pseudorandom number generators based on permutations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 3 publications
0
1
0
Order By: Relevance
“…As we have seen the value δ(s) is very small. In this case, a more rigorous treatment [6] shows that the number of restarts required to distinguish the two generators is estimated as P C (s+1)+P I (s+1) (P C (s+1)−P I (s+1)) 2 . This value is P C (s+1)+P I (s+1) δ(s)…”
Section: Security Discussionmentioning
confidence: 99%
“…As we have seen the value δ(s) is very small. In this case, a more rigorous treatment [6] shows that the number of restarts required to distinguish the two generators is estimated as P C (s+1)+P I (s+1) (P C (s+1)−P I (s+1)) 2 . This value is P C (s+1)+P I (s+1) δ(s)…”
Section: Security Discussionmentioning
confidence: 99%