원문정보
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
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
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
저자정보
참고문헌
자료제공 : 네이버학술정보