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
53
views
16
references
Top references
cited by
31
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,267
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Fast Software Encryption
SWIFFT: A Modest Proposal for FFT Hashing
other
Author(s):
Vadim Lyubashevsky
,
Daniele Micciancio
,
Chris Peikert
,
Alon Rosen
Publication date
(Print):
2008
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
ScienceOpen Research
Most cited references
16
Record
: found
Abstract
: not found
Book Chapter
: not found
NTRU: A ring-based public key cryptosystem
Jeffrey Hoffstein
,
Jill Pipher
,
Joseph Silverman
(1998)
0
comments
Cited
150
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Generating hard instances of lattice problems (extended abstract)
M. Ajtai
(1996)
0
comments
Cited
100
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Daniele Micciancio
,
Oded Regev
(2007)
0
comments
Cited
95
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Pages
: 54-72
DOI:
10.1007/978-3-540-71039-4_4
SO-VID:
6b25e092-7c42-45b9-b85e-859dd224aa82
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 36
The Hash Function Family LAKE
pp. 224
A (Second) Preimage Attack on the GOST Hash Function
pp. 16
Collisions on SHA-0 in One Hour
pp. 253
New Form of Permutation Bias and Secret Key Leakage in Keystream Bytes of RC4
pp. 54
SWIFFT: A Modest Proposal for FFT Hashing
pp. 97
Algebraic and Slide Attacks on KeeLoq
pp. 116
A Meet-in-the-Middle Attack on 8-Round AES
pp. 127
Block Ciphers Implementations Provably Secure Against Second Order Side Channel Analysis
pp. 144
SQUASH – A New MAC with Provable Security Properties for Highly Constrained Devices Such as RFID Tags
pp. 158
Differential Fault Analysis of Trivium
pp. 429
Improved Indifferentiability Security Analysis of chopMD Hash Function
Similar content
1,267
Nitrogen-rich GaN5 and GaN6 as High Energy Density Materials With Modest Synthesis Condition
Authors:
Zhao Liu
,
Da Li
,
Shuli Wei
…
The EUGS: Realistic, but Not Too Modest, Please
Authors:
Jo Coelmont
Design and analysis of high performance and low power FFT for DSP datapath using Vedic Multipliers
Authors:
Nidhi Gaur
,
Pradeep Kumar
,
Anu Mehra
See all similar
Cited by
31
Lattice-based Cryptography
Authors:
Daniele Micciancio
,
Oded Regev
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Authors:
Daniele Micciancio
,
Chris Peikert
On Ideal Lattices and Learning with Errors over Rings
Authors:
Vadim Lyubashevsky
,
Chris Peikert
,
Oded Regev
See all cited by