Non-injective knapsack public-key cryptosystems

DOI10.1016/S0304-3975(99)00297-2zbMath0971.94010WikidataQ114121083 ScholiaQ114121083MaRDI QIDQ5941079

J. A. Koskinen

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

public key cryptosystemknapsackNon-injectivity

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

A knapsack-based probabilistic encryption scheme ⋮ Quadratic compact knapsack public-key cryptosystem

Cites Work

• Improved low-density subset sum algorithms
• A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
• Solving low-density subset sum problems
• A knapsack-type public key cryptosystem based on arithmetic in finite fields
• A sum packing problem of Erdös and the Conway-Guy sequence
• Sets of Integers Whose Subsets Have Distinct Sums
• Cryptanalysis: a survey of recent results
• Hiding information and signatures in trapdoor knapsacks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Non-injective knapsack public-key cryptosystems