원문정보
보안공학연구지원센터(IJSIA)
International Journal of Security and Its Applications
Vol.5 No.4
2011.10
pp.133-144
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
The last three years have witnessed tremendous progress in the understanding of code-based
cryptography. One of its most promising applications is the design of cryptographic schemes
with exceptionally strong security guarantees and other desirable properties. In contrast to
number-theoretic problems typically used in cryptography, the underlying problems have so
far resisted subexponential time attacks as well as quantum algorithms. This paper will
survey the more recent developments. Keywords: Post-quantum cryptography, coding-based
cryptography, encryption, digital signatures, identification, secret-key.
목차
Abstract
Introduction
1. Encryption
1.1 Reducing the key size of the McEliece cryptosystem
1.2 Implementation on different platforms
2. Identi cation
2.1 Quasi-cyclic Stern
2.2 Cayrel et al.’s identification scheme
3. Signature
3.1 Quasi-dyadic-CFS
3.2 Parallel-CFS
3.3 Barreto et. al’s OTS
4. Secret key code-based cryptography
4.1 FSB SHA-3 proposal
4.2 RFSB
4.3 SYND stream cipher
5. Cryptanalysis
5.1 Structural attacks
5.2 Decoding attacks
6. Conclusion
Encryption References
Introduction
1. Encryption
1.1 Reducing the key size of the McEliece cryptosystem
1.2 Implementation on different platforms
2. Identi cation
2.1 Quasi-cyclic Stern
2.2 Cayrel et al.’s identification scheme
3. Signature
3.1 Quasi-dyadic-CFS
3.2 Parallel-CFS
3.3 Barreto et. al’s OTS
4. Secret key code-based cryptography
4.1 FSB SHA-3 proposal
4.2 RFSB
4.3 SYND stream cipher
5. Cryptanalysis
5.1 Structural attacks
5.2 Decoding attacks
6. Conclusion
Encryption References
저자정보
참고문헌
자료제공 : 네이버학술정보