Hidden Polynomial(s) Cryptosystems

Simple item page
dc.creatorToli, Ilia
dc.date2003-02-26
dc.date2003-03-29
dc.date.accessioned2026-07-07T03:19:29Z
dc.date.available2026-07-07T03:19:29Z
dc.descriptionWe 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.
dc.description17 pages
dc.identifierhttps://arxiv.org/abs/cs/0302037
dc.identifierhttp://arxiv.org/abs/cs/0302037
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31480
dc.subjectCryptography and Security
dc.subjectSymbolic Computation
dc.subjectE.3
dc.titleHidden Polynomial(s) Cryptosystems
dc.typetext

Files

Collections

arXiv