2019 10th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applicat 2019
DOI: 10.1109/idaacs.2019.8924431
|View full text |Cite
|
Sign up to set email alerts
|

A Design for a Cryptographically Secure Pseudo Random Number Generator

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 2 publications
0
2
0
Order By: Relevance
“…The mechanism used makes it difficult to predict the sequence of the generator even if the partial sequence or parameters are known or there is knowledge of the algorithm used in the transformation of the generators. Subsequently, other models have been proposed, as in, for example, [50], where a CSPRNG based on a hybrid methodology including chaotic additional input is defined; in [51], where a CSPRNG based on controlling the distribution of generated random numbers with the chaotic henon congruential generator is proposed; and in [52,53], where a CSPRNG based on the permutation of the internal state of the PRNG is proposed. The results are checked with Dieharder.…”
Section: Description Of Cryptographically Secure Pseudo-random Number...mentioning
confidence: 99%
“…The mechanism used makes it difficult to predict the sequence of the generator even if the partial sequence or parameters are known or there is knowledge of the algorithm used in the transformation of the generators. Subsequently, other models have been proposed, as in, for example, [50], where a CSPRNG based on a hybrid methodology including chaotic additional input is defined; in [51], where a CSPRNG based on controlling the distribution of generated random numbers with the chaotic henon congruential generator is proposed; and in [52,53], where a CSPRNG based on the permutation of the internal state of the PRNG is proposed. The results are checked with Dieharder.…”
Section: Description Of Cryptographically Secure Pseudo-random Number...mentioning
confidence: 99%
“…As already stated in Section VI-B and thanks to Assumption A.7, this operation leverages a cryptographically secure PRNG. The fundamental properties of such a PRNG are its resistance to both the next-bit test [64] and the state compromise extension [65]. These properties prevent the attacker from being able to acquire any advantage in breaking the shuffling operation and obtaining a clear connection between the original message (containing the smart camera seed) and the digest.…”
Section: Sp2 -Resistance To Package Correlation Attacksmentioning
confidence: 99%