Implementing CFS

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7668 LNCS, Issue , 2012, Pages 474-488

  Landais, Gregory ^a   Sendrier, Nicolas ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

CFS; Digital signature scheme; Software implementation

Indexed keywords

CFS; DIGITAL SIGNATURE SCHEMES; MULTI-CORE PROCESSOR; SIGNATURE SCHEME; SOFTWARE IMPLEMENTATION;

MICROPROCESSOR CHIPS; PROFITABILITY;

CRYPTOGRAPHY;

EID: 84871579222     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-34931-7_27     Document Type: Conference Paper

References (22)

1. Courtois, N.T., Finiasz, M., Sendrier, N.: How to Achieve a McEliece-Based Digital Signature Scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157-174. Springer, Heidelberg (2001)
2. McEliece, R.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep., Jet Prop. Lab., California Inst. Technol., Pasadena, CA, 114-116 (January 1978)
3. Beuchat, J.L., Sendrier, N., Tisserand, A., Villard, G.: FPGA implementation of a recently published signature scheme. Rapport de recherche 5158, INRIA (2004)
4. Faugère, J.C., Gauthier, V., Otmani, A., Perret, L., Tillich, J.P.: A distinguisher for high rate McEliece cryptosystems. In: ITW 2011, Paraty, Brazil, pp. 282-286 (October 2011)
5. Finiasz, M.: Parallel-CFS: Strengthening the CFS McEliece-Based Signature Scheme. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 159-170. Springer, Heidelberg (2011)
6. Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory 24(3) (May 1978)
7. Prange, E.: The use of information sets in decoding cyclic codes. IRE Transactions IT-8, S5-S9 (1962)
8. Stern, J.: A Method for Finding Codewords of Small Weight. In: Cohen, G., Wolfmann, J. (eds.) Coding Theory 1988. LNCS, vol. 388, pp. 106-113. Springer, Heidelberg (1989)
9. Bernstein, D.J., Lange, T., Peters, C.: Smaller Decoding Exponents: Ball-Collision Decoding. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 743-760. Springer, Heidelberg (2011)
10. 0.054n). In: Lee, D., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 107-124. Springer, Heidelberg (2011)
11. Wagner, D.: A Generalized Birthday Problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288-303. Springer, Heidelberg (2002)
12. Camion, P., Patarin, J.: The Knapsack Hash Function Proposed at Crypto 1989 Can Be Broken. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 39-53. Springer, Heidelberg (1991)
13. Coron, J.S., Joux, A.: Cryptanalysis of a provably secure cryptographic hash function. Cryptology ePrint Archive, Report 2004/013 (2004), http://eprint.iacr.org/
14. Overbeck, R., Sendrier, N.: Code-based cryptography. In: Bernstein, D., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 95-145. Springer (2009)
15. Johansson, T., Jönsson, F.: On the complexity of some cryptographic problems based on the general decoding problem. IEEE-IT 48(10), 2669-2678 (2002)
16. Sendrier, N.: Decoding One Out of Many. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 51-67. Springer, Heidelberg (2011)
17. Dumer, I.: On minimum distance decoding of linear codes. In: Proc. 5th Joint Soviet-Swedish Int. Workshop Inform. Theory, Moscow, pp. 50-52 (1991)
18. Finiasz, M., Sendrier, N.: Security Bounds for the Design of Code-Based Cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 88-105. Springer, Heidelberg (2009)
19. n/20: How 1 + 1 = 0 Improves Information Set Decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 520-536. Springer, Heidelberg (2012)
20. Patterson, N.: The algebraic decoding of Goppa codes. IEEE Transactions on Information Theory 21(2), 203-207 (1975)
21. Massey, J.: Shift-register synthesis and BCH decoding. IEEE Transactions on Information Theory 15(1), 122-127 (1969)
22. Berlekamp, E.: Algebraic Coding Theory. Aegen Park Press (1968)