Statistics about elliptic curves over finite prime fields (Q2518879): Difference between revisions

Motivated by the analysis of algorithms in cryptography which depend on calculations in the point groups \(E(\mathbb{F}_p)\) of elliptic curves over finite fields \(\mathbb {F}_p\), the author provides answers to the knowledge of the average behavior of \(E(\mathbb{F}_p)\), its cyclicity and its generators when the data are randomly chosen. More particularly, he proves essentially that the probabilities for localizing properties A may be calculated as infinite products of \(\ell\)-local contributions \(P^{(\ell)}\) where \(\ell\) runs through the set of prime numbers.