Pages that link to "Item:Q3346214"

The following pages link to A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem (Q3346214):

Displaying 24 items.

• Anonymous message communications with user hierarchy in a multicast system (Q702584) (← links)
• Computer algebra tales on Goppa codes and McEliece cryptography (Q782704) (← links)
• Integer programming and cryptography (Q799477) (← links)
• Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
• Quadratic compact knapsack public-key cryptosystem (Q980333) (← links)
• Simultaneous diophantine approximation of rationals by rationals (Q1083475) (← links)
• A nonlinear public key cryptosystem (Q1102923) (← links)
• A dynamic access control scheme based upon the knapsack problem (Q1324377) (← links)
• Preimage selective trapdoor function: how to repair an easy problem (Q1718474) (← links)
• Mathematical problems in cryptology (Q1910812) (← links)
• Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
• Improved broadcast attacks against subset sum problems via lattice oracle (Q2195373) (← links)
• A knapsack-based probabilistic encryption scheme (Q2384519) (← links)
• A note on the concrete hardness of the shortest independent vector in lattices (Q2656338) (← links)
• Crypto Galore! (Q2908530) (← links)
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems (Q3600386) (← links)
• A natural lattice basis problem with applications (Q4396454) (← links)
• A Modified Technique for Reliable Image Encryption Method using Merkle-Hellman Cryptosystem and Rsa Algorithm (Q5069678) (← links)
• (Q5075820) (← links)
• (Q5239581) (← links)
• Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427) (← links)
• Knapsack problems in groups (Q5496223) (← links)
• Non-injective knapsack public-key cryptosystems (Q5941079) (← links)
• Breaking SIDH in polynomial time (Q6083675) (← links)