Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
37
views
31
references
Top references
cited by
9
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,242
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – EUROCRYPT 2012
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
other
Author(s):
Jean-Charles Faugère
,
Ludovic Perret
,
Christophe Petit
,
Guénaël Renault
Publication date
(Print):
2012
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Hymenoptera
Most cited references
31
Record
: found
Abstract
: not found
Article
: not found
Elliptic curve cryptosystems
Neal Koblitz
(1987)
0
comments
Cited
293
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Use of Elliptic Curves in Cryptography
Victor S. Miller
(1986)
0
comments
Cited
181
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A new efficient algorithm for computing Gröbner bases (F4)
Jean-Charles Faugère
(1999)
0
comments
Cited
137
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2012
Pages
: 27-44
DOI:
10.1007/978-3-642-29011-4_4
SO-VID:
5615faf2-e8f4-43c4-ae80-2891ac8ff355
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 27
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
pp. 45
Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
pp. 117
Identity-Based Encryption Resilient to Continual Auxiliary Leakage
pp. 135
Quantum Proofs of Knowledge
pp. 228
Identity-Based (Lossy) Trapdoor Functions and Applications
pp. 246
Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
pp. 263
Efficient Zero-Knowledge Argument for Correctness of a Shuffle
pp. 318
Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
pp. 336
Minimalism in Cryptography: The Even-Mansour Scheme Revisited
pp. 355
Message Authentication, Revisited
pp. 392
Narrow-Bicliques: Cryptanalysis of Full IDEA
pp. 428
Statistical Tools Flavor Side-Channel Collision Attacks
pp. 446
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
pp. 465
Fully Homomorphic Encryption with Polylog Overhead
pp. 502
Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
pp. 572
Tightly-Secure Signatures from Lossy Identification Schemes
pp. 591
Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
pp. 609
Scalable Group Signatures with Revocation
pp. 628
Incremental Deterministic Public-Key Encryption
pp. 645
Standard Security Does Not Imply Security against Selective-Opening
pp. 719
Pseudorandom Functions and Lattices
pp. 738
Lattice Signatures without Trapdoors
Similar content
2,242
Complexity of solvable cases of the decision problem for the predicate calculus
Authors:
Harry R. Lewis
Discrete Calculus: Applied Analysis on Graphs for Computational Science
Authors:
LJ Grady
,
JR Polimeni
,
L Grady
…
G-Expectation, G-Brownian Motion and Related Stochastic Calculus of Itô Type
Authors:
Shige Peng
See all similar
Cited by
9
Recent progress on the elliptic curve discrete logarithm problem
Authors:
Steven D. Galbraith
,
Pierrick Gaudry
On Polynomial Systems Arising from a Weil Descent
Authors:
Christophe Petit
,
Jean-Jacques Quisquater
Selecting elliptic curves for cryptography: an efficiency and security analysis
Authors:
Joppe W Bos
,
Craig Costello
,
Patrick Longa
…
See all cited by