We adapt tag-variables and Buchberger reduction in order, given two elements, pg∈ R into an effective ring R, to express g as the evaluation of a polynomial f(X) ∈ R[X] at p, g= f(p). As a by-product, we present also an attack to a couple of Cryptographical protocols.
Why you cannot even hope to use Ore algebras in Cryptography / Ceria, Michela; Mora, Teo; Visconti, Andrea. - In: APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING. - ISSN 0938-1279. - STAMPA. - 32:3(2021), pp. 229-244. [10.1007/s00200-021-00493-9]
Why you cannot even hope to use Ore algebras in Cryptography
Michela Ceria;
2021-01-01
Abstract
We adapt tag-variables and Buchberger reduction in order, given two elements, pg∈ R into an effective ring R, to express g as the evaluation of a polynomial f(X) ∈ R[X] at p, g= f(p). As a by-product, we present also an attack to a couple of Cryptographical protocols.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
