DocumentCode :
935760
Title :
The largest super-increasing subset of a random set
Author :
Karnin, Ehud D. ; Hellman, Martin E.
Volume :
29
Issue :
1
fYear :
1983
fDate :
1/1/1983 12:00:00 AM
Firstpage :
146
Lastpage :
148
Abstract :
It is shown that the longest super-increasing sequence which can be constructed from a set of 
independent uniformly distributed random variables is almost surely asymptotic to 
. Some extensions of this result, as well as the implications for the security of knapsack-based cryptographic systems, are discussed.
independent uniformly distributed random variables is almost surely asymptotic to . Some extensions of this result, as well as the implications for the security of knapsack-based cryptographic systems, are discussed.Keywords :
Cryptography; Random variables; Binary sequences; Cryptography; Decoding; NP-complete problem; Notice of Violation; Polynomials; Random variables; Security;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1983.1056599
Filename :
1056599
Link To Document :
