Abstract
A non-Feistel block cipher cryptosystem viz. recursive substitutions of bits on prime–nonprime detection of sub-stream (RSBPNDS) is proposed and its FPGA implementation is reported in this paper. RSBPNDS operates by dividing the plaintext into number of blocks with fixed block cipher. A generating function is applied on source block and a target block is received. Combining the entire target block, the cipher text is generated. Block sizes of n-bits, total prime numbers and nonprime numbers are calculated in the range 0 to (2n − 1). These prime-numbers and nonprime numbers are encoded with minimum number of bits, suppose the value of the block is 12 then there are six primes and six nonprimes, so number of minimum bits required to encode is three. Select each source block and calculate its value then map to prime number set and nonprime number set. The superiority of the proposed algorithm, in comparison to RSA, is validated by the results of non-homogeneity and avalanche tests.
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00542-017-3662-8/MediaObjects/542_2017_3662_Fig1_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00542-017-3662-8/MediaObjects/542_2017_3662_Fig2_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00542-017-3662-8/MediaObjects/542_2017_3662_Fig3_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00542-017-3662-8/MediaObjects/542_2017_3662_Fig4_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00542-017-3662-8/MediaObjects/542_2017_3662_Fig5_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00542-017-3662-8/MediaObjects/542_2017_3662_Fig6_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00542-017-3662-8/MediaObjects/542_2017_3662_Fig7_HTML.gif)
Similar content being viewed by others
References
Alese BK, Philemon ED, Falaki SO (2012) Comparative analysis of public-key encryption schemes. Int J Eng Technol 2(9):1552–1568
Bhasker J (2004) A VHDL primer. Pearson Education, India, pp 4–59
Datta A, Chakraborty R, Mandal JK (2015) The CRYPSTER: a private key crypto system. Proceedings of IEEE CGVIS, Bhubaneswar, India, 2–3 November 2015, pp 06–10. http://ieeexplore.ieee.org/document/7449882/. Accessed 03 Nov 2015
Dutta S (2005) An approach towards development of efficient encryption techniques. Ph. D. (science) thesis [unpublished], Department of Computer Science and Applications, University of North Bengal, India
Hatzivasilis G, Fysarakis K, Papaefstathiou I, Manifavas C (2017) A review of lightweight block ciphers. J Cryptogr Eng 1–40 https://springer.longhoe.net/article/10.1007/s13389-017-0160-y. Accessed 03 Nov 2015
Joseph Amalraj A, John Raybin Jose J (2016) A survey paper on cryptography techniques. IJCSMC 5(8):55–59. http://www.ijcsmc.com/docs/papers/August2016/V5I8201615.pdf. Accessed 03 Nov 2015
Kiran JS, Anusha M, Vijaykumar A, Kavya M (2016) Cryptography: the science of secure communication. IJCSNS Int J Comput Sci Netw Secur 16(4):129–134
Monika N, Deepak R (2017) Cryptography algorithms—the science of information security: review paper. Int J Innov Res Comput Commun Eng Chennai India 5(3):6226–6233
Stallings W (2005) Cryptography and network security: principle and practice, 4th edn. Pearson Education Asia, India, pp 6–90
Wolf W (2009) FPGA-based system design. Pearson Education, India, pp 1–50
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chakraborty, R., Mandal, J.K. An FPGA based non-feistel block cipher through recursive substitutions of bits on prime-nonprime detection of sub-stream (RSBPNDS). Microsyst Technol 25, 1679–1687 (2019). https://doi.org/10.1007/s00542-017-3662-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00542-017-3662-8