|
Registro Completo |
|
Biblioteca(s): |
Embrapa Agricultura Digital. |
|
Data corrente: |
27/04/2017 |
|
Data da última atualização: |
07/01/2020 |
|
Tipo da produção científica: |
Artigo em Periódico Indexado |
|
Autoria: |
CASTRO, A. de. |
|
Afiliação: |
ALEXANDRE DE CASTRO, CNPTIA. |
|
Título: |
Quantum one-way permutation over the finite field of two elements. |
|
Ano de publicação: |
2017 |
|
Fonte/Imprenta: |
Quantum Information Processing, v. 16, n. 6, p. 1-18, June 2017. |
|
DOI: |
10.1007/s11128-017-1599-6 |
|
Idioma: |
Inglês |
|
Conteúdo: |
Here, we show that Levin?s one-way permutation is provably secure because its output values are four maximally entangled two-qubit states, and whose probability of factoring them approaches zero faster than the multiplicative inverse of any positive polynomial poly(x) over the Boolean ring of all subsets of x. Our results demonstrate through well-known theorems that existence of classical one-way functions implies existence of a universal quantum one-way permutation that cannot be inverted in subexponential time in the worst case. |
|
Palavras-Chave: |
Aleatoriedade; CHSH inequality; Controlled NOT gate; Criptografia; Cryptography; Negligible probability; Permutação unidirecional; Quantum one-way permutation; Randomness. |
|
Categoria do assunto: |
X Pesquisa, Tecnologia e Engenharia |
|
Marc: |
LEADER 01269naa a2200241 a 4500
001 2069018
005 2020-01-07
008 2017 bl uuuu u00u1 u #d
024 7 $a10.1007/s11128-017-1599-6$2DOI
100 1 $aCASTRO, A. de
245 $aQuantum one-way permutation over the finite field of two elements.$h[electronic resource]
260 $c2017
520 $aHere, we show that Levin?s one-way permutation is provably secure because its output values are four maximally entangled two-qubit states, and whose probability of factoring them approaches zero faster than the multiplicative inverse of any positive polynomial poly(x) over the Boolean ring of all subsets of x. Our results demonstrate through well-known theorems that existence of classical one-way functions implies existence of a universal quantum one-way permutation that cannot be inverted in subexponential time in the worst case.
653 $aAleatoriedade
653 $aCHSH inequality
653 $aControlled NOT gate
653 $aCriptografia
653 $aCryptography
653 $aNegligible probability
653 $aPermutação unidirecional
653 $aQuantum one-way permutation
653 $aRandomness
773 $tQuantum Information Processing$gv. 16, n. 6, p. 1-18, June 2017.
Download
Esconder MarcMostrar Marc Completo |
|
Registro original: |
Embrapa Agricultura Digital (CNPTIA) |
