Article citationsMore>>

H. Elkamchouchi, K. Elshenawy and H. Shaban, “Extended RSA Cryptosystem and Digital Signature Schemes in the Domain of Gaussian Integers,” The 8th International Conference on Communication Systems, Washington, 25-28 November 2002, pp. 91-95.

has been cited by the following article:

• TITLE: Cubic Root Extractors of Gaussian Integers and Their Application in Fast Encryption for Time-Constrained Secure Communication

  AUTHORS: Boris Verkhovsky

  KEYWORDS: Cryptographic Protocol, Secure Communication, Time-Constrained Encryption, Cubic Root Extractor, Gaussian Integers, Modular Arithmetic, Prefix/Suffix Positioning, Digital Isotope, Quadratic Residue, Jacoby Symbol

  JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.4 No.4, April 15, 2011

  ABSTRACT: There are settings where encryption must be performed by a sender under a time constraint. This paper de-scribes an encryption/decryption algorithm based on modular arithmetic of complex integers called Gaus-sians. It is shown how cubic extractors operate and how to find all cubic roots of the Gaussian. All validations (proofs) are provided in the Appendix. Detailed numeric illustrations explain how to use the method of digital isotopes to avoid ambiguity in recovery of the original plaintext by the receiver.