"Cubic Root Extractors of Gaussian Integers and Their Application in Fast Encryption for Time-Constrained Secure Communication"
written by Boris Verkhovsky,
published by International Journal of Communications, Network and System Sciences, Vol.4 No.4, 2011
has been cited by the following article(s):
  • Google Scholar
  • CrossRef
[1] Modification of Traditional RSA into Symmetric-RSA Cryptosystems
International Journal of Business Data Communications and Networking (IJBDCN), 2017
[2] A novice cryptosystem based on n th root of Gaussian integers
2017
[3] A novice cryptosystem based on nth root of Gaussian integers
2017
[4] SwiftEnc: Hybrid Cryptosystem with Hash-Based Dynamic Key Encryption
2015
[5] Integer Algorithms in Cryptology and Information Assurance
World Scientific Publishing, 2015
[6] A Modified Variant of RSA Algorithm for Gaussian Integers
Proceedings of the Second International Conference on Soft Computing for Problem Solving (SocProS 2012), December 28-30, 2012, 2014
[7] The Quartic Public Key Transformation
arXiv preprint arXiv:1304.4273, 2013
[8] Generalized Public Key Transformations with Side Information
arXiv preprint arXiv:1304.4651, 2013
[9] Double-Moduli Gaussian Encryption/Decryption with Primary Residues and Secret Controls
Int'l J. of Communications, Network and System Sciences, 2011
[10] Protection of Sensitive Messages Based on Quadratic Roots of Gaussians: Groups with Complex Modulus
Int'l J. of Communications, Network and System Sciences, 2011
[11] Information Protection Based on Extraction of Square Roots of Gaussian Integers
Int'l J. of Communications, Network and System Sciences, 2011