| Résume | With the advent of Public system Cryptography,the algorithms for primality testing and factorisation have become popular.The classical algorithms depend on the multiplicative groupmod p and as such on the number theoretic properties of p-1. However thealgorithms based on elliptic curves depend upon the group E over the finitefield with p elements and thus on the number theoretic properties ofp+1-a .This allows for a substantial improvement over the classicalmethods for primality testing and factorisation. |
