Jump to content

Multivariate cryptography

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Wk rub (talk | contribs) at 14:03, 12 March 2008 (Created page with ''''Multivariate Cryptography''' is the generic term for cryptographic primitives based on multivariate polynomials over finite fields. In certa...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Multivariate Cryptography is the generic term for cryptographic primitives based on multivariate polynomials over finite fields. In certain cases those polynomial could be defined over both a ground and an extension field. If the polynomials have the degree two we talk about multivariate quadratics. Cryptographic primitives based on multivariate polynomials are proven NP – complete. Thats why those scheme are the secure with post quantum computing coming.