A general construction for monoid-based knapsack protocols

DOI10.3934/amc.2014.8.343zbMath1300.94085arXiv1311.1442OpenAlexW3105953802MaRDI QIDQ476358

Giacomo Micheli, Michele 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

monoidspolynomials over finite fieldspublic key encryptionknapsack protocolsNaccache-Stern protocol

Mathematics Subject Classification ID

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

Related Items (3)

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

Uses Software

• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Public key cryptography based on semigroup actions
• Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• Linear Bandwidth Naccache-Stern Encryption
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems

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