IBM's New Algo

The New York Times, May 7, 1997, p. D5.

   I.B.M. Researchers Develop A New Encryption Formula

   By Laurence Zuckerman

   I.B.M. plans to announce today that two of its researchers
   have come up with a new computer encryption formula that
   they say is nearly impossible to crack.

   The International Business Machines Corporation said that
   the breakthrough was still a long way from being employed
   outside the lab and that it did nothing to resolve the
   running dispute between the computer industry and the
   Federal Government over whether law enforcement agencies
   should be given access to encrypted communications. But it
   could ultimately help reduce the vulnerability of so-called
   public-key encryption, which is the favored security method
   used to safeguard commerce and privacy on the Internet.

   "They've made a big advance," said Joan Feigenbaum, a
   researcher at AT&T Labs in Murray Hill, N.J., who is
   familiar with the work of the two computer scientists who
   developed the system, Miklos Ajtai and Cynthia Dwork of
   I.B.M.'s Almaden Research Center in San Jose, Calif.
   "Scientifically, this is a big step in the right
   direction."

   But Bruce Schneier, a computer security consultant in
   Minneapolis and author of a standard textbook on
   cryptography, dismissed the news.

   "Theoretically it is important, but as a security
   breakthrough there is nothing new," he said.

   In public-key encryption, the sender of an electronic
   communication uses software that automatically scrambles
   the information by incorporating a publicly known numerical
   key. Decoding the scrambled transmission requires a private
   key, a number supposedly known only by the recipient.

   The security of the system depends, among other things, on
   how difficult it is for an electronic eavesdropper to crack
   the code using a powerful computer. If some of the codes
   that are generated by the system are difficult to break but
   others are easy, the system is inherently weak. I.B.M. said
   that its new system was the first to generate hundreds of
   codes at random, each of which is as difficult to crack as
   the hardest instance of the underlying mathematical
   problem.

   The system is based on a problem that has defied solution
   by mathematicians for 150 years, I.B.M. said.

   Mr. Schneier said that the cryptographic formulas now in
   use were already robust enough. The biggest challenge, he
   said, is creating security systems in the real world that
   are not vulnerable to hackers.

   "Cryptography is a lot more than math" he said.

   [End]

John Young <jya@pipeline.com> writes:

>    The New York Times, May 7, 1997, p. D5.
> 
>    I.B.M. Researchers Develop A New Encryption Formula
...
>    The system is based on a problem that has defied solution
>    by mathematicians for 150 years, I.B.M. said.

I had an interesting conversation a few weeks ago with a friend who has
a closed-form solution to a well-known problem that's been unsolved for
about that long.  He has no intention of publishing it, but he has already
made quite a bit of $$$ on it. :-)

I've known the guy for a number of years and it's not the first time he gets
a good result and makes money on it instead of yet another paper in a 
refereed journal.  In general, lots more is known to some people than is
published. E.g. it's possible that some of stuff I did for my Ph.D. thesis
was done by the British crypto people but never made it to the open literatre.

>    Mr. Schneier said that the cryptographic formulas now in
>    use were already robust enough. The biggest challenge, he
>    said, is creating security systems in the real world that
>    are not vulnerable to hackers.
> 
>    "Cryptography is a lot more than math" he said.

Let me get this straight - Schneier claims that factoring is secure now and
will remain secure in the future?

---

Dr.Dimitri Vulis KOTM
Brighton Beach Boardwalk BBS, Forest Hills, N.Y.: +1-718-261-2013, 14.4Kbps

Dr.Dimitri Vulis KOTM wrote:
> John Young <jya@pipeline.com> writes:
> >    The New York Times, May 7, 1997, p. D5.
> >    I.B.M. Researchers Develop A New Encryption Formula
> >    The system is based on a problem that has defied solution
> >    by mathematicians for 150 years, I.B.M. said.
> 
> I had an interesting conversation a few weeks ago with a friend who has
> a closed-form solution to a well-known problem that's been unsolved for
> about that long.  He has no intention of publishing it, but he has already
> made quite a bit of $$$ on it. :-)
> 
> I've known the guy for a number of years and it's not the first time he gets
> a good result and makes money on it instead of yet another paper in a 
> refereed journal.  In general, lots more is known to some people than is
> published. E.g. it's possible that some of stuff I did for my Ph.D. thesis
> was done by the British crypto people but never made it to the open literatre.
> 
> >    Mr. Schneier said that the cryptographic formulas now in
> >    use were already robust enough. The biggest challenge, he
> >    said, is creating security systems in the real world that
> >    are not vulnerable to hackers.
> > 
> >    "Cryptography is a lot more than math" he said.
> 
> Let me get this straight - Schneier claims that factoring is secure now and
> will remain secure in the future?

Let me get this straight -- did your friend discover a closed form
solution to the factoring problem?

	- Igor.

ichudov@algebra.com (Igor Chudov @ home) writes:

> Dr.Dimitri Vulis KOTM wrote:
> > John Young <jya@pipeline.com> writes:
> > >    The New York Times, May 7, 1997, p. D5.
> > >    I.B.M. Researchers Develop A New Encryption Formula
> > >    The system is based on a problem that has defied solution
> > >    by mathematicians for 150 years, I.B.M. said.
> >
> > I had an interesting conversation a few weeks ago with a friend who has
> > a closed-form solution to a well-known problem that's been unsolved for
> > about that long.  He has no intention of publishing it, but he has already
> > made quite a bit of $$$ on it. :-)
> >
> > I've known the guy for a number of years and it's not the first time he get
> > a good result and makes money on it instead of yet another paper in a
> > refereed journal.  In general, lots more is known to some people than is
> > published. E.g. it's possible that some of stuff I did for my Ph.D. thesis
> > was done by the British crypto people but never made it to the open literat
> >
> > >    Mr. Schneier said that the cryptographic formulas now in
> > >    use were already robust enough. The biggest challenge, he
> > >    said, is creating security systems in the real world that
> > >    are not vulnerable to hackers.
> > >
> > >    "Cryptography is a lot more than math" he said.
> >
> > Let me get this straight - Schneier claims that factoring is secure now and
> > will remain secure in the future?
>
> Let me get this straight -- did your friend discover a closed form
> solution to the factoring problem?

Nope, the guy I had in mind solved something else which to me was about
as interesting.

But yes, I also heard via a grapevine that "a friend of a friend" claims to
have found a trick for factoring a product of 2 arbitrarily large primes
(hundreds of decimal digits) very quickly ("minutes on a PC"). I don't
believe in reputations in general, but his is such that this may be true.

---

Dr.Dimitri Vulis KOTM
Brighton Beach Boardwalk BBS, Forest Hills, N.Y.: +1-718-261-2013, 14.4Kbps