Implementation of stream cipher system based on representation of integers in Residue Number System

Aithal, Ganesh; Bhat, Krishnaraj; Sripathi, U.

doi:10.1109/iadcc.2010.5423007

Cited by 9 publications

(5 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Generated key sequences over the range [0,14] and [0,16] are applied in image encryption based on RNS stream cipher system. 43 In high resolution medical images, which have to be transferred securely, the proposed system can be used efficiently for encryption/decryption. In this approach, a composite integer m can be represented as a product of k relative prime integers.…”

Section: Application Of Proposed System In Image Encryption and Its Rmentioning

confidence: 99%

See 1 more Smart Citation

Generation of pseudo random number sequence from discrete oscillating samples of equally spread objects and application for stream cipher system

Sudeepa¹,

Aithal

2019

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

The demand on security privileged information has widely increased due to the sensitivity of the exchanged information over public communication channels. Nowadays, almost all organizations, mainly, business, financial, and government related areas, and also other regions are computerized, and sometimes, the data will be highly confidential. Since some areas dealing with confidential data, it is very much essential to provide the security for the data to avoid unauthorized access. Multimedia data security and security related issues have attracted many researchers towards it. Cryptography is necessary to protect the confidential information transmitting over the network. The strength of the cryptographic system, especially, stream cipher, is not only depending upon its encryption/decryption algorithm but also depends upon the randomness properties of the key sequence such as length, uniformity, independence, etc. In this work, a novel method of generating the pseudo random number that is based on the discrete equally spread oscillating points viewed orthogonally as an envelope has been considered for the generation. Depending on the number of samples, it is possible to get the higher length of the sequence. The random patterns generated by the discrete points of a moving wave are used to generate non binary random numbers. These numbers are used as key in stream cipher system. These are having greater advantages like one time padding to achieve perfect security in cryptographic application. The same non binary key sequence generated is applied for the cryptographic application, and the security parameters of the result obtained from cryptographic applications are also evaluated to observe the strength of security level. KEYWORDS discrete oscillating samples, Pseudo Random Number Generator, stream cipher system INTRODUCTIONData can be hacked during transmission through network channel. Hence, it is very essential to be transmitted in a secured manner. Cryptography is one of the major techniques to ensure security of data. Cryptography is a technique of transforming an original data into a particular form so that only those who know the key can read and process it. In cryptosystem, original message or data referred to as plain text. This could be transformed into non readable or scrambled form referred to as cipher text. This is done based on encryption algorithm. The encryption algorithm uses a key for changing the plain text into a cipher text. The cipher text can be recovered into its original form by an algorithm using a key known as decryption. The main goal of cryptography is data privacy (confidentiality), data authenticity, and data integrity (it cannot be modified in any way) in the digital world. Based on the type of key used for encryption/decryption, cryptography systems are categorized as symmetric key system and asymmetric key system. 1 The symmetric system can be categorized as stream and block cipher.Concurrency Computat Pract Exper. 2020;32:e5181. wileyonlinelibrary.com/journal/cpe Decryption Algor...

show abstract

Section: Application Of Proposed System In Image Encryption and Its Rmentioning

confidence: 99%

“…The security parameters considered for evaluation are the following. The result of the proposed system is compared with standard A5/1 system, 44 RNS cipher system, 43 and RNS cipher system with maximum length sequence. 19…”

Section: Security Parametersmentioning

confidence: 99%

Generation of pseudo random number sequence from discrete oscillating samples of equally spread objects and application for stream cipher system

Sudeepa¹,

Aithal

2019

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

show abstract

“… Obtain phony modulus using equation (11)  Sender encrypts the plain text (M) by using the key pairs (f, X ) C=M f mod X.…”

Section: A Proposed Algorithmmentioning

confidence: 99%

“…Find private key g using equation (10), hence got g=143/11=13. Equation (11) gives phony modulus X =3361. So public key (517,3361) shared to the sender by keeping private key (13,3361) secret.…”

Section: A Proposed Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Secure RSA Variant System to Avoid Factorization Attack using Phony Modules and Phony Public Key Exponent

Raghunandan¹,

Aithal²,

Shetty³

2019

IJITEE

Self Cite

View full text Add to dashboard Cite

In cryptography Public key cryptography plays a significant job in the field of data communication. Public key uses two distinctive keys where keys are related so those, the public key can use to encode the information and private key is utilized to decode. RSA is considered as one of the effective algorithm in public key cryptography. Effectiveness of RSA Algorithm for the most part relies upon how adequately public key segments is shared i.e. common modulus n and public key exponent e. If these components compromised by the hacker using mathematical attacks, acquiring private key becomes easier task for the intruder. This paper present an upgraded RSA algorithm which is used to avoid the limitations of Integer factorization attack by improving the complexity of factorization process by utilizing fake/phony public key exponent type f rather than e and phony modulus X rather than n. Paper also gives comparative analysis of the proposed work using standard metrics.

show abstract

Exponential Cipher Based on Residue Number System and Its Application to Image Security

Pujar

Poonja

Aithal

2020

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

Implementation of stream cipher system based on representation of integers in Residue Number System

Cited by 9 publications

References 22 publications

Generation of pseudo random number sequence from discrete oscillating samples of equally spread objects and application for stream cipher system

Generation of pseudo random number sequence from discrete oscillating samples of equally spread objects and application for stream cipher system

Secure RSA Variant System to Avoid Factorization Attack using Phony Modules and Phony Public Key Exponent

Exponential Cipher Based on Residue Number System and Its Application to Image Security

Contact Info

Product

Resources

About