Information Assurance and Secure Streaming Algorithm Based on Cubic Roots of Integers

In this paper three communication issues are considered: 1) security 2) reliability and 3) streaming of information. For the security of communication a new public-key cryptography algorithm, based on extraction of cubic roots modulo composite n=pq, is described. The paper demonstrates how to intertwine both the security requirement and communication assurance into one algorithmic protocol. Several examples of reliability protocols are introduced and their efficiencies (probabilities of failure, bandwidth requirement per block of transmitted ciphertext and complexities of decryption per block of ciphertext) are analyzed and compared.