Hidden Polynomial(s) Cryptosystems

2003/04/09 by Ilia Toli, Toli, Ilia
Computer Science · #Cryptography and Security (cs.CR) #E.3 #FOS: Computer and information sciences #Symbolic Computation (cs.SC) #cs.CR #cs.SC

paper · pdf · doi:10.48550/arxiv.cs/0304013

arxiv created 2003/04/09 · arxiv updated 2009/11/30

Abstract

We propose public-key cryptosystems with public key a system of polynomial equations, algebraic or differential, and private key a single polynomial or a small-size ideal. We set up probabilistic encryption, signature, and signcryption protocols.

Related

• Hidden Polynomial(s) Cryptosystems
• Security of public key cryptosystems based on Chebyshev Polynomials
• Homomorphic Polynomial Public Key Cryptography for Quantum-secure Digital Signature
• A New Symmetric Homomorphic Functional Encryption over a Hidden Ring for Polynomial Public Key Encapsulations
• Breaking the Hidden Irreducible Polynomials Scheme