2021
DOI: 10.25046/aj060445
|View full text |Cite
|
Sign up to set email alerts
|

Quantum Secure Lightweight Cryptography with Quantum Permutation Pad

Abstract: Quantum logic gates represent certain quantum operations to perform quantum computations. Of those quantum gates, there is a category of classical behavior gates called quantum permutation gates. As a quantum algorithm, quantum permutation pad or QPP consists of multiple quantum permutation gates to be implemented both in a quantum computing system as a quantum circuit operating on n-qubits' states for transformations and in a classical computing system represented by a pad of n-bit permutation matrices. Since… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 36 publications
0
7
0
Order By: Relevance
“…The star symbols in Table III indicate these cases. QE Expansion in Table III shows less failure cases, that is because QPP itself has the whitening capability on the input data [27,28].…”
Section: A Randomness Testingmentioning
confidence: 99%
See 2 more Smart Citations
“…The star symbols in Table III indicate these cases. QE Expansion in Table III shows less failure cases, that is because QPP itself has the whitening capability on the input data [27,28].…”
Section: A Randomness Testingmentioning
confidence: 99%
“…QPP can be also used for entropy expansion [27] and pseudoquantum random number generation or pQRNG [28]. This can allow us to expand the true QE multiple times such as 10x as shown in Fig.…”
Section: B Qe/qk Distribution With Qe Expansionmentioning
confidence: 99%
See 1 more Smart Citation
“…Kuang et al reported their QPP implementations as a lightweight quantum safe block cipher [23] and streaming cipher [24], entropy transformation and expansion [25], pseudo quantum random number generation [27]. Kuang and Barbeau recently proposed a universal quantum safe cryptography with QPP [26] for potential quantum encrypted communications between two quantum computers and one quantum one classical computers over the existing internet or future quantum internet.…”
Section: Quantum Permutation Padmentioning
confidence: 99%
“…It is well-known that permutation transformations are bijective over computational basis, so the QPP encryption holds the property of Shannon perfect secrecy. The QPP encryption scheme has been applied to different cases recently in classical computing [23][24][25]. For an n-qubit computational basis, there exist a total of 2 n !…”
Section: Introductionmentioning
confidence: 99%