IDEAS home Printed from https://ideas.repec.org/a/hin/jnlamp/8050934.html
   My bibliography  Save this article

Speech Encryption Algorithm Based on Nonorthogonal Quantum State with Hyperchaotic Keystreams

Author

Listed:
  • F. J. Farsana
  • K. Gopakumar

Abstract

With the advancement in modern computational technologies like cloud computing, there has been tremendous growth in the field of data processing and encryption technologies. In this contest there is an increasing demand for successful storage of the data in the encrypted domain to avoid the possibility of data breach in shared networks. In this paper, a novel approach for speech encryption algorithm based on quantum chaotic system is designed. In the proposed method, classical bits of the speech samples are initially encoded in nonorthogonal quantum state by the secret polarizing angle. In the quantum domain, encoded speech samples are subjected to bit-flip operation according to the Controlled–NOT gate followed by Hadamard transform. Complete superposition of the quantum state in both Hadamard and standard basis is achieved through Hadamard transform. Control bits for C-NOT gate as well as Hadamard gate are generated with a modified - hyperchaotic system. Secret nonorthogonal rotation angles and initial conditions of the hyperchaotic system are the keys used to ensure the security of the proposed algorithm. The computational complexity of the proposed algorithm has been analysed both in quantum domain and classical domain. Numerical simulation carried out based on the above principle showed that the proposed speech encryption algorithm has wider keyspace, higher key sensitivity and robust against various differential and statistical cryptographic attacks.

Suggested Citation

  • F. J. Farsana & K. Gopakumar, 2020. "Speech Encryption Algorithm Based on Nonorthogonal Quantum State with Hyperchaotic Keystreams," Advances in Mathematical Physics, Hindawi, vol. 2020, pages 1-12, January.
  • Handle: RePEc:hin:jnlamp:8050934
    DOI: 10.1155/2020/8050934
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/AMP/2020/8050934.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/AMP/2020/8050934.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/8050934?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlamp:8050934. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.