{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T07:32:23Z","timestamp":1765438343940},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642386152"},{"type":"electronic","value":"9783642386169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38616-9_1","type":"book-chapter","created":{"date-parts":[[2013,6,4]],"date-time":"2013-06-04T07:55:16Z","timestamp":1370332516000},"page":"1-15","source":"Crossref","is-referenced-by-count":21,"title":["Using LDGM Codes and Sparse Syndromes to Achieve Digital Signatures"],"prefix":"10.1007","author":[{"given":"Marco","family":"Baldi","sequence":"first","affiliation":[]},{"given":"Marco","family":"Bianchi","sequence":"additional","affiliation":[]},{"given":"Franco","family":"Chiaraluce","sequence":"additional","affiliation":[]},{"given":"Joachim","family":"Rosenthal","sequence":"additional","affiliation":[]},{"given":"Davide","family":"Schipani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Baldi, M., Chiaraluce, F.: Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC codes. In: Proc. IEEE International Symposium on Information Theory (ISIT 2007), Nice, France, pp. 2591\u20132595 (June 2007)","DOI":"10.1109\/ISIT.2007.4557609"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Baldi, M., Chiaraluce, F., Garello, R., Mininni, F.: Quasi-cyclic low-density parity-check codes in the McEliece cryptosystem. In: Proc. IEEE International Conference on Communications (ICC 2007), Glasgow, Scotland, pp. 951\u2013956 (June 2007)","DOI":"10.1109\/ICC.2007.161"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-85855-3_17","volume-title":"Security and Cryptography for Networks","author":"M. Baldi","year":"2008","unstructured":"Baldi, M., Bodrato, M., Chiaraluce, F.: A new analysis of the McEliece cryptosystem based on QC-LDPC codes. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol.\u00a05229, pp. 246\u2013262. Springer, Heidelberg (2008)"},{"issue":"9","key":"1_CR4","doi-asserted-by":"publisher","first-page":"6052","DOI":"10.1109\/TIT.2011.2161953","volume":"57","author":"M. Baldi","year":"2011","unstructured":"Baldi, M., Bambozzi, F., Chiaraluce, F.: On a Family of Circulant Matrices for Quasi-Cyclic Low-Density Generator Matrix Codes. IEEE Trans. on Information Theory\u00a057(9), 6052\u20136067 (2011)","journal-title":"IEEE Trans. on Information Theory"},{"key":"1_CR5","unstructured":"Baldi, M., Bianchi, M., Chiaraluce, F., Rosenthal, J., Schipani, D.: Enhanced public key security for the McEliece cryptosystem (2011), \n                  \n                    http:\/\/arxiv.org\/abs\/1108.2462"},{"key":"1_CR6","unstructured":"M. Baldi, M. Bianchi, and F. Chiaraluce. \u201cSecurity and complexity of the McEliece cryptosystem based on QC-LDPC codes. IET Information Security (in press), \n                  \n                    http:\/\/arxiv.org\/abs\/1109.5827"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Baldi, M., Bianchi, M., Chiaraluce, F.: Optimization of the parity-check matrix density in QC-LDPC code-based McEliece cryptosystems. To be presented at the IEEE International Conference on Communications (ICC 2013) - Workshop on Information Security over Noisy and Lossy Communication Systems, Budapest, Hungary (June 2013)","DOI":"10.1109\/ICCW.2013.6649325"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-29011-4_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A. Becker","year":"2012","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in 2\n                  n\/20: How 1 + 1 = 0 improves information set decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 520\u2013536. Springer, Heidelberg (2012)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-88403-3_3","volume-title":"Post-Quantum Cryptography","author":"D.J. Bernstein","year":"2008","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the mcEliece cryptosystem. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol.\u00a05299, pp. 31\u201346. Springer, Heidelberg (2008)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/978-3-642-22792-9_42","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"D.J. Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Smaller decoding exponents: ball-collision decoding. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 743\u2013760. Springer, Heidelberg (2011)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/BFb0034862","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","author":"F. Chabaud","year":"1996","unstructured":"Chabaud, F., Stern, J.: The cryptographic security of the syndrome decoding problem for rank distance codes. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, pp. 368\u2013381. Springer, Heidelberg (1996)"},{"key":"1_CR12","unstructured":"Cheng, J.F., McEliece, R.J.: Some high-rate near capacity codecs for the Gaussian channel. In: Proc. 34th Allerton Conference on Communications, Control and Computing, Allerton, IL (October 1996)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45682-1_10","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"N.T. Courtois","year":"2001","unstructured":"Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 157\u2013174. Springer, Heidelberg (2001)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-10366-7_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M. Finiasz","year":"2009","unstructured":"Finiasz, M., Sendrier, N.: Security bounds for the design of code-based cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 88\u2013105. Springer, Heidelberg (2009)"},{"key":"1_CR15","unstructured":"Finiasz, M.: Parallel-CFS strengthening the CFS McEliece-based signature scheme. In: Proc. PQCrypto, Darmstadt, Germany, pp. 61\u201372, May 25-28 (2010)"},{"issue":"6","key":"1_CR16","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1109\/LCOMM.2003.813816","volume":"7","author":"J. Garcia-Frias","year":"2003","unstructured":"Garcia-Frias, J., Zhong, W.: Approaching Shannon performance by iterative decoding of linear codes with low-density generator matrix. IEEE Commun. Lett.\u00a07(6), 266\u2013268 (2003)","journal-title":"IEEE Commun. Lett."},{"issue":"8","key":"1_CR17","doi-asserted-by":"publisher","first-page":"2753","DOI":"10.1109\/TWC.2007.05283","volume":"6","author":"M. Gonz\u00e1lez-L\u00f3pez","year":"2007","unstructured":"Gonz\u00e1lez-L\u00f3pez, M., V\u00e1zquez-Ara\u00fajo, F.J., Castedo, L., Garcia-Frias, J.: Serially-concatenated low-density generator matrix (SCLDGM) codes for transmission over AWGN and Rayleigh fading channels. IEEE Trans. Wireless Commun.\u00a06(8), 2753\u20132758 (2007)","journal-title":"IEEE Trans. Wireless Commun."},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BFb0024461","volume-title":"Cryptography and Coding","author":"G. Kabatianskii","year":"1997","unstructured":"Kabatianskii, G., Krouk, E., Smeets, B.: A digital signature scheme based on random error correcting codes. In: Darnell, M.J. (ed.) Cryptography and Coding 1997. LNCS, vol.\u00a01355, pp. 161\u2013167. Springer, Heidelberg (1997)"},{"key":"1_CR19","unstructured":"Lim, C.H., Lee, P.J.: On the length of hash-values for digital signature schemes. In: Proc. CISC 1995, Seoul, Korea, November 1995, pp. 29\u201331 (1995)"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-25385-0_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"A. May","year":"2011","unstructured":"May, A., Meurer, A., Thomae, E.: Decoding random linear codes in \n                  \n                    \n                  \n                  $\\tilde{\\mathcal{O}}(2^{0.054n})$\n                . In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 107\u2013124. Springer, Heidelberg (2011)"},{"key":"1_CR21","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Progress Report, pp. 114\u2013116 (1978)"},{"issue":"2","key":"1_CR22","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s00145-011-9097-y","volume":"25","author":"L. Minder","year":"2012","unstructured":"Minder, L., Sinclair, A.: The extended k-tree algorithm. Journal of Cryptology\u00a025(2), 349\u2013382 (2012)","journal-title":"Journal of Cryptology"},{"key":"1_CR23","unstructured":"Misoczki, R., Tillich, J.-P., Sendrier, N., Barreto, P.S.L.M.: MDPC-McEliece: New McEliece variants from moderate density parity-check codes (2012), \n                  \n                    http:\/\/eprint.iacr.org\/2012\/409"},{"key":"1_CR24","unstructured":"Monico, C., Rosenthal, J., Shokrollahi, A.: Using low density parity check codes in the McEliece cryptosystem. In: Proc. IEEE International Symposium on Information Theory (ISIT 2000), Sorrento, Italy, p. 215 (June 2000)"},{"key":"1_CR25","unstructured":"Niebuhr, R., Cayrel, P.-L., Buchmann, J.: Improving the efficiency of Generalized Birthday Attacks against certain structured cryptosystems. In: Proc. WCC 2011, Paris, France, April 11-15 (2011)"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-25405-5_7","volume-title":"Post-Quantum Cryptography","author":"A. Otmani","year":"2011","unstructured":"Otmani, A., Tillich, J.-P.: An efficient attack on all concrete KKS proposals. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol.\u00a07071, pp. 98\u2013116. Springer, Heidelberg (2011)"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-12929-2_7","volume-title":"Post-Quantum Cryptography","author":"C. Peters","year":"2010","unstructured":"Peters, C.: Information-set decoding for linear codes over F\n                \n                  q\n                . In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol.\u00a06061, pp. 81\u201394. Springer, Heidelberg (2010)"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-25405-5_4","volume-title":"Post-Quantum Cryptography","author":"N. Sendrier","year":"2011","unstructured":"Sendrier, N.: Decoding one out of many. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol.\u00a07071, pp. 51\u201367. Springer, Heidelberg (2011)"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Wolfmann, J., Cohen, G. (eds.) Coding Theory and Applications 1988. LNCS, vol.\u00a0388, pp. 106\u2013113. Springer, Heidelberg (1989)","DOI":"10.1007\/BFb0019850"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38616-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T17:53:15Z","timestamp":1557769995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38616-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642386152","9783642386169"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38616-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}