default search action
Samuel Neves
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j10]Christoph Dobraunig
, Bart Mennink, Samuel Neves
EliMAC: Speeding Up LightMAC by around 20%. IACR Trans. Symmetric Cryptol. 2023(2): 69-93 (2023) - 2021
- [j9]Bart Mennink, Samuel Neves
On the Resilience of Even-Mansour to Invariant Permutations. Des. Codes Cryptogr. 89(5): 859-893 (2021) - [j8]André Lizardo, Raul Barbosa, Samuel Neves
End-to-end secure group communication for the Internet of Things. J. Inf. Secur. Appl. 58: 102772 (2021) - [j7]Filipe Araújo
The circulant hash revisited. J. Math. Cryptol. 15(1): 250-257 (2021)
2010 – 2019
- 2019
- [j6]Samuel Neves
An observation on NORX, BLAKE2, and ChaCha. Inf. Process. Lett. 149: 1-5 (2019) - 2018
- [j5]Samuel Neves
Degenerate curve attacks: extending invalid curve attacks to Edwards curves and other models. IET Inf. Secur. 12(3): 217-225 (2018) - 2017
- [j4]Anne Canteaut, Eran Lambooij, Samuel Neves
Refined Probability of Differential Characteristics Including Dependency Between Multiple Rounds. IACR Trans. Symmetric Cryptol. 2017(2): 203-227 (2017) - [j3]Bart Mennink, Samuel Neves
Optimal PRFs from Blockcipher Designs. IACR Trans. Symmetric Cryptol. 2017(3): 228-252 (2017) - [c12]Bart Mennink, Samuel Neves
Encrypted Davies-Meyer and Its Dual: Towards Optimal Security Using Mirror Theory. CRYPTO (3) 2017: 556-583 - [i11]Bart Mennink, Samuel Neves:
Encrypted Davies-Meyer and Its Dual: Towards Optimal Security Using Mirror Theory. IACR Cryptol. ePrint Arch. 2017: 473 (2017) - [i10]Anne Canteaut, Eran Lambooij, Samuel Neves, Shahram Rasoolzadeh, Yu Sasaki, Marc Stevens:
Refined Probability of Differential Characteristics Including Dependency Between Multiple Rounds. IACR Cryptol. ePrint Arch. 2017: 478 (2017) - [i9]Bart Mennink, Samuel Neves:
Optimal PRFs from Blockcipher Designs. IACR Cryptol. ePrint Arch. 2017: 812 (2017) - 2016
- [j2]Atul Luykx, Bart Mennink, Samuel Neves
Security Analysis of BLAKE2's Modes of Operation. IACR Trans. Symmetric Cryptol. 2016(1): 158-176 (2016) - [c11]Robert Granger, Philipp Jovanovic, Bart Mennink, Samuel Neves
Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption. EUROCRYPT (1) 2016: 263-293 - [c10]Samuel Neves
Degenerate Curve Attacks - Extending Invalid Curve Attacks to Edwards Curves and Other Models. Public Key Cryptography (2) 2016: 19-35 - [i8]Atul Luykx, Bart Mennink, Samuel Neves:
Security Analysis of BLAKE2's Modes of Operation. IACR Cryptol. ePrint Arch. 2016: 827 (2016) - 2015
- [j1]Samuel Neves
Straight-line programs for fast sparse matrix-vector multiplication. Concurr. Comput. Pract. Exp. 27(13): 3245-3261 (2015) - [c9]Philipp Jovanovic, Samuel Neves
Practical Cryptanalysis of the Open Smart Grid Protocol. FSE 2015: 297-316 - [i7]Philipp Jovanovic, Samuel Neves:
Dumb Crypto in Smart Grids: Practical Cryptanalysis of the Open Smart Grid Protocol. IACR Cryptol. ePrint Arch. 2015: 428 (2015) - [i6]Robert Granger, Philipp Jovanovic, Bart Mennink, Samuel Neves:
Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption. IACR Cryptol. ePrint Arch. 2015: 999 (2015) - [i5]Jean-Philippe Aumasson, Philipp Jovanovic, Samuel Neves:
NORX8 and NORX16: Authenticated Encryption for Low-End Systems. IACR Cryptol. ePrint Arch. 2015: 1154 (2015) - [i4]Samuel Neves, Mehdi Tibouchi:
Degenerate Curve Attacks. IACR Cryptol. ePrint Arch. 2015: 1233 (2015) - 2014
- [c8]Jean-Philippe Aumasson, Philipp Jovanovic, Samuel Neves
NORX: Parallel and Scalable AEAD. ESORICS (2) 2014: 19-36 - [c7]Jean-Philippe Aumasson, Philipp Jovanovic, Samuel Neves
Analysis of NORX: Investigating Differential and Rotational Properties. LATINCRYPT 2014: 306-324 - [i3]Philipp Jovanovic, Samuel Neves, Jean-Philippe Aumasson:
Analysis of NORX. IACR Cryptol. ePrint Arch. 2014: 317 (2014) - 2013
- [c6]Jean-Philippe Aumasson, Samuel Neves
BLAKE2: Simpler, Smaller, Fast as MD5. ACNS 2013: 119-135 - [c5]Samuel Neves
Engineering Nonlinear Pseudorandom Number Generators. PPAM (1) 2013: 96-105 - [i2]Jean-Philippe Aumasson, Samuel Neves, Zooko Wilcox-O'Hearn, Christian Winnerlein:
BLAKE2: simpler, smaller, fast as MD5. IACR Cryptol. ePrint Arch. 2013: 322 (2013) - 2012
- [c4]António Casimiro
TRONE: Trustworthy and Resilient Operations in a Network Environment. DSN Workshops 2012: 1-6 - [c3]Samuel Neves
Representing sparse binary matrices as straight-line programs for fast matrix-vector multiplication. HPCS 2012: 520-526 - [i1]Samuel Neves, Jean-Philippe Aumasson:
Implementing BLAKE with AVX, AVX2, and XOP. IACR Cryptol. ePrint Arch. 2012: 275 (2012) - 2011
- [c2]Samuel Neves
On the performance of GPU public-key cryptography. ASAP 2011: 133-140 - [c1]Samuel Neves
Fast and Small Nonlinear Pseudorandom Number Generators for Computer Simulation. PPAM (1) 2011: 92-101
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: