An improvement of a cryptanalysis algorithm
O. Benamara, F. Merazka

TL;DR
This paper demonstrates that using improved pseudo-random number generators can significantly enhance the accuracy of a statistical cryptanalysis algorithm through experimental analysis.
Contribution
It introduces the idea that better pseudo-random generators can improve cryptanalysis effectiveness, supported by experimental evidence.
Findings
Enhanced pseudo-random generators increase cryptanalysis accuracy
Experimental results confirm the benefit of improved generators
Better generators lead to more effective cryptanalysis
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsChaos-based Image/Signal Encryption · Algorithms and Data Compression · Fractal and DNA sequence analysis
