🚀 go-pugleaf

In article <1993Jan11.223532.13477@ryn.mro4.dec.com> roth@3d.enet.dec.com (Jim Roth) writes:
:
:In article <1993Jan11.143125.24040@linus.mitre.org>, bs@gauss.mitre.org (Robert D. Silverman) writes...
:>In article <1993Jan11.111351.7777@hsr.no> frank@hsr.no (Frank A Stevenson) writes:
:>: question about using irrational root as a "one time pad"...
:
:>Your last point might be questioned. There are some good integer relation
:>finding algorithms (Ferguson & Forcade, for example and improvements)
:>that allow one to very quickly determine that the number is the root of
:>an integer, based upon just the first few digits.  Once that is determined,
:>finding the rest of the key is trivial. 
:
:>The same would be true for any ALGEBRAIC irrational.
:
:I know how to do this using a lattice basis reduction algorithm, (such
:as LLL) but don't know the Ferguson & Forcade refrence - can you post a
 
Yep. L^3 would work as well.

See the following:

:citation?  (I think the "first few digits" would have to be on the

See D. Bailey, H. Ferguson
Numerical results on relations between fundamental constants
using a new algorithm.
Math. Comp. v. 53 p. 649 (1989)

:order of the height of the underlying minimal polynomial, but that's still
:not much info...)
 
Yep.
--
Bob Silverman
These are my opinions and not MITRE's.
Mitre Corporation, Bedford, MA 01730
"You can lead a horse's ass to knowledge, but you can't make him think"