Preprint Technical Note Version 1 Preserved in Portico This version is not peer-reviewed

The Oil and Vinegar Method

Version 1 : Received: 10 December 2020 / Approved: 13 December 2020 / Online: 13 December 2020 (21:31:13 CET)

How to cite: Buchanan, W. The Oil and Vinegar Method. Preprints 2020, 2020120300. Buchanan, W. The Oil and Vinegar Method. Preprints 2020, 2020120300.


Public key encryption methods are often used to create a digital signature, and where Bob has a public key and a private key. In order to prove his identity, he will encrypt something related to the message with his private key, and which can then be checked with his public key. The main current methods of public-key encryption include RSA and ECC (Elliptic Curve Cryptography), and which involve computationally difficult operations. But these operations have not been proven to be hard in an era of quantum computers. One well-known hard problem is the solving of quadratic equations with $m$ equations with $n$ variables. This is a known NP-hard problem, even in a world of quantum computers. These can be used as post-quantum signature schemes and which involve multivariate equations. In order to understand these methods, this paper outlines a simple example of implementing the oil and vinegar method, and where we have a number of unknown oil variables and a number of known vinegar variables, and where the vinegar variables help convert the hard problem into an easy one.


Post Quantum Cryptography, Oil and Vinegar


Computer Science and Mathematics, Computer Science

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0

Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.