Efficient Software Implementations of Code-Based Hash Functions and Stream-Ciphers

  • Pierre-Louis Cayrel
  • Mohammed Meziani
  • Ousmane Ndiaye
  • Quentin Santos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9061)

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.

Keywords

Code-based cryptography Software implementations 

References

  1. [2SC]
    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)Google Scholar
  2. [Damgard90]
    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)Google Scholar
  3. [FSB]
    Augot, D., Finiasz, M., Sendrier, N.: A fast provably secure cryptographic hash function. IACR Cryptology ePrint Archive 2003:230 (2003)Google Scholar
  4. [FSB-SHA3]
    Finiasz, M., Gaborit, P., Sendrier, N., Manuel, S.: Sha-3 proposal: Fsb. Proposal of a hash function for the NIST SHA-3 competition, October 2008Google Scholar
  5. [Merkle79]
    Merkle, R.C.: Secrecy, authentication, and public key systems. PhD thesis, Stanford University (1979)Google Scholar
  6. [Merkle89]
    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)Google Scholar
  7. [RFSB]
    Bernstein, D.J., Lange, T., Peters, C., Schwabe, P.: Really fast syndrome-based hashing. IACR Cryptology ePrint Archive 2011:74 (2011)Google Scholar
  8. [SB]
    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)Google Scholar
  9. [SFSB]
    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)Google Scholar
  10. [SYND]
    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 2007Google Scholar
  11. [XSYND]
    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)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Pierre-Louis Cayrel
    • 1
  • Mohammed Meziani
    • 2
  • Ousmane Ndiaye
    • 3
  • Quentin Santos
    • 4
  1. 1.Laboratoire Hubert CurienUMR CNRS 5516Saint-etienneFrance
  2. 2.CASED-Center for Advanced Security Research DarmstadtDarmstadtGermany
  3. 3.Université Cheikh Anta Diop de Dakar, FST, DMI, LACGAADakarSenegal
  4. 4.École Normale Supérieure de LyonLyonFrance

Personalised recommendations