outer@utcsrgv.UUCP (Richard Outerbridge) (09/22/83)
Some more knapsack-weakness references that have just come my way: Beth, Thomas, Ed. CRYPTOGRAPHY Lecture Notes in Computer Science #149, (New York: Springer-Verlag, 1983). Proceedings of the Workshop on Cryptography, Burg Feuerstein, Germany, March 29 - April 2, 1982. Compiled from papers presented prior to the Shamir-Adleman breakthroughs, this book includes two papers that point towards the weakspot. They are: Ingemarsson, I. "A New Algorithm for the Solution of the Knapsack Problem", pp309-315. and Eier, R. and Lagger, H. "Trapdoors in Knapsack Cryptosystems", pp316-322. There is also a section devoted to analysis and applications of the RSA scheme. One of the articles is in German; there is an English abstract by one of the authors which "presents a new factoring algorithm [for numbers meeting certain criteria, but].....So far it is unpredictable which integers n satisfy these conditions." utcsrgv/outer : R.W. Outerbridge, CSRG/University of Toronto