![]() | This article is rated C-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||
|
I believe this article title is ambiguous. Merkle-Hellman seems too much like an article on their numerous cooperation in cryptosystems. I propose Merkle-Hellman knapsack cryptosystem, similar to Naccache-Stern knapsack cryptosystem. If noone objects I will move.-- Michael miceli ( talk) 20:48, 2 August 2009 (UTC)
I don't get the decryption. someone needs to clarify it. Also, I want info on how the cypher was broken. --anon
Quote:
This is particularly vague for me but not-being experienced in the field of cryptography or knapsack problems I have a hesitance to fix it myself. If my understanding of the Subset Sum Problem (according to the wikipedia page on that topic) is correct then would this make more sense:
If you can verify this to be a correct interpretation of the subset sum problem please update the article. Thanks in advance. -- Diploid ( talk) 16:27, 21 April 2010 (UTC)
all cipher system are breackable accept one time pad
what is gcd? i looked around and the best match i could find was greatest common divisor. Is this correct? I'm not totally sure how to add to wikipedia in the proper format so i put it in talk. if so, could "gcd(r,q) == 1" be better expressed as "r and q are coprime", since coprime has already been mentioned.
How does Bob know Alice's private key, and why is that being used to decrypt? â Preceding unsigned comment added by 68.40.171.174 ( talk) 00:11, 21 August 2012 (UTC)
How does Bob know Alice's private key, and why is that being used to decrypt?
IE - what's the use of the public key if it doesn't get used? â Preceding unsigned comment added by 68.40.171.174 ( talk) 00:14, 21 August 2012 (UTC)
![]() | This article is rated C-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||
|
I believe this article title is ambiguous. Merkle-Hellman seems too much like an article on their numerous cooperation in cryptosystems. I propose Merkle-Hellman knapsack cryptosystem, similar to Naccache-Stern knapsack cryptosystem. If noone objects I will move.-- Michael miceli ( talk) 20:48, 2 August 2009 (UTC)
I don't get the decryption. someone needs to clarify it. Also, I want info on how the cypher was broken. --anon
Quote:
This is particularly vague for me but not-being experienced in the field of cryptography or knapsack problems I have a hesitance to fix it myself. If my understanding of the Subset Sum Problem (according to the wikipedia page on that topic) is correct then would this make more sense:
If you can verify this to be a correct interpretation of the subset sum problem please update the article. Thanks in advance. -- Diploid ( talk) 16:27, 21 April 2010 (UTC)
all cipher system are breackable accept one time pad
what is gcd? i looked around and the best match i could find was greatest common divisor. Is this correct? I'm not totally sure how to add to wikipedia in the proper format so i put it in talk. if so, could "gcd(r,q) == 1" be better expressed as "r and q are coprime", since coprime has already been mentioned.
How does Bob know Alice's private key, and why is that being used to decrypt? â Preceding unsigned comment added by 68.40.171.174 ( talk) 00:11, 21 August 2012 (UTC)
How does Bob know Alice's private key, and why is that being used to decrypt?
IE - what's the use of the public key if it doesn't get used? â Preceding unsigned comment added by 68.40.171.174 ( talk) 00:14, 21 August 2012 (UTC)