We present an algorithm to determine if the L-series associated to an automorphic representation and the one associated to an elliptic curve over an imaginary quadratic field agree...
Abstract. A prohibitive barrier faced by elliptic curve users is the difficulty of computing the curves’ cardinalities. Despite recent theoretical breakthroughs, point counting ...
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
Abstract. Chosen-message attack on RSA is usually considered as an inherent property of its homomorphic structure. In this paper, we show that nonhomomorphic RSA-type cryptosystems...
Daniel Bleichenbacher, Marc Joye, Jean-Jacques Qui...
: We present a modification of the Goldwasser-Kilian-Atkin primality test, which, when given an input n, outputs either prime or composite, along with a certificate of correctnes...