On abelian varieties associated with elliptic curves with complex multiplication
Tetsuo Nakamura (2001)
Acta Arithmetica
Similarity:
Tetsuo Nakamura (2001)
Acta Arithmetica
Similarity:
Tom Weston (2003)
Acta Arithmetica
Similarity:
E.V. Flynn (1991)
Inventiones mathematicae
Similarity:
Hans Carstens (1975)
Fundamenta Mathematicae
Similarity:
Gunther Cornelissen, Jonathan Reynolds (2012)
Acta Arithmetica
Similarity:
Henri Faure, Christiane Lemieux (2012)
Acta Arithmetica
Similarity:
Torsten Ekedahl (1987)
Mathematica Scandinavica
Similarity:
D. F. Dawson (1969)
Matematički Vesnik
Similarity:
Harald Niederreiter (2009)
Acta Arithmetica
Similarity:
Hiroyuki Okazaki (2015)
Formalized Mathematics
Similarity:
In this article we formalize negligible functions that play an essential role in cryptology [10], [2]. Generally, a cryptosystem is secure if the probability of succeeding any attacks against the cryptosystem is negligible. First, we formalize the algebra of polynomially bounded sequences [20]. Next, we formalize negligible functions and prove the set of negligible functions is a subset of the algebra of polynomially bounded sequences. Moreover, we then introduce equivalence relation...
Křížek, Michal, Šolcová, Alena, Somer, Lawrence
Similarity:
Antonella Perucca (2010)
Acta Arithmetica
Similarity: