Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Post-quantum_cryptography> ?p ?o. }
Showing items 1 to 18 of
18
with 100 items per page.
- Post-quantum_cryptography abstract "Post-quantum cryptography refers to research on cryptographic primitives (usually public-key cryptosystems) that are not efficiently breakable using quantum computers more than classical computer architectures. This term came about because most currently popular public-key cryptosystems rely on the integer factorization problem or discrete logarithm problem, both of which would be easily solvable on large enough quantum computers using Shor's algorithm. Even though current publicly known experimental quantum computing is nowhere near powerful enough to attack real cryptosystems, many cryptographers are researching new algorithms in case quantum computing becomes a threat in the future. This work has been popularized by the PQCrypto conference series since 2006.In contrast, most current symmetric cryptographic systems (symmetric ciphers and hash functions) are secure from quantum computers. The quantum Grover's algorithm can speed up attacks against symmetric ciphers, but this can be counteracted by increasing key size. Thus post-quantum symmetric cryptography does not differ significantly from conventional symmetric cryptography.Post-quantum cryptography is also unrelated to quantum cryptography, which refers to using quantum phenomena to achieve secrecy.Currently post-quantum cryptography is mostly focused on five different approaches: Lattice-based cryptography such as NTRU, GGH, and (more recently) Ring-Learning with Errors based on Ideal Lattices Multivariate cryptography such as Unbalanced Oil and Vinegar Hash-based signatures such as Lamport signatures and Merkle signature scheme Code-based cryptography that relies on error-correcting codes, such as McEliece encryption and Niederreiter signatures Ellptic Curve Isogenies that rely on the complex mathematics of elliptic curves over finite fields ↑ ↑ 2.0 2.1 2.2 ↑ ↑ ↑ 5.0 5.1 ↑ ↑ ↑ ↑".
- Post-quantum_cryptography wikiPageExternalLink 20110920-ecc.pdf.
- Post-quantum_cryptography wikiPageExternalLink jao.pdf.
- Post-quantum_cryptography wikiPageExternalLink LCD_Vadim.pdf.
- Post-quantum_cryptography wikiPageExternalLink www.pqcrypto.org.
- Post-quantum_cryptography wikiPageExternalLink 978-3-540-88701-0.
- Post-quantum_cryptography wikiPageID "26605226".
- Post-quantum_cryptography wikiPageRevisionID "606720439".
- Post-quantum_cryptography hasPhotoCollection Post-quantum_cryptography.
- Post-quantum_cryptography comment "Post-quantum cryptography refers to research on cryptographic primitives (usually public-key cryptosystems) that are not efficiently breakable using quantum computers more than classical computer architectures. This term came about because most currently popular public-key cryptosystems rely on the integer factorization problem or discrete logarithm problem, both of which would be easily solvable on large enough quantum computers using Shor's algorithm.".
- Post-quantum_cryptography label "Post-Quanten-Kryptographie".
- Post-quantum_cryptography label "Post-quantum cryptography".
- Post-quantum_cryptography sameAs Post-Quanten-Kryptographie.
- Post-quantum_cryptography sameAs m.0bhc70l.
- Post-quantum_cryptography sameAs Q7233576.
- Post-quantum_cryptography sameAs Q7233576.
- Post-quantum_cryptography wasDerivedFrom Post-quantum_cryptography?oldid=606720439.
- Post-quantum_cryptography isPrimaryTopicOf Post-quantum_cryptography.