{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:10:34Z","timestamp":1773655834972,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642227912","type":"print"},{"value":"9783642227929","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22792-9_43","type":"book-chapter","created":{"date-parts":[[2011,8,5]],"date-time":"2011-08-05T15:32:14Z","timestamp":1312558334000},"page":"761-779","source":"Crossref","is-referenced-by-count":46,"title":["McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks"],"prefix":"10.1007","author":[{"given":"Hang","family":"Dinh","sequence":"first","affiliation":[]},{"given":"Cristopher","family":"Moore","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Russell","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","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":"43_CR2","doi-asserted-by":"crossref","unstructured":"Courtois, N., 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)","DOI":"10.1007\/3-540-45682-1_10"},{"key":"43_CR3","unstructured":"Dinh, H., Moore, C., Russell, A.: The McEliece cryptosystem resists quantum Fourier sampling attacks, preprint (2010), \n                    \n                      http:\/\/arxiv.org\/abs\/1008.2390"},{"key":"43_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1515\/JMC.2007.009","volume":"1","author":"D. Engelbert","year":"2007","unstructured":"Engelbert, D., Overbeck, R., Schmidt, A.: A summary of McEliece-type cryptosystems and their security. J. Math. Crypt.\u00a01, 151\u2013199 (2007)","journal-title":"J. Math. Crypt."},{"key":"43_CR5","volume-title":"Representation Theory - A First Course.","author":"W. Fulton","year":"1991","unstructured":"Fulton, W., Harris, J.: Representation Theory - A First Course. Springer-Verlag, New York Inc., Heidelberg (1991)"},{"issue":"1","key":"43_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00493-004-0009-8","volume":"24","author":"M. Grigni","year":"2004","unstructured":"Grigni, M., Schulman, J., Vazirani, M., Vazirani, U.: Quantum mechanical algorithms for the nonabelian hidden subgroup problem. Combinatorica\u00a024(1), 137\u2013154 (2004)","journal-title":"Combinatorica"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Hallgren, S., Moore, C., R\u00f6tteler, M., Russell, A., Sen, P.: Limitations of quantum coset states for graph isomorphism. In: STOC 2006: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 604\u2013617 (2006)","DOI":"10.1145\/1132516.1132603"},{"key":"43_CR8","unstructured":"Kempe, J., Shalev, A.: The hidden subgroup problem and permutation group theory. In: SODA 2005: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1118\u20131125 (2005)"},{"issue":"4","key":"43_CR9","doi-asserted-by":"publisher","first-page":"553","DOI":"10.4171\/GGD\/24","volume":"1","author":"J. Kempe","year":"2007","unstructured":"Kempe, J., Pyber, L., Shalev, A.: Permutation groups, minimal degrees and quantum computing. Groups, Geometry, and Dynamics\u00a01(4), 553\u2013584 (2007), \n                    \n                      http:\/\/xxx.lanl.gov\/abs\/quant-ph\/0607204","journal-title":"Groups, Geometry, and Dynamics"},{"issue":"1","key":"43_CR10","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1109\/18.272496","volume":"40","author":"Y.X. Li","year":"1994","unstructured":"Li, Y.X., Deng, R.H., Wang, X.M.: On the equivalence of McElieces and Niederreiters public-key cryptosystems. IEEE Transactions on Information Theory\u00a040(1), 271\u2013273 (1994)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"43_CR11","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1109\/18.915687","volume":"47","author":"P. Loidreau","year":"2001","unstructured":"Loidreau, P., Sendrier, N.: Weak keys in the McEliece public-key cryptosystem. IEEE Transactions on Information Theory\u00a047(3), 1207\u20131212 (2001)","journal-title":"IEEE Transactions on Information Theory"},{"key":"43_CR12","unstructured":"Lomont, C.: The hidden subgroup problem - review and open problems (2004), \n                    \n                      http:\/\/arXiv.org:quantph\/0411037"},{"key":"43_CR13","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. JPL DSN Progress Report, 114\u2013116 (1978)"},{"key":"43_CR14","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916","volume-title":"Handbook of applied cryptography","author":"A.J. Menezes","year":"1996","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC Press, Boca Raton (1996)"},{"key":"43_CR15","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1137\/050644896","volume":"37","author":"C. Moore","year":"2008","unstructured":"Moore, C., Russell, A., Schulman, L.J.: The symmetric group defies strong quantum Fourier sampling. SIAM Journal of Computing\u00a037, 1842\u20131864 (2008)","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"43_CR16","first-page":"159","volume":"15","author":"H. Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory. Problemy Upravlenija i Teorii Informacii\u00a015(2), 159\u2013166 (1986)","journal-title":"Problems of Control and Information Theory. Problemy Upravlenija i Teorii Informacii"},{"issue":"5","key":"43_CR17","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1109\/18.623157","volume":"43","author":"E. Petrank","year":"1997","unstructured":"Petrank, E., Roth, R.M.: Is code equivalence easy to decide? IEEE Transactions on Information Theory\u00a043(5), 1602\u20131604 (1997), doi:10.1109\/18.623157","journal-title":"IEEE Transactions on Information Theory"},{"key":"43_CR18","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC 2005: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"issue":"3","key":"43_CR19","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s002220050083","volume":"125","author":"Y. Roichman","year":"1996","unstructured":"Roichman, Y.: Upper bound on the characters of the symmetric groups. Invent. Math.\u00a0125(3), 451\u2013485 (1996)","journal-title":"Invent. Math."},{"key":"43_CR20","doi-asserted-by":"crossref","unstructured":"Ryan, J.A.: Excluding some weak keys in the McEliece cryptosystem. In: Proceedings of the 8th IEEE Africon, pp. 1\u20135 (2007)","DOI":"10.1109\/AFRCON.2007.4401626"},{"issue":"4","key":"43_CR21","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/18.850662","volume":"46","author":"N. Sendrier","year":"2000","unstructured":"Sendrier, N.: Finding the permutation between equivalent linear codes: the support splitting algorithm. IEEE Transactions on Information Theory\u00a046(4), 1193\u20131203 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"43_CR22","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P..W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing\u00a026, 1484\u20131509 (1997)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"43_CR23","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1515\/dma.1992.2.4.439","volume":"2","author":"V.M. Sidelnikov","year":"1992","unstructured":"Sidelnikov, V.M., Shestakov, S.O.: On insecurity of cryptosystems based on generalized Reed-Solomon codes. Discrete Mathematics and Applications\u00a02(4), 439\u2013444 (1992)","journal-title":"Discrete Mathematics and Applications"},{"issue":"5","key":"43_CR24","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"D.R. Simon","year":"1997","unstructured":"Simon, D.R.: On the power of quantum computation. SIAM J. Comput.\u00a026(5), 1474\u20131483 (1997)","journal-title":"SIAM J. Comput."},{"key":"43_CR25","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0021-8693(90)90104-V","volume":"130","author":"H. Stichtenoth","year":"1990","unstructured":"Stichtenoth, H.: On automorphisms of geometric Goppa codes. Journal of Algebra\u00a0130, 113\u2013121 (1990)","journal-title":"Journal of Algebra"},{"key":"43_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-00174-5","volume-title":"Introduction to coding theory","author":"J.H. Lint van","year":"1992","unstructured":"van Lint, J.H.: Introduction to coding theory, 2nd edn. Springer, Heidelberg (1992)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22792-9_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T11:36:38Z","timestamp":1620041798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22792-9_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642227912","9783642227929"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22792-9_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}