A general construction for monoid-based knapsack protocols
Giacomo Micheli Michele Schiavina
Advances in Mathematics of Communications 2014, 8(3): 343-358 doi: 10.3934/amc.2014.8.343
We present a generalized version of the knapsack protocol proposed by D. Naccache and J. Stern at the Proceedings of Eurocrypt (1997). Our new framework will allow the construction of other knapsack protocols having similar security features. We will outline a very concrete example of a new protocol using extension fields of a finite field of small characteristic instead of the prime field $\mathbb{Z}/p\mathbb{Z}$, but more efficient in terms of computational costs for asymptotically equal information rate and similar key size.
keywords: polynomials over finite fields Naccache-Stern protocol. monoids Public key encryption knapsack protocols

Year of publication

Related Authors

Related Keywords

[Back to Top]