2016
DOI: 10.1016/j.ipl.2015.08.002
|View full text |Cite
|
Sign up to set email alerts
|

An improvement of a cryptanalysis algorithm

Abstract: In this paper we present experiments in order to show how some pseudo random number generators can improve the effectiveness of a statistical cryptanalysis algorithm. We deduce mainly that a better generator enhance the accuracy of the cryptanalysis algorithm.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 4 publications
0
1
0
Order By: Relevance
“…Chaotic maps have a wide-range application areas in many disciplines including engineering, cryptography, statistics, physics, biology, art and philosophy (El-Hameed et al (2021); Benamara et al (2016); Strogatz (2015); Ruelle (1997); Banerjee et al (2012)). Specifically, the need for highly secure cryptosystems is always increasing because the information technologies are continuously developing and reaching more and more people everyday in various platforms (e.g., e-banking, IoT, e-purchasing, etc.).…”
Section: Introductionmentioning
confidence: 99%
“…Chaotic maps have a wide-range application areas in many disciplines including engineering, cryptography, statistics, physics, biology, art and philosophy (El-Hameed et al (2021); Benamara et al (2016); Strogatz (2015); Ruelle (1997); Banerjee et al (2012)). Specifically, the need for highly secure cryptosystems is always increasing because the information technologies are continuously developing and reaching more and more people everyday in various platforms (e.g., e-banking, IoT, e-purchasing, etc.).…”
Section: Introductionmentioning
confidence: 99%