Accelerating asymmetric-key cryptography using Parallel-key Cryptographic Algorithm (PCA)

Teerakanok, Songpon; Kamolphiwong, Sinchai

doi:10.1109/ecticon.2009.5137170

Cited by 13 publications

(10 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here, we generate a random pattern whenever the PCA module is called. The pattern determines the order in which the blocks of data will be encrypted and decrypted -major and minor key [1]. It is this randomness which provides the enhanced protection and edge to PCA when compared to other algorithms.…”

Section: Random Patternmentioning

confidence: 99%

See 1 more Smart Citation

Parallel Key Encryption for CBC And Interleaved CBC

Ashokkumar¹,

Karuppasamy²,

Srinivasan³

et al. 2010

IJCA

View full text Add to dashboard Cite

Abstract-In current day scenario, the need to protect information has become very important and hence the need for cryptographic algorithms is high. Here, we extend the parallel key encryption algorithm and bring out its full potential by implementing the various cryptographic modes such as cipher block chaining and interleaved cipher block chaining where commendable increase in efficiency and reduction in encryption and decryption time can be seen. We have also considerably increased the key size by using 1024 bit and 2048 bit keys for the algorithmic implementation and in CBC and interleaved CBC execution. Our practical analysis has brought to front the salient features of the parallel key encryption algorithm and its ability to provide enhanced data protection when using a larger key size along with its randomness property. In theoretical analysis, it can be shown that remarkable reduction in encryption and decryption time of cryptographic systems is achieved and an enhanced strength to the system against brute force attacks is achieved. Furthermore, PCA can be extended for different cryptographic modes, using varying key size and number of keys used in the process.

show abstract

Section: Random Patternmentioning

confidence: 99%

“…Symmetric cryptography and Asymmetric cryptography are the two mechanisms of cryptography [1]- [9]. Parallel Key encryption is classified under the Asymmetric type as it makes use of two separate keys for encryption and decryption.…”

Section: Introductionmentioning

confidence: 99%

Parallel Key Encryption for CBC And Interleaved CBC

Ashokkumar¹,

Karuppasamy²,

Srinivasan³

et al. 2010

IJCA

View full text Add to dashboard Cite

show abstract

“…These complex algorithms cause delay to real time application. Public key algorithms not suitable for large mount of data due its slow performance [2][3].…”

Section: Introductionmentioning

confidence: 99%

Random encryption of speech signal

Mosa

Messiha

Zahran

2009

2009 International Conference on Computer Engineering &Amp; Systems

View full text Add to dashboard Cite

This paper presents an analog speech cryptosystem based on permutation and substitution of speech segments. Permutations processes and substitutions masks are variables which changed with changing the secret key. The main target of proposed system is to get non standard processes to decrease the complexity and diffusion of the system without affecting its security and depend on different security aspects like hidden block size and algorithm. We present a security analysis for the proposed cryptosystem against the brute-force and the statistical attacks from a strict cryptographic viewpoint. Experimental results verify and prove that the proposed speech cryptosystem is highly secure from the cryptographic viewpoint. It is shown that the permutations and substitutions induced by the new algorithm behave as typical random processes and can't be predicted without the knowledge of the secret key. The results prove that this proposed cryptosystem has a very powerful diffusion mechanism to its secret key and increases robust to noise.

show abstract

“…A large number of keys needs to be maintained in a large group. In contrast, the number of keys which needs to be maintained in a group is only 2n in asymmetric-key cryptography 2 . Among other existing asymmetric algorithms, the RSA algorithm is the most practical public key system 4 in use yet 5,6 because of its security and easy implementation.…”

Section: Introductionmentioning

confidence: 99%

“…Public key was invented mostly to solve the certain problem of secret key distribution 1,2 . While all of the application data transferred throughout the networking environments is ciphered with a secret key, secret key distribution is a tough job.…”

Section: Introductionmentioning

confidence: 99%

Numerical analysis of parallel modular exponentiation for RSA using interconnection networks

Damrudi

Ithnin²

2013

ScienceAsia

View full text Add to dashboard Cite

Security is important for transferring confidential information such as passwords through unreliable networks. The prominent way to overcome this issue is cryptographic algorithms. While a longer key consumes more time in cryptosystem operations for attackers, the RSA as a public key is more secure and uses a longer key. This paper focuses on the numerical analysis of using parallel processing as well as interconnection networks for RSA cryptographic algorithms to achieve suitable results in terms of speed. Numerical results are employed to show that the analysed approach is faster than accepted approach which is the binary method.

show abstract

Accelerating asymmetric-key cryptography using Parallel-key Cryptographic Algorithm (PCA)

Cited by 13 publications

References 5 publications

Parallel Key Encryption for CBC And Interleaved CBC

Parallel Key Encryption for CBC And Interleaved CBC

Random encryption of speech signal

Numerical analysis of parallel modular exponentiation for RSA using interconnection networks

Contact Info

Product

Resources

About