2003/02/26 by Ilia Toli, Toli, Ilia
Computer Science · #Coding theory and cryptography #Cryptography and Residue Arithmetic #Cryptography and Security (cs.CR) #E.3 #FOS: Computer and information sciences #Polynomial and algebraic computation #Symbolic Computation (cs.SC) #cs.CR #cs.SC
paper · pdf · doi:10.48550/arxiv.cs/0302037
17 pages
openalex publication_date 2003/02/26 · arxiv created 2003/03/29 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We propose variations of the class of hidden monomial cryptosystems in order to make it resistant to all known attacks. We use identities built upon a single bivariate polynomial equation with coefficients in a finite field. Indeed, it can be replaced by a ``small'' ideal, as well. Throughout, we set up probabilistic encryption protocols, too. The same ideas extend to digital signature algorithms, as well. Our schemes work as well on differential fields of positive characteristic, and elsewhere.