{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:32:13Z","timestamp":1760707933328},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,4,2]],"date-time":"2008-04-02T00:00:00Z","timestamp":1207094400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s00200-008-0074-0","type":"journal-article","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T08:40:35Z","timestamp":1207039235000},"page":"213-228","source":"Crossref","is-referenced-by-count":5,"title":["Error-correcting codes and cryptography"],"prefix":"10.1007","volume":"19","author":[{"given":"Hideki","family":"Imai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manabu","family":"Hagiwara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,4,2]]},"reference":[{"key":"74_CR1","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon C.E. (1948). A mathematical theory of communication (parts 1 and 2). Bell Syst. Tech. J. 27: 379\u2013423","journal-title":"Bell Syst. Tech. J."},{"key":"74_CR2","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C.E. Shannon","year":"1949","unstructured":"Shannon C.E. (1949). Communication theory of secrecy systems. Bell Syst. Tech. J. 28: 656\u2013715","journal-title":"Bell Syst. Tech. J."},{"issue":"2\/3","key":"74_CR3","first-page":"145","volume":"17","author":"T. Beth","year":"1981","unstructured":"Beth T. and Sagerer G. (1981). CODEC\u2014a program system for the interactive development of error-correcting coders\/decoders. Elektronische Informations verarbeitung und Kybernetik 17(2\/3): 145\u2013147","journal-title":"Elektronische Informations verarbeitung und Kybernetik"},{"key":"74_CR4","doi-asserted-by":"crossref","unstructured":"Beth, T.: Codes, groups and invariants, AAECC 1984, pp.71\u201378 (1984)","DOI":"10.1007\/978-1-349-08035-9_5"},{"key":"74_CR5","doi-asserted-by":"crossref","unstructured":"Beth, T.: Algebraic and Dymbolic computation in digital signal processing, coding and cryptography. In: European Conference on Computer Algebra. vol. 1, pp. 93\u2013101 (1985)","DOI":"10.1007\/3-540-15983-5_8"},{"issue":"1\u20132","key":"74_CR6","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/A:1018076707255","volume":"8","author":"T. Beth","year":"1996","unstructured":"Beth T. (1996). Designs, codes and crypts\u2014a puzzle altogether. Des. Codes Cryptogr. 8(1\u20132): 91\u2013101","journal-title":"Des. Codes Cryptogr."},{"issue":"1\u20133","key":"74_CR7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1024188005329","volume":"29","author":"T. Beth","year":"2003","unstructured":"Beth T., Charnes C., Grassl M., Alber G., Delgado A. and Mussinger M. (2003). A new class of designs which protect against quantum jumps. Des. Codes Cryptogr. 29(1\u20133): 51\u201370","journal-title":"Des. Codes Cryptogr."},{"key":"74_CR8","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir A. (1979). How to share a secret. Commun. ACM 22: 612\u2013613","journal-title":"Commun. ACM"},{"key":"74_CR9","unstructured":"Blakley, G.:Safeguarding cryptographic keys. In: Proceedings of AFIPS National Computer Conference. vol. 48, pp. 313\u2013317 (1979)"},{"issue":"1","key":"74_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"IT-29","author":"E. Karnin","year":"1983","unstructured":"Karnin E., Green J. and Hellman M. (1983). On secret sharing systems. IEEE Trans. Inf. Theory IT-29(1): 35\u201341","journal-title":"IEEE Trans. Inf. Theory"},{"key":"74_CR11","unstructured":"Massey, J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, pp. 276\u2013279, (1993)"},{"issue":"11","key":"74_CR12","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"R.J. McEliece","year":"1979","unstructured":"McEliece R.J. and Sarwate D.V. (1979). On sharing secrets and Reed-Solomon codes. Comm. ACM 22(11): 612\u2013613","journal-title":"Comm. ACM"},{"key":"74_CR13","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1007\/3-540-46885-4_45","volume":"434","author":"E.F. Brickell","year":"1990","unstructured":"Brickell E.F. (1990). Some ideal secret sharing schemes, in advances in cryptology\u2014Eurocrypt\u201989. Lect. Notes Comput. Sci. 434: 468\u2013475","journal-title":"Lect. Notes Comput. Sci."},{"key":"74_CR14","doi-asserted-by":"crossref","unstructured":"Cramer, R., Daza, V., Gracia I., Urrorz, J.J., Leander, G., Mart\u00edi-Farr\u00e9 J., Padr\u00f3, C.: On codes, matroids and secure multi-party computation from linear secret sharing schemes, Lecture Notes in Computer Science, vol. 3621, Crypto 2005, pp. 327\u2013343 (2005)","DOI":"10.1007\/11535218_20"},{"key":"74_CR15","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0304-3975(00)00207-3","volume":"246","author":"C. Ding","year":"2000","unstructured":"Ding C., Kohel D.R. and Ling S. (2000). Secret-sharing with a class of ternary codes. Theor. Comput. Sci. 246: 285\u2013298","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"74_CR16","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/j.1538-7305.1974.tb02751.x","volume":"53","author":"E.N. Gilbert","year":"1974","unstructured":"Gilbert E.N., MacWilliams F.J. and Sloane N.J.A. (1974). Codes which detect deception. Bell Syst. Tech. J. 53(3): 405\u2013424","journal-title":"Bell Syst. Tech. J."},{"key":"74_CR17","doi-asserted-by":"crossref","unstructured":"Pei, D.: Authentication Codes and Combinatorial Designs, Discrete Mathematics and its Applications, Chapman and Hall\/CRC, (2006)","DOI":"10.1201\/9781420003185"},{"issue":"3","key":"74_CR18","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"IT-24","author":"E.R. Berlekamp","year":"1978","unstructured":"Berlekamp E.R., McEliece R.J. and van Tilborg H.C.A. (1978). On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory IT-24(3): 384\u2013386","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"44","key":"74_CR19","first-page":"114","volume":"42","author":"R.J. McEliece","year":"1978","unstructured":"McEliece R.J. (1978). A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep. 42(44): 114\u2013116","journal-title":"DSN Prog. Rep."},{"key":"74_CR20","doi-asserted-by":"crossref","unstructured":"Kobara, K., Imai, H.: Semantically secure McEliece public-key cryptosystems-conversions for McEliece PKC-. In: PKC\u20192001, Lecture Notes in Computer Science, Cheju Island, Korea, Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-44586-2_2"},{"key":"74_CR21","unstructured":"Niederreiter, H.: Error-correcting Codes and Cryptography, Public-Key Cryptography and Computational Number Theory. In: Alster, K., Urbanowicz, J., Williams, H.C. (eds.) pp. 209\u2013219, W. de Gruyter, Berlin, 2001"},{"key":"74_CR22","unstructured":"Loidreau, P.: How to reduce public-key size in McEliece like PKCs? In: CLC 2006, Workshop on Codes and Lattices in Cryptography, pp. 57\u201360, (2006)"},{"key":"74_CR23","unstructured":"Kobara, K., Imai, H.: Personalized-public-key cryptosystem (P 2 KC)\u2014application where public-key size of Niederreiter PKC can be reduced-, CLC 2006. In: Workshop on Codes and Lattices in Cryptography, pp. 61\u201368, 2006"},{"key":"74_CR24","doi-asserted-by":"crossref","unstructured":"Davida, G.I., Frankel, Y., Matt, B.J.: On enabling secure applications through off-line biometric identification. In: Proc. IEEE Symposium and Privacy, pp. 148\u2013157, 1998","DOI":"10.1109\/SECPRI.1998.674831"},{"key":"74_CR25","unstructured":"Martinian, E., Yekhanin S., Yadidia, J.S.: Secure biometrics via syndromes, Mitsubishi electric research laboratories. Technical Reports (2005)"},{"key":"74_CR26","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low Density Parity Check Codes","author":"R.G. Gallager","year":"1963","unstructured":"Gallager R.G. (1963). Low Density Parity Check Codes. MIT Press, Cambridge"},{"key":"74_CR27","doi-asserted-by":"crossref","unstructured":"Richardson, T.J., Shokrollahi, M.A., Urbanke, R.L.: Design of capacity-approaching irregular low-density parity-check codes. IEEE Trans. Inf. Theory 47(2), (2001)","DOI":"10.1109\/18.910578"},{"key":"74_CR28","volume-title":"Handbook of Applied Cryptography","author":"A.J. Menezes","year":"1997","unstructured":"Menezes A.J., Vanstone S.A. and Oorschot P.C. (1997). Handbook of Applied Cryptography. CRC Press, Boca Raton"},{"key":"74_CR29","doi-asserted-by":"crossref","unstructured":"Mihaljevi\u0107, M.J., Fossorier, M.P.C., Imai H.: A general formulation of algebraic and fast correlation attacks based on dedicated sample decimation, AAECC2006. Lecture Notes Computer Science, vol. 3857. pp. 203\u2013214, Feb. (2006)","DOI":"10.1007\/11617983_20"},{"key":"74_CR30","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-45473-X_17","volume":"2355","author":"M.J. Mihaljevi\u0107","year":"2002","unstructured":"Mihaljevi\u0107 M.J., Fossorier M.P.C. and Imai H. (2002). Fast correlation attack algorithm with list decoding and an application, FSE 2001. Lect. Notes Comput. Sci. 2355: 196\u2013210","journal-title":"Lect. Notes Comput. Sci."},{"key":"74_CR31","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/3-540-46796-3_28","volume":"1719","author":"P.C. Fossorier Marc","year":"1999","unstructured":"Fossorier Marc P.C., Mihaljevi\u0107 M.J. and Imai H. (1999). Critical noise for convergence of iterative probabilistic decoding with belief propagation in cryptographic applications, applied algebra, algebraic algorithms and error correcting codes\u2014AAECC 13. Lect. Notes Comput. Sci. 1719: 282\u2013293","journal-title":"Lect. Notes Comput. Sci."},{"key":"74_CR32","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/3-540-48910-X_24","volume":"1592","author":"T. Johansson","year":"1999","unstructured":"Johansson T. and Jonsson F. (1999). Improved fast correlation attacks on stream ciphers via convolutional codes, advanced in cryptology\u2014EUROCRYPTO\u201999. Lect. Notes Comput. Sci. 1592: 347\u2013362","journal-title":"Lect. Notes Comput. Sci."},{"key":"74_CR33","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/3-540-48405-1_12","volume":"1666","author":"T. Johansson","year":"1999","unstructured":"Johansson T. and Jonsson F. (1999). Fast correlation attacks based on turbo code techniques, advances in cryptology\u2014CRYPTO\u201999. Lect. Notes Comput. Sci. 1666: 181\u2013197","journal-title":"Lect. Notes Comput. Sci."},{"key":"74_CR34","unstructured":"Matsumoto, T., Imai, H.: Public quadratic polynomial-tuples for efficient signature-verification and message-encryption, EUROCRYPTf88. Springer, Heidelberg, pp. 419\u2013453, (1988)"},{"key":"74_CR35","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/3-540-46796-3_23","volume":"1719","author":"M. Grassl","year":"1999","unstructured":"Grassl M., Geiselmann W. and Beth T. (1999). Quantum Reed-Solomon codes, AAECC 13. Lect. Notes Comput. Sci. 1719: 231\u2013244","journal-title":"Lect. Notes Comput. Sci."},{"key":"74_CR36","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1103\/PhysRevA.54.1098","volume":"54","author":"A.R. Calderbank","year":"1996","unstructured":"Calderbank A.R. and Shor P.W. (1996). Good quantum error correcting codes exist. Phys. Rev. A 54: 1098\u20131105","journal-title":"Phys. Rev. A"},{"key":"74_CR37","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1098\/rspa.1996.0136","volume":"452","author":"A.M. Steane","year":"1996","unstructured":"Steane A.M. (1996). Multiple particle interference and quantum error correction. Proc. Roy. Soc. London A 452: 2551\u20132577","journal-title":"Proc. Roy. Soc. London A"},{"key":"74_CR38","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1103\/PhysRevLett.85.441","volume":"85","author":"P.W. Shor","year":"2000","unstructured":"Shor P.W. and Preskill J. (2000). Simple proof of security of the BB84 quantum key distribution protocol. Phys. Rev. Lett. 85: 441\u2013444","journal-title":"Phys. Rev. Lett."},{"issue":"5410","key":"74_CR39","doi-asserted-by":"crossref","first-page":"2050","DOI":"10.1126\/science.283.5410.2050","volume":"283","author":"H.-K. Lo","year":"1999","unstructured":"Lo H.-K. and Chau H.F. (1999). Unconditional security of quantum key distribution over arbitrarily long distances. Science 283(5410): 2050\u20132056","journal-title":"Science"},{"issue":"10","key":"74_CR40","doi-asserted-by":"crossref","first-page":"2315","DOI":"10.1109\/TIT.2004.834737","volume":"50","author":"D. MacKay","year":"2004","unstructured":"MacKay D., Mitchison G. and McFadden P. (2004). Sparse graph codes for quantum error-correction, quant-ph\/0304161. IEEE Trans. Inf. Theory 50(10): 2315\u20132330","journal-title":"IEEE Trans. Inf. Theory"},{"key":"74_CR41","doi-asserted-by":"crossref","unstructured":"Hagiwara, M., Imai, H.: A simple construction of quantum quasi-cyclic LDPC codes. In: Proceeding of HISC 2007","DOI":"10.1109\/ISIT.2007.4557323"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-008-0074-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-008-0074-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-008-0074-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,3]],"date-time":"2020-05-03T16:56:36Z","timestamp":1588524996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-008-0074-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,2]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["74"],"URL":"https:\/\/doi.org\/10.1007\/s00200-008-0074-0","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,2]]}}}