A general construction for monoid-based knapsack protocols

DOI10.3934/AMC.2014.8.343zbMATH Open1300.94085arXiv1311.1442OpenAlexW3105953802MaRDI QIDQ476358FDOQ476358

Authors: Giacomo Micheli, M. Schiavina 

Publication date: 28 November 2014

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

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.

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

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

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)

Cites Work

• Title not available (Why is that?)
• A method for obtaining digital signatures and public-key cryptosystems
• Title not available (Why is that?)
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• Title not available (Why is that?)
• Public key cryptography based on semigroup actions
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• Linear Bandwidth Naccache-Stern Encryption
• Title not available (Why is that?)

Cited In (3)

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

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)