A general construction for monoid-based knapsack protocols

DOI10.3934/AMC.2014.8.343MaRDI QIDQ476358zbMATH OpenOpenAlexFDO

Authors Giacomo Micheli, M. Schiavina

Publication date 28 November 2014

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1311.1442

zbMATH Keywords

polynomials over finite fieldsmonoidspublic key encryptionknapsack protocolsNaccache-Stern protocol

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Abstract: 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 Z/pZ, but more efficient in terms of computational costs for asymptotically equal information rate and similar key size.

Recommendations

• scientific article; zbMATH DE number 691485
• A knapsack-based probabilistic encryption scheme
• A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)
• A knapsack-type public key cryptosystem based on arithmetic in finite fields
• Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme

Cites work

• scientific article; zbMATH DE number 1716471 (Why is no real title available?)
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 49145 (Why is no real title available?)
• scientific article; zbMATH DE number 1759776 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• Linear Bandwidth Naccache-Stern Encryption
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• New directions in cryptography
• Public key cryptography based on semigroup actions

Cited in

(3)

• Cryptanalysis of a noncommutative key exchange protocol
• Birthday type attacks to the Naccache-Stern knapsack cryptosystem
• Cryptanalysis of the CLR-cryptosystem

Describes a project that uses

Uses Software

• McEliece

This page was built for publication: A general construction for monoid-based knapsack protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476358)