Generation of solved instances of Multiconstraint Knapsack problem and its applications to Private Key Cipher

DOI10.1080/02522667.1995.10699232zbMath0861.90100OpenAlexW1999778712WikidataQ122446189 ScholiaQ122446189MaRDI QIDQ4718638

Unnamed Author, Louis R. Chow

Publication date: 2 March 1997

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1995.10699232

zbMATH Keywords

complementary slackness conditionsdesign of private key ciphermulticonstraint knapsack problem

Mathematics Subject Classification ID

Boolean programming (90C09)

Cites Work

• Unnamed Item
• Unnamed Item
• Random generation of combinatorial structures from a uniform distribution
• One-way permutations on elliptic curves
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Communication Theory of Secrecy Systems*
• Average Case Complete Problems
• Solving low-density subset sum problems

This page was built for publication: Generation of solved instances of Multiconstraint Knapsack problem and its applications to Private Key Cipher