A <i>j</i>-Lanes Tree Hashing Mode and <i>j</i>-Lanes SHA-256

ISSN Print: 2153-1234
ISSN Online: 2153-1242
www.scirp.net/journal/jis
E-mail: [email protected]

Citations

"A j-Lanes Tree Hashing Mode and j-Lanes SHA-256"
written by Shay Gueron,
published by Journal of Information Security, Vol.4 No.1, 2013

has been cited by the following article(s):

[1]	Round 2 Submission
	2019

[2]	Parallelizable Message Preprocessing for Merkle-Damgård Hash Functions
	2018

[3]	Parallelizable Message Preprocessing for Merkle-Damgard Hash Functions
	2016

[4]	Parallel SHA-256 in NEON for use in hash-based signatures
	2016

[5]	A toolbox for software optimization of QC-MDPC code-based cryptosystems
	2016

[6]	Parallelized hashing via j-lanes and j-pointers tree modes, with applications to SHA-256
	2014

[7]	Sakura: a flexible coding for tree hashing
	Applied Cryptography and Network Security. Springer International Publishing, 2014

[8]	Parallelized hashing via j-lanes and j-pointers tree modes, with applications to SHA-256.
	IACR Cryptology ePrint Archive, 2014

[9]	S: a flexible coding for tree hashing
	G Bertoni, J Daemen, M Peeters, G Van Assche - eprint.iacr.org, 2013

[10]	Multilane Hashing Mode Suitable for Parallel Processing
	IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, 2013

Top