Abstract
A modification to the multiple-iterated Merkle-Hellman trapdoor is described that permits a knapsack density exceeding the critical density 0.94 of the Lagarias-Odlyzko low-density attack. A high density level also permits fast signature generation. Compaction and common knapsack weights are used to reduce the public-key size. The security of the new trapdoor depends on a simultaneous diophantine approximation problem plus a residue recombination problem.
The research reported here was part of a Ph.D. program at Queen's University, Kingston, Ontario, Canada.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
W. Diffie and M. E. Hellman, “New directions in cryptography”, IEEE Trans. Inf. Theory, vol. IT-22, pp. 644–654, Nov. 1976.
E. F. Brickell and A. M. Odlyzko, “Cryptanalysis: A survey of recent results”, Proc. IEEE, vol. 76, pp. 578–592, May 1988.
E. F. Brickell, “The cryptanalysis of knapsack cryptosystems”, in Proc. of the 3rd SIAM Discrete Mathematics Conference, Philadelphia, PA: SIAM, 1988, pp. 3–23.
Y. Q. Desmedt, “What happened with knapsack cryptographic schemes?”, in Performance Limits in Communication Theory and Practice, Kluwer Academic Publishers, 1988. pp. 113–134.
A. M. Odlyzko, “The rise and fall of knapsack cryptosystems”, Cryptology and Computational Number Theory, in Proc. Symp. Appl. Math., Am. Math. Soc., vol. 42, 1990, pp. 75–80.
R. C. Merkle and M. E. Hellman, “Hiding information and signatures in trapdoor knapsacks”, IEEE Trans. Inform. Theory, vol. IT-24, no. 5, pp. 525–530, Sept. 1978.
R. M. Goodman and A. J. McAuley. “New trapdoor knapsack public key cryptosystem”, IEE Proceedings, vol. 132, part E, no. 6, pp. 289–292, Nov. 1985.
D. E. Knuth, The art of computer programming—volume 2/ seminumerical algorithms, 2nd ed. Reading, MA: Addison-Wesley. 1981.
C. Asmuth and J. Bloom, “A modular approach to key safeguarding”, IEEE Trans. Inform. Theory, vol. IT-29. no. 2, pp. 208–210, March 1983.
M. R. Garey and D. S. Johnson, Computers and intractability: A guide to the theory of NP — completeness. San Francisco: W. H. Freeman and Co., 1979.
B. Chor and R. L. Rivest, “A knapsack type public-key cryptosystem based on arithmetic in finite fields”, IEEE Trans. Inform. Theory, vol. IT-34, no. 5, pp. 901–909, 1988.
W. A. Webb, “A public key cryptosystem based on complementing sets”, Cryptologia, vol. XVI, no. 2, pp. 177–181, April 1992.
Y. Desmedt, J. Vandewalle, and R. Govaerts, “The most general cryptographic knapsack scheme”, Proc. 1984 Carnahan Conf. on Security Technology. New York: IEEE, 16–18 May 1984. pp. 115–120.
J. Vyskoc, “Knapsack in cryptography”, Comput. Artif. Intell., vol. 6. no. 6., pp. 535–40, 1987.
C.-S. Laih, J.-Y. Lee, L. Harn, and Y.-K. Su., “Linearly shift knapsack public-key cryptosystem”, IEEE J. Sel. Areas Commun., vol. 7, no. 4, pp. 534–539, May 1989.
A. Shamir, “On the cryptocomplexity of knapsack systems”, in Proc. 11th ACM Symp. Theory Comput., 1979, pp. 118–129.
A. Shamir and R. E. Zippel, “On the security of the Merkle-Hellman cryptographic scheme”, IEEE Trans. Informat. Theory, vol. IT-26, no. 3, pp. 339–340, May 1980.
R. Eier and H. Lagger, “Trapdoors in knapsack cryptosystems”, Cryptography, Burg Feuerstein, Germany, March 29, 1982, Lecture Notes in Computer Science, vol. 149, Springer-Vertag, 1983, pp. 316–322.
E. F. Brickell and G. J. Simmons, “A status report on knapsack based public-key cryptosystems”, Sandia Nat. Lab. Rep., 1983.
Y. G. Desmedt, J. P. Vanderwalle and R. J. M. Govaerts, “A critical analysis of the security of knapsack public key algorithms”, IEEE Trans. Inform. Theory, IT-30, no. 4, pp. 601–11, July 1984.
A. Shamir, “A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem”, IEEE Trans. Inform. Theory, vol. IT-30, no. 5, pp. 699–704, Sept. 1984.
J. C. Lagarias, “Knapsack public key cryptosystems and diophantine approximation”, in Advances in Cryptology CRYPTO '83, New York: Plenum Press, 1984, pp. 3–23.
L. M. Adleman, “On breaking generalized knapsack public key cryptosystems”, in Proc. of the Fifteenth ACM Symp. Theory Comput., 1983, pp. 402–412.
E. F. Brickell, “Breaking iterated knapsacks”, CRYPTO '84, Springer-Verlag, pp. 342–358.
J. Stern and P. Toffin, “Cryptanalysis of a public-key cryptosystem based on approximations by rational numbers”, in Advances in Cryptology EUROCRYPT '90, Springer-Verlag, 1991, pp. 47–55.
P. van Emde Boas, “Another NP-complete partition problem and the complexity of computing short vectors in a lattice”, Rept. 81-04, Dept. of Mathematics, Univ. of Amsterdam, 1981.
A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovasz, “Factoring polynomials with rational coefficients”, Mathematische Annalen 261, pp. 515–534, 1982.
C. P. Schnorr, “A hierarchy of polynomial time lattice basis reduction algorithms”, Theoretical Computer Science., vol. 53, pp. 201–224, 1987.
C. P. Schnorr, “An efficient algorithm for lattice basis reduction”, J. Algorithms, vol. 9, pp. 47–62, 1988.
E. F. Brickell, “Solving low density knapsacks”, in Advances in Cryptology CRYPTO '83, New York: Plenum Press, 1984, pp. 25–37.
F. Jorissen, J. Vandewalle, and R. Govaerts, “Extension of Brickell's algorithm for breaking high density knapsacks”, in Advances in Cryptology EUROCRYPT '87, 1988, pp. 109–115.
J. C. Lagarias and A. M. Odlyzko, “Solving low-density subset sum problems”, JACM, vol. 32, no. 1, pp. 229–246, Jan. 1985.
A. M. Odlyzko, “Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme”, IEEE Trans. Inform. Theory, vol. IT-30, no. 4, pp. 594–601, 1984.
A. M. Frieze, J. Hastad, R. Kannan, J. C. Lagarias, and A. Shamir, “Reconstructing truncated integer variables satisfying linear congruences”, SIAM J. Comput., vol. 17, pp. 262–80, 1988.
S. P. Radziszowski and D. L. Kreher, “Solving subset sum problems with the L 3 algorithm”, J. Combin. Math. Combin. Comput., vol. 3, pp. 49–63, 1988.
M. J. Coster, B. A. LaMacchia, A. M. Odlyzko, and C. P. Schnorr, “An improved low-density subset sum algorithm”, in Advances in Cryptology EUROCRYPT '91, 1991, pp. 54–67.
A. Joux, and J. Stern, “Improving the critical density of the Lagarias-Odlyzko attack against knapsacks”, in Found. Comput. Theory, FCT 91, Lecture Notes in Comp. Sci., vol. 529, Springer-Verlag, pp. 258–264.
C. P. Schnorr, and M. Euchner, “Lattice basis reduction: Improved practical algorithms and solving subset sum problems”, in Foundations of Computation Theory, FCT 91, Lecture Notes in Computer Science, vol. 529, New York: Springer-Verlag, pp. 68–95.
R. Schroeppel and A. Shamir, “A TS 2 = O(2n) time/space tradeoff for certain NP-complete problems”, in Proc. IEEE 20th Annual Symp. Found. Comp. Sci., Oct. 1979.
A. G. Ferreira, “A parallel time/hardware tradeoff T−H = O(2n/2) for the knapsack problem”, IEEE Trans. Comput., vol. TC-40, no. 2, pp. 221–225, Feb. 1991.
H. W. Lenstra, Jr., “Integer programming with a fixed number of variables”, Math. Operations Research, vol. 8, no. 4, pp. 538–548, Nov. 1983.
R. Kannan, “Improved algorithms for integer programming and related lattice problems”, in Proc. 15th Annual ACM Symp. Theory Comput., 1983, pp. 193–206.
H. R. Amirazizi, E. D. Karnin, and J. M. Reyneri, “Compact knapsacks are polynomially solvable”, ACM SIGACT NEWS, vol. 15, pp. 20–22, 1983.
A. Shamir, “The cryptographic security of compact knapsacks”, in Proc. 1980 Symp. on Security and Privacy, IEEE Computer Society, pp. 94–99, April 1980.
P. S. Henry, “Fast implementation of knapsack cipher”, Bell System Tech. J., vol. 60, pp. 767–773, 1981.
R. R. Jueneman, “Electronic document authentication”, IEEE Network, vol. 1, no. 2, pp. 17–23, 1987.
G. A. Orton, “Very large scale arithmetic with applications to cryptography”, Ph.D. thesis, Electrical Engineering, Queen's University, Kingston, Ontario, Canada, 1992.
G. A. Orton, “A fast decoder for multiple-iterated knapsacks” in 17th Biennial Symposium on Communications, Kingston, Ontario, Canada, May 1994, pp. 411–416.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Orton, G. (1995). A multiple-iterated trapdoor for dense compact knapsacks. In: De Santis, A. (eds) Advances in Cryptology — EUROCRYPT'94. EUROCRYPT 1994. Lecture Notes in Computer Science, vol 950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053429
Download citation
DOI: https://doi.org/10.1007/BFb0053429
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60176-0
Online ISBN: 978-3-540-44717-7
eBook Packages: Springer Book Archive