The LUC cryptosystem is a modification of the RSA cryptosystem based on Lucas sequences.
In this paper we extend the Verheul - van Tilborg and Dujella variants
of the Wiener attack on RSA to the LUC cryptosystem. We describe an
algorithm for finding a secret key d of the form d=rqm+1pmsqm, for some mgeq−1 and nonnegative integers r and s, using continued fractions.
We derive bounds for r and s using results on Diophantine approximations