An improvement of a cryptanalysis algorithm
From MaRDI portal
Publication:894480
DOI10.1016/J.IPL.2015.08.002zbMATH Open1346.94092arXiv1409.5287OpenAlexW1508037405MaRDI QIDQ894480FDOQ894480
Oualid Benamara, Fatiha Merazka, Kamel Betina
Publication date: 1 December 2015
Published in: Information Processing Letters (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1409.5287
Recommendations
- scientific article; zbMATH DE number 897206
- scientific article; zbMATH DE number 934075
- scientific article; zbMATH DE number 503240
- Experimental study of the efficiency of generators of pseudo-random numbers based on the RC5 and RC6 cryptographic algorithms
- Generating and testing cryptographically secure random numbers
Cites Work
- Handbook of Markov Chain Monte Carlo
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A First Look at Rigorous Probability Theory
- Uniform random number generation
- Decrypting classical cipher text using Markov chain Monte Carlo
- Some long-period random number generators using shifts and xors
Cited In (5)
Uses Software
This page was built for publication: An improvement of a cryptanalysis algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894480)