Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Multivariate_cryptography> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- Multivariate_cryptography abstract "Multivariate cryptography is the generic term for asymmetric cryptographic primitives based on multivariate polynomials over finite fields. In certain cases those polynomials could be defined over both a ground and an extension field. If the polynomials have the degree two, we talk about multivariate quadratics. Solving systems of multivariate polynomial equations is proven to be NP-Hard or NP-Complete. That's why those schemes are often considered to be good candidates for post-quantum cryptography, once quantum computers can break the current schemes. Today multivariate quadratics could be used only to build signatures. All attempts to build a secure encryption scheme have so far failed.".
- Multivariate_cryptography wikiPageExternalLink hfe.
- Multivariate_cryptography wikiPageID "16256805".
- Multivariate_cryptography wikiPageRevisionID "592210003".
- Multivariate_cryptography hasPhotoCollection Multivariate_cryptography.
- Multivariate_cryptography subject Category:Multivariate_cryptography.
- Multivariate_cryptography comment "Multivariate cryptography is the generic term for asymmetric cryptographic primitives based on multivariate polynomials over finite fields. In certain cases those polynomials could be defined over both a ground and an extension field. If the polynomials have the degree two, we talk about multivariate quadratics. Solving systems of multivariate polynomial equations is proven to be NP-Hard or NP-Complete.".
- Multivariate_cryptography label "Multivariate cryptography".
- Multivariate_cryptography sameAs m.03wf6ns.
- Multivariate_cryptography sameAs Q6935132.
- Multivariate_cryptography sameAs Q6935132.
- Multivariate_cryptography wasDerivedFrom Multivariate_cryptography?oldid=592210003.
- Multivariate_cryptography isPrimaryTopicOf Multivariate_cryptography.