[CST-2] advanced algorithms 1996/9/6 (fwd)

Matej Pfajfar mp292@cam.ac.uk
Fri, 31 May 2002 21:43:41 +0100 (BST) 

> Then just square k times and you get for a=12, a^(n-1)=1.
1 mod 65 I mean ..

--
Matej Pfajfar
St John's College, University of Cambridge, UK

GPG Public Keys @ http://matejpfajfar.co.uk/keys
WARNING: THIS E-MAIL ACCOUNT WILL BE DELETED ON
         15/07/2002. PLEASE USE mp@cantab.net.