PEA: Polymorphic Encryption Algorithm based on quantum computation
by Nikos Komninos, Georgios Mantas
International Journal of Systems, Control and Communications (IJSCC), Vol. 3, No. 1, 2011

Abstract: In this paper, a Polymorphic Encryption Algorithm (PEA), based on basic quantum computations, is proposed for the encryption of binary bits. PEA is a symmetric key encryption algorithm that applies different combinations of quantum gates to encrypt binary bits. PEA is also polymorphic since the states of the shared secret key control the different combinations of the ciphertext. It is shown that PEA achieves perfect secrecy and is resilient to eavesdropping and Trojan horse attacks. A security analysis of PEA is also described.

Online publication date: Tue, 31-Mar-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Systems, Control and Communications (IJSCC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com