Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=6197

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Putting the Hodge and Tate conjectures to the test
Henri Darmon
Lecture Notes in Computer Science 6197, 2010, pp. 1-1
Curves of genus 3 with a group of automorphisms isomorphic to S_3
Jean-François Mestre
Lecture Notes in Computer Science 6197, 2010, pp. 2-2
Learning with errors over rings
Oded Regev
Lecture Notes in Computer Science 6197, 2010, pp. 3-3
Lattices and spherical designs
Gabriele Nebe
Lecture Notes in Computer Science 6197, 2010, pp. 4-5
Fixed points for discrete logarithms
Mariana Levin, Carl Pomerance, K. Soundararajan
Lecture Notes in Computer Science 6197, 2010, pp. 6-15
Explicit Coleman integration for hyperelliptic curves
Jennifer S. Balakrishnan, Robert W. Bradshaw, Kiran S. Kedlaya
Lecture Notes in Computer Science 6197, 2010, pp. 16-31
Smallest reduction matrix of binary quadratic forms: And cryptographic applications
Aurore Bernard, Nicolas Gama
Lecture Notes in Computer Science 6197, 2010, pp. 32-49
Practical improvements to class group and regulator computation of real quadratic fields
Jean-François Biasse, Michael J., Jr. Jacobson
Lecture Notes in Computer Science 6197, 2010, pp. 50-65
On the use of the negation map in the Pollard rho method
Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra
Lecture Notes in Computer Science 6197, 2010, pp. 66-82
An O(M(n)\log n) algorithm for the Jacobi symbol
Richard P. Brent, Paul Zimmermann
Lecture Notes in Computer Science 6197, 2010, pp. 83-95
New families of ECM curves for Cunningham numbers
Éric Brier, Christophe Clavier
Lecture Notes in Computer Science 6197, 2010, pp. 96-109
Visualizing elements of Sha[3] in genus 2 Jacobians
Nils Bruin, Sander R. Dahmen
Lecture Notes in Computer Science 6197, 2010, pp. 110-125
On weil polynomials of K3 surfaces
Andreas-Stephan Elsenhans, Jörg Jahnel
Lecture Notes in Computer Science 6197, 2010, pp. 126-141
Class invariants by the CRT method
Andreas Enge, Andrew V. Sutherland
Lecture Notes in Computer Science 6197, 2010, pp. 142-156
Short bases of lattices over number fields
Claus Fieker, Damien Stehlé
Lecture Notes in Computer Science 6197, 2010, pp. 157-173
On the complexity of the Montes ideal factorization algorithm
David Ford, Olga Veres
Lecture Notes in Computer Science 6197, 2010, pp. 174-185
Congruent number theta coefficients to 10^{12}
William B. Hart, Gonzalo Tornaría, Mark Watkins
Lecture Notes in Computer Science 6197, 2010, pp. 186-200
Pairing the volcano
Sorina Ionica, Antoine Joux
Lecture Notes in Computer Science 6197, 2010, pp. 201-218
A subexponential algorithm for evaluating large degree isogenies
David Jao, Vladimir Soukharev
Lecture Notes in Computer Science 6197, 2010, pp. 219-233
Huff's model for elliptic curves
Marc Joye, Mehdi Tibouchi, Damien Vergnaud
Lecture Notes in Computer Science 6197, 2010, pp. 234-250
Efficient pairing computation with theta functions
David Lubicz, Damien Robert
Lecture Notes in Computer Science 6197, 2010, pp. 251-269
Small-span characteristic polynomials of integer symmetric matrices
James McKee
Lecture Notes in Computer Science 6197, 2010, pp. 270-284
Decomposition attack for the Jacobian of a hyperelliptic curve over an extension field
Koh-ichi Nagao
Lecture Notes in Computer Science 6197, 2010, pp. 285-300
Factoring polynomials over local fields II
Sebastian Pauli
Lecture Notes in Computer Science 6197, 2010, pp. 301-315
On a problem of Hajdu and Tengely
Samir Siksek, Michael Stoll
Lecture Notes in Computer Science 6197, 2010, pp. 316-330

Seiten 1 2 >