Hidden Polynomial(s) Cryptosystems
Ilia Toli
Abstract
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.
Create a lesson
Related papers
Decision-Focused Learning for Cyber-Physical Risk-Aware Power Grid Operations
Ayesha Siddiqua Dina, Ebisa D. Wollega, Afzal Hossain Sohag
ToFu: Exploiting and Fuzzing the LLM-Orchestrator-Tool Trust Boundary
Md Nazmul Islam Ananto, Pierre Prevost-Avenel, Colin Smith et al.
APEX-Harm: Evaluating Agent Safety in Shared Professional Workspaces
Ziyi Yang, Adel Bibi, Guohao Li et al.
A Systematic Study of Security Enforcement at Android Inter-Component Boundaries
Sandiyo Christan A
EviRepair: Evidence-Driven Agents for Reliable Vulnerability Repair
Yilian Shi, Qingyu Liu, Tianyi Zhou et al.
Towards Safe World Models: Risks, Defenses, and Evaluation
Xiaoma Wang, Litian Zhang, Xinze Shi et al.