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
28
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
3,831
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – ASIACRYPT 2016: 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part I
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
other
Author(s):
Martin Albrecht
,
Lorenzo Grassi
,
Christian Rechberger
,
Arnab Roy
,
Tyge Tiessen
Publication date
(Online):
November 09 2016
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
ScienceOpen Research
Most cited references
31
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
Conference Proceedings
: not found
Zerocash: Decentralized Anonymous Payments from Bitcoin
Eli Ben Sasson
,
Alessandro Chiesa
,
Christina Garman
…
(2014)
0
comments
Cited
78
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Handbook of Applied Cryptography
Alfred J. Menezes
,
Paul C. van Oorschot
,
Scott A. Vanstone
(2018)
0
comments
Cited
51
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2016
Publication date (Online):
November 09 2016
Pages
: 191-219
DOI:
10.1007/978-3-662-53887-6_7
SO-VID:
f36bcf04-943c-4613-a279-76936d03bff8
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 191
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
pp. 548
Characterisation and Estimation of the Key Rank Distribution in the Context of Side Channel Evaluations
pp. 63
On the Security of Supersingular Isogeny Cryptosystems
pp. 484
Design Strategies for ARX with Provable Bounds: Sparx and LAX
pp. 648
Applying MILP Method to Searching Integral Distinguishers Based on Division Property for 6 Lightweight Block Ciphers
pp. 789
A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
Similar content
3,831
Semi-Paired Discrete Hashing: Learning Latent Hash Codes for Semi-Paired Cross-View Retrieval
Authors:
Xiaobo Shen
,
Fumin Shen
,
Quan-Sen Sun
…
File structures using hashing functions
Authors:
J. Eve
,
E. Coffman
She notes for example that Google's NetzDG transparency report "documents how it uses hashing, fingerprinting, and automated flagging technologies to try to identify unlawful content more quickly
Authors:
Hannah Bloch-Wehba
See all similar
Cited by
9
Verifiable Delay Functions
Authors:
Dan Boneh
,
Joseph Bonneau
,
Benedikt Bunz
…
Rasta: A Cipher with Low ANDdepth and Few ANDs per Bit
Authors:
Christoph Dobraunig
,
Maria Eichlseder
,
Lorenzo Grassi
…
On a Generalization of Substitution-Permutation Networks: The HADES Design Strategy
Authors:
Lorenzo Grassi
,
Reinhard Lüftenegger
,
Christian Rechberger
…
See all cited by