Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
44
views
34
references
Top references
cited by
18
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,842
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – CRYPTO 2011
Smaller Decoding Exponents: Ball-Collision Decoding
other
Author(s):
Daniel J. Bernstein
,
Tanja Lange
,
Christiane Peters
Publication date
(Print):
2011
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
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
Decoding Infection and Transmission
Most cited references
34
Record
: found
Abstract
: not found
Book
: not found
Error-Correction Coding for Digital Communications
George C. Clark
,
J. Bibb Cain
(1981)
0
comments
Cited
161
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
A method for finding codewords of small weight
Jacques Stern
(1989)
0
comments
Cited
65
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
A. Canteaut
,
F Chabaud
(1998)
0
comments
Cited
49
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2011
Pages
: 743-760
DOI:
10.1007/978-3-642-22792-9_42
SO-VID:
dc68df48-fefd-42ef-8405-6923cea6d366
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Leftover Hash Lemma, Revisited
pp. 51
Physically Uncloneable Functions in the Universal Composition Framework
pp. 71
Computer-Aided Security Proofs for the Working Cryptographer
pp. 91
Optimal Verification of Operations on Dynamic Sets
pp. 111
Verifiable Delegation of Computation over Large Datasets
pp. 132
Secure Computation on the Web: Computing without Simultaneous Interaction
pp. 151
Memory Delegation
pp. 169
Automatic Search of Attacks on Round-Reduced AES and Applications
pp. 206
A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack
pp. 222
The PHOTON Family of Lightweight Hash Functions
pp. 259
The IPS Compiler: Optimizations, Variants and Concrete Efficiency
pp. 373
Cryptography with Tamperable and Leaky Memory
pp. 391
Merkle Puzzles in a Quantum World
pp. 411
Classical Cryptographic Protocols in a Quantum World
pp. 429
Position-Based Quantum Cryptography: Impossibility and Constructions
pp. 447
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
pp. 465
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
pp. 487
Fully Homomorphic Encryption over the Integers with Shorter Public Keys
pp. 543
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
pp. 578
Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions
pp. 649
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
pp. 685
The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing
pp. 743
Smaller Decoding Exponents: Ball-Collision Decoding
Similar content
2,842
Power-law exponent of the Bouchaud-M\'ezard model on regular random network
Authors:
Takashi Ichinomiya
Passive Scalar: Scaling Exponents and Realizability
Authors:
Robert H. Kraichnan
Exponent back propagation neural network forecasting for financial cross-correlation relationship
Authors:
Haiyan Mo
,
Jun Jun Wang
,
Hongli Niu
See all similar
Cited by
18
Analysis of Information Set Decoding for a Sub-linear Error Weight
Authors:
Rodolfo Canto Torres
,
Nicolas Sendrier
Enhanced Public Key Security for the McEliece Cryptosystem
Authors:
Marco Baldi
,
Davide Schipani
,
Joachim Rosenthal
…
Decoding One Out of Many
Authors:
Nicolas Sendrier
See all cited by