Hybrid encryption/decryption technique using new public key and symmetric key algorithm

Author(s):  
Prakash Kuppuswamy ◽  
Saeed Q.Y. Al Khalidi
2015 ◽  
Vol 18 (3) ◽  
pp. 200-209
Author(s):  
Toan Van Nguyen ◽  
Dang Quoc Minh Do ◽  
Phuc Duc Nguyen ◽  
Thuan Huu Huynh ◽  
Thuc Dinh Nguyen

This paper presents the hardware design of a high performance cryptosystem for video streaming application. Our proposed system is the combination of two cryptographic algorithms, symmetric key algorithm and asymmetric key algorithm (also called public key algorithm) to take their benefits. The symmetric key algorithm (ZUC) is used to encrypt/decrypt video, and the public key algorithm (RSA) performs the encryption/ decryption for the secret key. This architecture has high performance, including high security and high processing bit rate. High security is achieved due to the ease of key distribution of the asymmetric key cryptosystem and the secret key can be easily changed. The high processing bit rate of video encryption/decryption is the result of the high speed of encryption/decryption of the symmetric key algorithm. The H.264 video decoder is also integrated into this system to test the functionality of the proposed cryptosystem. This system is implemented in Verilog-HDL, simulated by using the ModelSim simulator and evaluated by using Altera Stratix IV-based Development Kit. The speed of video decryption achieves up to 4.0 Gbps at the operating frequency of 125 MHz, which satisfies applications with high bandwidth requirement such as video streaming.


Symmetry ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 73 ◽  
Author(s):  
Borislav Stoyanov ◽  
Gyurhan Nedzhibov

In this paper, an improved encryption algorithm based on numerical methods and rotation–translation equation is proposed. We develop the new encryption-decryption algorithm by using the concept of symmetric key instead of public key. Symmetric key algorithms use the same key for both encryption and decryption. Most symmetric key encryption algorithms use either block ciphers or stream ciphers. Our goal in this work is to improve an existing encryption algorithm by using a faster convergent iterative method, providing secure convergence of the corresponding numerical scheme, and improved security by a using rotation–translation formula.


2016 ◽  
Vol 08 (04) ◽  
pp. 1650057 ◽  
Author(s):  
Pinkimani Goswami ◽  
Madan Mohan Singh ◽  
Bubu Bhuyan

In this paper, we propose a new public key scheme, which is a combination of RSA variant namely the DRSA and the generalization of generalized discrete logarithm problem (generalized GDLP). The security of this scheme depends equally on the integer factorization of [Formula: see text] and the discrete logarithm problem (DLP) on [Formula: see text], where [Formula: see text] is the product of two large primes and [Formula: see text] is the multiplicative group modulo [Formula: see text]. The scheme is a randomized algorithm. It is at least as secure as the DRSA and ElGamal schemes. We also compare the encryption–decryption performance of the proposed scheme with the RSA and DRSA schemes.


2011 ◽  
Vol 30 (6) ◽  
pp. 1450-1452 ◽  
Author(s):  
Zheng-tao Jiang ◽  
Jing-liang Zhang ◽  
Yu-min Wang

Author(s):  
Keith M. Martin

In this chapter, we introduce public-key encryption. We first consider the motivation behind the concept of public-key cryptography and introduce the hard problems on which popular public-key encryption schemes are based. We then discuss two of the best-known public-key cryptosystems, RSA and ElGamal. For each of these public-key cryptosystems, we discuss how to set up key pairs and perform basic encryption and decryption. We also identify the basis for security for each of these cryptosystems. We then compare RSA, ElGamal, and elliptic-curve variants of ElGamal from the perspectives of performance and security. Finally, we look at how public-key encryption is used in practice, focusing on the popular use of hybrid encryption.


2021 ◽  
Vol 1897 (1) ◽  
pp. 012045
Author(s):  
Karrar Taher R. Aljamaly ◽  
Ruma Kareem K. Ajeena

Electronics ◽  
2020 ◽  
Vol 9 (9) ◽  
pp. 1389
Author(s):  
Jiwon Lee ◽  
Jihye Kim ◽  
Hyunok Oh

In public key broadcast encryption, anyone can securely transmit a message to a group of receivers such that privileged users can decrypt it. The three important parameters of the broadcast encryption scheme are the length of the ciphertext, the size of private/public key, and the performance of encryption/decryption. It is suggested to decrease them as much as possible; however, it turns out that decreasing one increases the other in most schemes. This paper proposes a new broadcast encryption scheme for tiny Internet of Things (IoT) equipment (BESTIE), minimizing the private key size in each user. In the proposed scheme, the private key size is O(logn), the public key size is O(logn), the encryption time per subset is O(logn), the decryption time is O(logn), and the ciphertext text size is O(r), where n denotes the maximum number of users, and r indicates the number of revoked users. The proposed scheme is the first subset difference-based broadcast encryption scheme to reduce the private key size O(logn) without sacrificing the other parameters. We prove that our proposed scheme is secure under q-Simplified Multi-Exponent Bilinear Diffie-Hellman (q-SMEBDH) in the standard model.


Author(s):  
RANI SIROMONEY ◽  
K. G. SUBRAMANIAN ◽  
P. J. ABISHA

Language theoretic public key cryptosystems for strings and pictures are discussed. Two methods of constructing public key cryptosystems for the safe transmission or storage of chain code pictures are presented; the first one encrypts a chain code picture as a string and the second one as a two-dimensional array.


1989 ◽  
Vol 25 (1) ◽  
pp. 64-65
Author(s):  
V. Varadharajan

1990 ◽  
Vol 21 (1) ◽  
pp. 205-215
Author(s):  
SAAD M. KALlPHA ◽  
JAFAR WADI ABDUL SADA ◽  
HUSSAIN ALI HUSSAIN

Sign in / Sign up

Export Citation Format

Share Document