🚀 go-pugleaf

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
citation?  (I think the "first few digits" would have to be on the
order of the height of the underlying minimal polynomial, but that's still
not much info...)

(I asked publically since others may be interested as well.)

Thanks,

    - Jim