Resumen de Suite de LUCAS et Cryptographie

André Warusfel

• The Lucas sequence is a sort of generalization of ordinary powers, with properties similar in respect of Fermat's theorem. This sequence can be used for cryptographic procedures, in the sense that $v_{n+m} = v_n\circ v_m$ is similar to the usual property $\alpha^{n+m} = \alpha^n\alpha^m$.