论文信息 - An encryption algorithm

An encryption algorithm

In this paper, we will present an encryption algorithm using the decimal expansion of a computable absolutely normal Liouville number. We begin by an introduction of the Liouville numbers where we expose the originality, the history and also the strengths of using it. Then we give a complete description of an algorithm for encrypting a text. We produce a set of security tests that show its efficiency and its security level.

Anton Soloi | A. Soloi

[1] Santiago Figueira,et al. An example of a computable absolutely normal number , 2002, Theor. Comput. Sci..

[2] Cristian S. Calude. Information and Randomness: An Algorithmic Perspective , 1994 .

[3] Verónica Becher,et al. A computable absolutely normal Liouville number , 2015, Math. Comput..

[4] Cristian Claude,et al. Information and Randomness: An Algorithmic Perspective , 1994 .

[5] Y. Bugeaud. Nombres de Liouville et nombres normaux , 2002 .

[6] Per Martin-Löf,et al. The Definition of Random Sequences , 1966, Inf. Control..

[7] An Encryption Algorithm Based on the Decimal Expansion of Irrationals , 2012 .

[8] Gonzalo Alvarez,et al. Some Hints for the Design of Digital Chaos-Based Cryptosystems: Lessons Learned from Cryptanalysis , 2008, 0812.0765.

[9] W. Sierpinski,et al. Démonstration élémentaire du théorème de M. Borel sur les nombres absolument normaux et détermination effective d'une tel nombre , 1917 .