Information assurance and secure streaming algorithm based on cubic roots of integers
Document Type
Conference Proceeding
Publication Date
5-27-2008
Abstract
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. © 2008 IEEE.
Identifier
44049098074 (Scopus)
ISBN
[0769530990, 9780769530994]
Publication Title
Proceedings International Conference on Information Technology New Generations Itng 2008
External Full Text Location
https://doi.org/10.1109/ITNG.2008.267
First Page
910
Last Page
915
Recommended Citation
Verkhovsky, Boris S., "Information assurance and secure streaming algorithm based on cubic roots of integers" (2008). Faculty Publications. 12796.
https://digitalcommons.njit.edu/fac_pubs/12796
