Author(s)

Boris Verkhovsky

.

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.

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

B. Verkhovsky, "Cubic Root Extractors of Gaussian Integers and Their Application in Fast Encryption for Time-Constrained Secure Communication," International Journal of Communications, Network and System Sciences, Vol. 4 No. 4, 2011, pp. 197-204. doi: 10.4236/ijcns.2011.44024.