How to Guess l-th Roots Modulo n by Reducing Lattice Bases. - Philippe Toffin; Marc Girault; Brigitte Vallée (AAECC, 1988)

Computation of Approximate L-th Roots Modulo n and Application to Cryptography. - Marc Girault; Philippe Toffin; Brigitte Vallée (CRYPTO, 1988)

How to Break Okamoto's Cryptosystem by Reducing Lattice Bases. - Brigitte Vallée; Marc Girault; Philippe Toffin (EUROCRYPT, 1988)

Cryptanalysis of a Public-Key Cryptosystem Based on Approximations by Rational Numbers. - Jacques Stern; Philippe Toffin (EUROCRYPT, 1990)

A Simple Algorithm for Computing the Global Crystal Basis of an Irreducible Uq(sln)-Module . - Bernard Leclerc; Philippe Toffin (Int. J. Algebra Comput., 2000)