We describe three ways to generalise Lenstra's algebraic integer recovery method. One direction adapts the algorithm so that rational numbers are automatically produced given only upper bounds on the sizes of the numerators and denominators. Another direction produces a variant which recovers algebraic numbers as elements of multiple generator algebraic number fields. The third direction explains how the method can work if a reducible minimal polynomial had been given for an algebraic generator. Any two or all three of the generalisations may be employed simultaneously.

Recovery of Algebraic Numbers from their $p$-adic Approximations

ABBOTT, JOHN ANTHONY
1989

Abstract

We describe three ways to generalise Lenstra's algebraic integer recovery method. One direction adapts the algorithm so that rational numbers are automatically produced given only upper bounds on the sizes of the numerators and denominators. Another direction produces a variant which recovers algebraic numbers as elements of multiple generator algebraic number fields. The third direction explains how the method can work if a reducible minimal polynomial had been given for an algebraic generator. Any two or all three of the generalisations may be employed simultaneously.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11567/510524
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? ND
social impact