Earticle

초록

영어

Abstract. In 2003, Augot et al. introduced the Fast Syndrome-Based hash family (in short FSB), which follows the generic construction of Merkle-Damg°ard and is based on the syndrome decoding problem. In 2007, Finiasz et al. proposed an improved version of FSB. In this work, we propose a new efficient hash function, which incorporates the ideas of FSB and the sponge construction introduced by Bertoni et al. Our proposal is up to 30 % faster in practice than FSB. Its security is related on the Regular Syndrome (RSD) Decoding problem, which is proven NP-complete.

목차

Abstract
 1 Introduction
 2 Preliminaries
 3 Related Works
 4 Our Construction: S-FSB
  4.1 Description of S-FSB
 5 Security Analysis
  5.1 Theoretical Security
  5.2 Practical Security
 6 Proposed Parameters
 7 Performance Evaluation
 References

키워드

저자

• Mohammed Meziani [ CASED – Center for Advanced Security Research Darmstadt, Mornewegstrasse 32, 64293 Darmstadt, Germany ]
• Ozgur Dagdelen [ CASED – Center for Advanced Security Research Darmstadt, Mornewegstrasse 32, 64293 Darmstadt, Germany ]
• Pierre-Louis Cayrel [ CASED – Center for Advanced Security Research Darmstadt, Mornewegstrasse 32, 64293 Darmstadt, Germany ]
• Sidi Mohamed El Yousfi Alaoui [ CASED – Center for Advanced Security Research Darmstadt, Mornewegstrasse 32, 64293 Darmstadt, Germany ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Advanced Science and Technology

• 간기

  월간

• pISSN

  2005-4238

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605