Annals of Computer Science and Information Systems, Volume 15

DOI: http://dx.doi.org/10.15439/2018F97

Citation: Proceedings of the 2018 Federated Conference on Computer Science and Information Systems, M. Ganzha, L. Maciaszek, M. Paprzycki (eds). ACSIS, Vol. 15, pages 603–606 (2018)

Full text

Abstract. This paper is devoted to the description of a new block cipher that will be applicable in the post-quantum era and will not need a lot of resources. The main advantages: probabilistic encryption, the cipher block chaining mode, the ability to transfer to distributed systems. All this combined with the use of PRNG, working on the Cremona transformations, has significantly increased the cryptographic strength and increased the scope of this encryption.

References

1. S Krendelev, N Zbitnev, D Shishlyannikov and D Gridin, “Block cipher based on modular arithmetic and methods of information compression” IOP Conf. Series: Journal of Physics: Conf. Series 913 (2017) 012009 https://doi.org/10.1088/1742-6596/913/1/012009
2. Vinogradov I M “Elements of Number Theory”, 5th ed Kravetz S, Dover, 1954
3. Nelson M 1995 “The Data Compression Book”, 2nd Edition IDG Books Worldwide Inc
4. Schneier B “Applied Cryptography Second Edition”, John Wiley & Sons Inc, 1996
5. S. Cantat “The Cremona group in two variables”, Proceedings of the sixth European Congress of Math., pp. 211–225, Europ. Math. Soc., 2013
6. S. Cantat “The Cremona Groups”, to appear in Proceedings of 2015