The largest super-increasing subset of a random set

DOI10.1109/TIT.1983.1056599zbMath0499.94014OpenAlexW2102881115MaRDI QIDQ3966045

Martin Edward Hellman, Ehud D. Karnin

Publication date: 1983

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1983.1056599

zbMATH Keywords

independent uniformly distributed random variableslongest super-increasing sequencesecurity of knapsack-based cryptographic systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Statistical decision theory (62C99)

This page was built for publication: The largest super-increasing subset of a random set