{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T05:23:37Z","timestamp":1787030617526,"version":"3.56.0"},"reference-count":30,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2019]]},"DOI":"10.3934\/amc.2019035","type":"journal-article","created":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T23:53:48Z","timestamp":1561161228000},"page":"559-578","source":"Crossref","is-referenced-by-count":6,"title":["Some cryptanalytic and coding-theoretic applications of a soft stern algorithm"],"prefix":"10.3934","volume":"13","author":[{"given":"Qian","family":"Guo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Johansson","sequence":"additional","affiliation":[{"name":"Department of Electrical and Information Technology, Lund University, Box 118, SE-22100 Lund, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erik","family":"M\u00e5rtensson","sequence":"additional","affiliation":[{"name":"Department of Electrical and Information Technology, Lund University, Box 118, SE-22100 Lund, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul Stankovski","family":"Wagner","sequence":"additional","affiliation":[{"name":"Department of Electrical and Information Technology, Lund University, Box 118, SE-22100 Lund, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2019035-1","doi-asserted-by":"crossref","unstructured":"

M. Baldi, N. Maturo, E. Paolini and F. Chiaraluce, On the use of ordered statistics decoders for low-density parity-check codes in space telecommand links, EURASIP Journal on Wireless Communications and Networking<\/i>, 2016<\/b> (2016), 272.<\/p>","DOI":"10.1186\/s13638-016-0769-z"},{"key":"key-10.3934\/amc.2019035-2","doi-asserted-by":"crossref","unstructured":"

M. Baldi, P. Santini and F. Chiaraluce, Soft McEliece: MDPC code-based McEliece cryptosystems with very compact keys through real-valued intentional errors, in IEEE International Symposium on Information Theory ISIT<\/i>, IEEE, (2016), 795\u2013799.<\/p>","DOI":"10.1109\/ISIT.2016.7541408"},{"key":"key-10.3934\/amc.2019035-3","doi-asserted-by":"crossref","unstructured":"

A. Becker, A. Joux, A. May and A. Meurer, Decoding random binary linear codes in $2^{n\/20}$: How 1 + 1 = 0 improves information set decoding, in Advances in Cryptology \u2013 EUROCRYPT<\/i> (eds. D. Pointcheval and T. Johansson), Springer, 7237<\/b> (2012), 520\u2013536.<\/p>","DOI":"10.1007\/978-3-642-29011-4_31"},{"key":"key-10.3934\/amc.2019035-4","doi-asserted-by":"crossref","unstructured":"

S. Bela\u00efd, J.-S. Coron, P.-A. Fouque, B. G\u00e8rard, J.-G. Kammerer and E. Prouff, Improved Side-Channel Analysis of Finite-Field Multiplication, in Cryptographic Hardware and Embedded Systems \u2013 CHES<\/i> (eds. T. G\u00fcneysu and H. Handschuh), Springer, (2015), 395\u2013415.<\/p>","DOI":"10.1007\/978-3-662-48324-4_20"},{"key":"key-10.3934\/amc.2019035-5","doi-asserted-by":"crossref","unstructured":"

S. Bela\u00efd, P.-A. Fouque and B. G\u00e8rard, Side-channel analysis of multiplications in GF($2^{128}$), in Advances in Cryptology \u2013 ASIACRYPT<\/i> (eds. P. Sarkar and T. Iwata), Springer, 8874<\/b> (2014), 306\u2013325.<\/p>","DOI":"10.1007\/978-3-662-45608-8_17"},{"key":"key-10.3934\/amc.2019035-6","doi-asserted-by":"crossref","unstructured":"

D. J. Bernstein, T. Lange and C. Peters, Smaller decoding exponents: Ball-collision decoding, in Advances in Cryptology \u2013 CRYPTO<\/i> (eds. P. Rogaway), Springer, 6841<\/b> (2011), 743\u2013760.<\/p>","DOI":"10.1007\/978-3-642-22792-9_42"},{"key":"key-10.3934\/amc.2019035-7","doi-asserted-by":"crossref","unstructured":"

D. J. Bernstein, T. Lange and C. Peters, Attacking and Defending the McEliece Cryptosystem, in International Workshop on Post-Quantum Cryptography \u2013 PQCrypto<\/i> (eds. J. Buchmann and J. Ding), Springer, 5299<\/b> (2008), 31\u201346.<\/p>","DOI":"10.1007\/978-3-540-88403-3_3"},{"key":"key-10.3934\/amc.2019035-8","doi-asserted-by":"publisher","DOI":"10.1109\/18.651067"},{"key":"key-10.3934\/amc.2019035-9","doi-asserted-by":"publisher","DOI":"10.1109\/tit.1972.1054746"},{"key":"key-10.3934\/amc.2019035-10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057135"},{"key":"key-10.3934\/amc.2019035-11","doi-asserted-by":"publisher","DOI":"10.1109\/18.796373"},{"key":"key-10.3934\/amc.2019035-12","doi-asserted-by":"crossref","unstructured":"

S. Dziembowski, S. Faust, G. Herold, A. Journault, D. Masny and F. Standaert, Towards sound fresh re-keying with hard (physical) learning problems, in Advances in Cryptology \u2013 CRYPTO<\/i> (eds. M. Robshaw and J. Katz), Springer, 9815<\/b> (2016), 272\u2013301.<\/p>","DOI":"10.1007\/978-3-662-53008-5_10"},{"key":"key-10.3934\/amc.2019035-13","doi-asserted-by":"crossref","unstructured":"

M. Finiasz and N. Sendrier, Security bounds for the design of code-based cryptosystems, in Advances in Cryptology \u2013 ASIACRYPT<\/i>, (eds. M. Matsui), Springer, (2009), 88\u2013105.<\/p>","DOI":"10.1007\/978-3-642-10366-7_6"},{"key":"key-10.3934\/amc.2019035-14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1994.394624"},{"key":"key-10.3934\/amc.2019035-15","doi-asserted-by":"publisher","DOI":"10.1109\/18.567691"},{"key":"key-10.3934\/amc.2019035-16","doi-asserted-by":"crossref","unstructured":"

Q. Guo, T. Johansson, E. M\u00e5rtensson and P. Stankovski, Information Set Decoding with Soft Information and some Cryptographic Applications, in IEEE International Symposium on Information Theory \u2013 ISIT<\/i>, IEEE, (2017), 1793\u20131797.<\/p>","DOI":"10.1109\/ISIT.2017.8006838"},{"key":"key-10.3934\/amc.2019035-17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.819332"},{"key":"key-10.3934\/amc.2019035-18","doi-asserted-by":"crossref","unstructured":"

P. J. Lee and E. F. Brickell, An observation on the security of McEliece's public-key cryptosystem, in Workshop on the Theory and Application of Cryptographic Techniques<\/i>, Springer, 330<\/b> (1988), 275\u2013280.<\/p>","DOI":"10.1007\/3-540-45961-8_25"},{"key":"key-10.3934\/amc.2019035-19","doi-asserted-by":"crossref","unstructured":"

A. May and I. Ozerov, On computing nearest neighbors with applications to decoding of binary linear codes, in Advances in Cryptology - EUROCRYPT<\/i> (eds. E. Oswald and M. Fischlin), Springer, 9056<\/b> (2015), 203\u2013228.<\/p>","DOI":"10.1007\/978-3-662-46800-5_9"},{"key":"key-10.3934\/amc.2019035-20","doi-asserted-by":"crossref","unstructured":"

R. Misoczki, J. P. Tillich, N. Sendrier and P. S. Barreto, MDPC-McEliece: New McEliece variants from moderate density parity-check codes, in IEEE International Symposium on Information Theory \u2013 ISIT<\/i>, IEEE, (2013), 2069\u20132073.<\/p>","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"key-10.3934\/amc.2019035-21","doi-asserted-by":"crossref","unstructured":"

P. Pessl, L. Groot Bruinderink and Y. Yarom, To BLISS-B or not to be: Attacking strongSwan's Implementation of Post-Quantum Signatures, in ACM SIGSAC Conference on Computer and Communications Security \u2013 CCS<\/i>, ACM, (2017), 1843\u20131855.<\/p>","DOI":"10.1145\/3133956.3134023"},{"key":"key-10.3934\/amc.2019035-22","doi-asserted-by":"crossref","unstructured":"

P. Pessl and S. Mangard, Enhancing side-channel analysis of binary-field multiplication with bit reliability, in RSA Conference Cryptographers' Track (CT-RSA)<\/i> (eds. K. Sako), 9610<\/b> (2016), 255\u2013270.<\/p>","DOI":"10.1007\/978-3-319-29485-8_15"},{"key":"key-10.3934\/amc.2019035-23","doi-asserted-by":"publisher","DOI":"10.1109\/tit.1962.1057777"},{"key":"key-10.3934\/amc.2019035-24","unstructured":"

The Sage Developers, SageMath, the Sage Mathematics Software System, http:\/\/www.sagemath.org<\/a>, 2018.<\/p>"},{"key":"key-10.3934\/amc.2019035-25","doi-asserted-by":"crossref","unstructured":"

J. Stern, A method for finding codewords of small weight, in Coding Theory and Applications<\/i> (eds. G. Cohen and J. Wolfmann), 388<\/b> (1988), 106\u2013113.<\/p>","DOI":"10.1007\/BFb0019850"},{"key":"key-10.3934\/amc.2019035-26","doi-asserted-by":"crossref","unstructured":"

A. Valembois, Fast soft-decision decoding of linear codes, stochastic resonance in algorithms, in IEEE International Symposium on Information Theory \u2013 ISIT<\/i>, IEEE, (2000), 91.<\/p>","DOI":"10.1109\/ISIT.2000.866381"},{"key":"key-10.3934\/amc.2019035-27","doi-asserted-by":"crossref","unstructured":"

A. Valembois and M. Fossorier, Generation of binary vectors that optimize a given weight function with application to soft-decision decoding, in IEEE Information Theory Workshop<\/i>, IEEE, (2001), 138\u2013140.<\/p>","DOI":"10.1109\/ITW.2001.955163"},{"key":"key-10.3934\/amc.2019035-28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.826644"},{"key":"key-10.3934\/amc.2019035-29","unstructured":"

A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding, <\/i>, McGraw-Hill, New York, 1979.<\/p>"},{"key":"key-10.3934\/amc.2019035-30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.889699"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:07:54Z","timestamp":1772791674000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2019035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2019035","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}