Knapsack cryptographic schemes

[1]  Joos Vandewalle,et al.  A critical analysis of the security of knapsack public-key algorithms , 1984, IEEE Trans. Inf. Theory.

[2]  Ernest F. Brickell,et al.  Solving Low Density Knapsacks , 1983, CRYPTO.

[3]  Adi Shamir,et al.  On the cryptocomplexity of knapsack systems , 1979, STOC.

[4]  Michael Willett.  Trapdoor Knapsacks Without Superincreasing Structure , 1983, Inf. Process. Lett..

[5]  Anthony J. McAuley,et al.  A New Trapdoor Knapsack Public-Key Cryptosystem , 1985, EUROCRYPT.

[6]  James L. Massey,et al.  Fast Authentication in a Trapdoor - Knapsack Public Key Cryptosystem , 1982, EUROCRYPT.

[7]  Joos Vandewalle,et al.  A highly secure cryptographic algorithm for high speed transmission , 1982 .

[8]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[9]  Jeffrey C. Lagarias,et al.  Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems , 1983, CRYPTO.

[10]  Jeffrey C. Lagarias,et al.  Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem , 1984, ICALP.

[11]  A. Diporto,et al.  A public-key cryptosystem based on a generalization of the knapsack problem , 1985 .

[12]  Whitfield Diffie,et al.  Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard , 1977, Computer.

[13]  Andrew M. Odlyzko,et al.  Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme , 1984, IEEE Trans. Inf. Theory.

[14]  Adi Shamir.  A Fast Signature Scheme , 1978 .

[15]  Ehud D. Karnin,et al.  The largest super-increasing subset of a random set , 1983, IEEE Trans. Inf. Theory.

[16]  Ehud D. Karnin,et al.  A Parallel Algorithm for the Knapsack Problem , 1984, IEEE Transactions on Computers.

[17]  Benjamin Arazi.  A trapdoor multiple mapping (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[18]  Joos Vandewalle,et al.  Linear algebra and extended mappings generalise public key cryptographic Knapsack algorithms , 1983 .

[19]  Ronald L. Rivest,et al.  A knapsack-type public key cryptosystem based on arithmetic in finite fields , 1988, IEEE Trans. Inf. Theory.

[20]  Adi Shamir,et al.  On the security of the Merkle- Hellman cryptographic scheme (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[21]  E. Brickell,et al.  Cryptanalysis: a survey of recent results , 1988, Proc. IEEE.

[22]  P. S. Henry,et al.  B.S.T.J. BRIEF fast decryption algorithm for the knapsack cryptographic system , 1981, The Bell System Technical Journal.

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  Ernest F. Brickell,et al.  Breaking Iterated Knapsacks , 1985, CRYPTO.

[25]  Jeffrey C. Lagarias,et al.  Solving low density subset sum problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[26]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[27]  Leonard M. Adleman,et al.  On breaking generalized knapsack public key cryptosystems , 1983, STOC.

[28]  Helmut Lagger,et al.  Trapdoors in Knapsack Cryptosystems , 1982, EUROCRYPT.

[29]  Martin E. Hellman,et al.  Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.

[30]  Jeffrey C. Lagarias,et al.  Knapsack Public Key Cryptosystems and Diophantine Approximation , 1983, CRYPTO.

[31]  Keisuke Tanaka,et al.  Quantum Public-Key Cryptosystems , 2000, CRYPTO.

[32]  Andrew M. Odlyzko,et al.  Discrete Logarithms in Finite Fields and Their Cryptographic Significance , 1985, EUROCRYPT.

[33]  Leonard M. Adleman,et al.  On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem , 1982, CRYPTO.

[34]  Martin E. Hellman,et al.  A cryptanalytic time-memory trade-off , 1980, IEEE Trans. Inf. Theory.

[35]  C. A. Rogers,et al.  An Introduction to the Geometry of Numbers , 1959 .