Algorithmic Support for Rabin Cryptosystem Implementation Based on Addition

This paper deals with algorithmic support for Rabin cryptosystem implementation based on addition without performing computationally expensive arithmetic operations. Due to this, there is a reduction in time and hardware complexity of the encryption and decryption processes. The proposed approach allows us to increase the amount of input data and the size of the keys in order to improve the security of the cryptosystem not affecting its efficiency. An example of Rabin cryptosystem implementation based on addition is given.

[1]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[2]  Avishek Adhikari,et al.  Introduction to Mathematical Cryptography , 2014 .

[3]  Tang Ming . Wei Lian. Si Tuo Lin Si,et al.  Cryptography and Network Security - Principles and Practice , 2015 .

[4]  Andrei Tchernykh,et al.  High Performance Parallel Computing in Residue Number System , 2018, Int. J. Comb. Optim. Probl. Informatics.

[5]  Mikolaj Karpinski,et al.  Advanced method of factorization of multi-bit numbers based on Fermat's theorem in the system of residual classes , 2016, 2016 16th International Conference on Control, Automation and Systems (ICCAS).

[6]  V.A. Andrijchuk,et al.  Modern Algorithms and Methods of the Person Biometric Identification , 2005, 2005 IEEE Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications.

[7]  Arpit Kumar Srivastava,et al.  The Rabin Cryptosystem & analysis in measure of Chinese Reminder Theorem , 2013 .

[8]  A. E. Okeyinka.  Computational Speeds Analysis of RSA and ElGamal Algorithms on Text Data , 2015 .

[9]  A. Amalraj,et al.  A SURVEY PAPER ON CRYPTOGRAPHY TECHNIQUES , 2016 .

[10]  Ruslan Shevchuk,et al.  Effective Algorithms for Finding the Remainder of Multi-Digit Numbers , 2019, 2019 9th International Conference on Advanced Computer Information Technologies (ACIT).

[11]  Ihor Yakymenko,et al.  Matrix algorithms of processing of the information flow in computer systems based on theoretical and numerical Krestenson's basis , 2010, 2010 International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science (TCSET).

[12]  J. Ludden,et al.  Principles and Practice , 1998, Community-based Learning and Social Movements.

[13]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[14]  Victor Shoup,et al.  A computational introduction to number theory and algebra , 2005 .

[15]  Andriy Melnyk,et al.  Rabin's modified method of encryption using various forms of system of residual classes , 2017, 2017 14th International Conference The Experience of Designing and Application of CAD Systems in Microelectronics (CADSM).

[16]  Mikolaj Karpinski,et al.  A Method for Decimal Number Recovery from its Residues Based on the Addition of the Product Modules , 2019, 2019 10th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS).

[17]  Huapeng Wu,et al.  Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis , 2002, IEEE Trans. Computers.

[18]  Shubhanand S. Hatkar,et al.  A Survey on Cryptography Techniques , 2016 .

[19]  J. Hoffstein,et al.  An introduction to mathematical cryptography , 2008 .

[20]  Zhengbing Hu,et al.  The Analysis and Investigation of Multiplicative Inverse Searching Methods in the Ring of Integers Modulo M , 2016 .

[21]  Ya. M. Nykolaichuk,et al.  Realization of Rsa cryptographic algorithm based on vector-module method of modular exponention , 2018, 2018 14th International Conference on Advanced Trends in Radioelecrtronics, Telecommunications and Computer Engineering (TCSET).

[22]  Song Y. Yan,et al.  Cryptanalytic attacks on RSA , 2007 .

[23]  Aleksandra Klos-Witkowska,et al.  Research of time characteristics of search methods of inverse element by the module , 2017, 2017 9th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS).