Abstract
In this work, we present a survey on software implementations of two families of cryptographic primitives based on the syndrome decoding problem: hash functions and stream ciphers. We have studied different algorithms, namely, FSB, SFSB, RFSB, SYND, 2SC and XSYND, and tried to improve their performances as software implementations which are done in C language by Using XMM registers from Streaming SIMD Extensions (SSE). We provide a fair comparison of the implementations of those primitives in the same platform and also give links to the codes we have developed. Although we did not reach the speed given in the paper in some cases, we managed to beat the results of the reference implementations when they are available.
Supported in part by NATO’s Public Diplomacy Division in the framework of “Science for Peace”, SPS Project 984520.
Supported by the Pole of Research in Mathematics and their Applications in Information Security (PRMAIS).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Meziani, M., Cayrel, P.-L., El Yousfi Alaoui, S.M.: 2SC: an efficient code-based stream cipher. In: Kim, T.-H., Adeli, H., John Robles, R., Balitanas, M.O. (eds.) ISA 2011. CCIS, vol. 200, pp. 111–122. Springer, Heidelberg (2011)
Damgaard, I.B.: A design principle for hash functions. In: Brassard, G. (ed.) Advances in Cryptology (CRYPTO 1989). LNCS, vol. 435, pp. 416–427. Springer, Heidelberg (1990)
Augot, D., Finiasz, M., Sendrier, N.: A fast provably secure cryptographic hash function. IACR Cryptology ePrint Archive 2003:230 (2003)
Finiasz, M., Gaborit, P., Sendrier, N., Manuel, S.: Sha-3 proposal: Fsb. Proposal of a hash function for the NIST SHA-3 competition, October 2008
Merkle, R.C.: Secrecy, authentication, and public key systems. PhD thesis, Stanford University (1979)
Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) Advances in Cryptology (CRYPTO 1989). LNCS, vol. 435, pp. 218–238. Springer, Heidelberg (1990)
Bernstein, D.J., Lange, T., Peters, C., Schwabe, P.: Really fast syndrome-based hashing. IACR Cryptology ePrint Archive 2011:74 (2011)
Fischer, J.-B., Stern, J.: An efficient pseudo-random generator provably as secure as syndrome decoding. In: Maurer, U. (ed.) Advances in Cryptology–EUROCRYPT 1996. Lecture Notes in Computer Science, vol. 1070, pp. 245–255. Springer, Heidelberg (1996)
Meziani, M., Dagdelen, Ö., Cayrel, P.-L., El Yousfi Alaoui, S.M.: S-FSB: an improved variant of the FSB hash family. In: Kim, T.-H., Adeli, H., Robles, R.J., Balitanas, M.O. (eds.) ISA 2011. CCIS, vol. 200, pp. 132–145. Springer, Heidelberg (2011)
Gaborit, P., Lauradoux, C., Sendrier, N.: Synd: a very fast code-based cipher stream with a security reduction. In: Proceedings of the 2007 IEEE International Symposium on Information Theory - ISIT 2007, pp. 186–190. Nice, France, June 2007
Meziani, M., Hoffmann, G., Cayrel, P.-L.: Improving the performance of the SYND stream cipher. In: Mitrokotsa, A., Vaudenay, S. (eds.) Progress in Cryptology - AFRICACRYPT 2012. Lecture Notes in Computer Science, vol. 7374, pp. 99–116. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Cayrel, PL., Meziani, M., Ndiaye, O., Santos, Q. (2015). Efficient Software Implementations of Code-Based Hash Functions and Stream-Ciphers. In: Koç, Ç., Mesnager, S., Savaş, E. (eds) Arithmetic of Finite Fields. WAIFI 2014. Lecture Notes in Computer Science(), vol 9061. Springer, Cham. https://doi.org/10.1007/978-3-319-16277-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-16277-5_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-16276-8
Online ISBN: 978-3-319-16277-5
eBook Packages: Computer ScienceComputer Science (R0)