{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:46:19Z","timestamp":1761648379202},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,8,23]],"date-time":"2016-08-23T00:00:00Z","timestamp":1471910400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s11277-016-3596-y","type":"journal-article","created":{"date-parts":[[2016,8,23]],"date-time":"2016-08-23T14:58:17Z","timestamp":1471964297000},"page":"1107-1123","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Public Key Cryptosystem Based on Low Density Lattice Codes"],"prefix":"10.1007","volume":"92","author":[{"given":"Reza","family":"Hooshmand","sequence":"first","affiliation":[]},{"given":"Mohammad Reza","family":"Aref","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"key":"3596_CR1","volume-title":"Post-quantum cryptography","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D. J., Buchmann, J., & Dahmen, E. (2008). Post-quantum cryptography. Berlin: Springer."},{"key":"3596_CR2","unstructured":"McEliece, R. J. (1978). A public-key cryptosystem based on algebraic coding Theory. DNS Progress Report, Jet Propulsion Labaratory, CA, Pasadena (pp. 114\u2013116)."},{"key":"3596_CR3","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S. (1997). Public-key cryptosystems from lattice reduction problems. Crypto\u201997, LNCS 1294 (pp. 112\u2013131).","DOI":"10.1007\/BFb0052231"},{"issue":"4","key":"3596_CR4","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1109\/TIT.2008.917684","volume":"54","author":"N Sommer","year":"2008","unstructured":"Sommer, N., Feder, M., & Shalvi, O. (2008). Low density lattice codes. IEEE Transactions on Information Theory, 54(4), 1561\u20131585.","journal-title":"IEEE Transactions on Information Theory"},{"key":"3596_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0897-7","volume-title":"Complexity of lattice problems, a cryptographic perspective","author":"D Micciancio","year":"2002","unstructured":"Micciancio, D., & Goldwasser, S. (2002). Complexity of lattice problems, a cryptographic perspective. Berlin: Springer."},{"key":"3596_CR6","unstructured":"Banihashemi, A. H. (1997). Decoding complexity and trellis structure of lattices. Ph.D. dissertation, E&CE Dept., Univ. of Waterloo, Waterloo, Ontario, Canada."},{"key":"3596_CR7","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A. (1998). Theory of linear and integer programming. London: Wiley."},{"issue":"1\u20133","key":"3596_CR8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0024-3795(98)10012-5","volume":"282","author":"A Storjohann","year":"1998","unstructured":"Storjohann, A. (1998). Computing Hermite and Smith normal forms of triangular integer matrices. Linear Algebra and its Applications, 282(1\u20133), 25\u201345.","journal-title":"Linear Algebra and its Applications"},{"key":"3596_CR9","doi-asserted-by":"crossref","unstructured":"Micciancio, D. (2001). Improving lattice based cryptosystems using the Hermite normal form. CaLC 2001, LNCS 2146 (pp. 126\u2013145).","DOI":"10.1007\/3-540-44670-2_11"},{"key":"3596_CR10","unstructured":"Ajtai, M. (1996). Generating hard instances of lattice problems. 28th Annual ACM Symposium on Theory of Computing (pp. 99\u2013108)."},{"key":"3596_CR11","doi-asserted-by":"crossref","unstructured":"Plantard, T., Susilo, W. (2009). Broadcast attacks against lattice-based cryptosystems. Applied Cryptography and Network Security, LNCS 5536 (pp. 456\u2013472).","DOI":"10.1007\/978-3-642-01957-9_28"},{"key":"3596_CR12","unstructured":"Van Emde Boas, P. (1981). Another NP-complete partition problem and the complexity of computing short vectors in a lattice. Rep. 81-04, Dept. of Math., Univ. of Amsterdam, Amsterdam, The Netherlands."},{"issue":"10","key":"3596_CR13","doi-asserted-by":"crossref","first-page":"2293","DOI":"10.1109\/TIT.2004.834787","volume":"50","author":"U Erez","year":"2004","unstructured":"Erez, U., & Zamir, R. (2004). Achieving 1\/2 log(1\u00a0+\u00a0SNR) on the AWGN channel with lattice encoding and decoding. IEEE Transactions on Information Theory, 50(10), 2293\u20132314.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"3596_CR14","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1109\/18.312163","volume":"40","author":"G Poltyrev","year":"1994","unstructured":"Poltyrev, G. (1994). On coding without restrictions for the AWGN channel. IEEE Transactions on Information Theory, 40(2), 409\u2013417.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"3596_CR15","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H. (1986). Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory, 15(2), 159\u2013166.","journal-title":"Problems of Control and Information Theory"},{"issue":"1","key":"3596_CR16","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10623-003-6151-2","volume":"35","author":"TP Berger","year":"2005","unstructured":"Berger, T. P., & Pierre, L. (2005). How to mask the structure of codes for a cryptographic use. Designs, Codes and Cryptography, 35(1), 63\u201379.","journal-title":"Designs, Codes and Cryptography"},{"issue":"3","key":"3596_CR17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1515\/dma.1994.4.3.191","volume":"4","author":"VM Sidelnikov","year":"1994","unstructured":"Sidelnikov, V. M. (1994). A public-key cryptosytem based on Reed Muller codes. Discrete Math Appl, 4(3), 191\u2013207.","journal-title":"Discrete Math Appl"},{"issue":"3","key":"3596_CR18","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/A:1027351723034","volume":"8","author":"J Janwa","year":"1996","unstructured":"Janwa, J., & Moreno, O. (1996). McEliece public key cryptosystems using algebraic-geometric codes. Designs, Codes and Cryptography, 8(3), 293\u2013307.","journal-title":"Designs, Codes and Cryptography"},{"issue":"3","key":"3596_CR19","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1049\/iet-ifs.2012.0127","volume":"7","author":"M Baldi","year":"2013","unstructured":"Baldi, M., Bianchi, M., & Chiaraluce, F. (2013). Security and complexity of the McEliece cryptosystem based on quasi-cyclic low-density parity-check codes. IET Information Security, 7(3), 212\u2013220.","journal-title":"IET Information Security"},{"key":"3596_CR20","doi-asserted-by":"crossref","unstructured":"Bernstein, D. J., Lange, T., Peters, C. (2011). Wild McEliece Incognito. Post-Quantum Cryptography, LNCS 7071 (pp. 244\u2013254).","DOI":"10.1007\/978-3-642-25405-5_16"},{"key":"3596_CR21","unstructured":"Misoczki, R., Tillich, J. P., Sendrier, N., Barreto, P. S. L. M. (2012). MDPC-McEliece: New McEliece variants from moderate density parity-check codes. IACR Cryptology ePrint Archive, Report 2012\/409, 2012."},{"key":"3596_CR22","unstructured":"L\u00a8ondahl, C., Johansson, T. (2012). A new version of McEliece PKC based on convolutional codes. Information and Communications Security (ICICS), LNCS 7168 (pp. 461\u2013470)."},{"key":"3596_CR23","doi-asserted-by":"crossref","unstructured":"Hooshmand, R., Koochak Shooshtari, M., Eghlidos, T., Aref, M. R. (2014). Reducing the key length of McEliece cryptosystem using polar codes. In 11th International ISC Conference on Information Security and Cryptology (ISCISC) (pp. 104\u2013108).","DOI":"10.1109\/ISCISC.2014.6994031"},{"key":"3596_CR24","doi-asserted-by":"crossref","unstructured":"Shrestha, S. R., Kim, Y. S. (2014). New McEliece cryptosystem based on polar codes as a candidate for post-quantum cryptography. In 14th International Symposium on Communications and Information Technologies (ISCIT) (pp. 368\u2013372).","DOI":"10.1109\/ISCIT.2014.7011934"},{"key":"3596_CR25","unstructured":"Nguyen, P. Q. (1999). Cryptanalysis of the Goldreich-Goldwasser-Halevi cryptosystem from crypto 1997. Crypto\u201999, LNCS 1666 (pp. 288\u2013304)."},{"key":"3596_CR26","doi-asserted-by":"crossref","unstructured":"Paeng, S. H., Jung, B. E., Ha, K. C. (2003). A lattice based public key cryptosystem using polynomial representations. PKC 2003, LNCS 2567 (pp. 292\u2013308).","DOI":"10.1007\/3-540-36288-6_22"},{"key":"3596_CR27","unstructured":"Han, D., Kim, M. H., Yeom, Y. (2007). Cryptanalysis of the Paeng-Jung-Ha cryptosystem from PKC 2003, PKC 2007, LNCS 4450 (pp. 107\u2013117)."},{"key":"3596_CR28","unstructured":"Ludwig, C. (2004). The security and efficiency of Micciancio\u2019s cryptosystem, Cryptology ePrint Archive, Report 2004\/209. http:\/\/eprint.iacr.org\/ ."},{"key":"3596_CR29","unstructured":"Yoshino, M., Kunihiro, N. (2012). Improving GGH cryptosystem for large error vector. In International Symposium on Information Theory and its Applications (pp. 416\u2013420)."},{"key":"3596_CR30","doi-asserted-by":"crossref","unstructured":"Barguil, J. M. M., Lino, R. Y., Barreto, P. S. L. M. (2014). Efficient variants of the GGH-YK-M cryptosystem. In Proceedings of XIV Simp\u00f3sio Brasileiro em Seguran\u00e7a da Informa\u00e7\u00e3o e de Sistemas Computacionais (SBSeg 2014) (pp. 100\u2013111).","DOI":"10.5753\/sbseg.2014.20124"},{"key":"3596_CR31","unstructured":"Barros, C. F., Menasche Schechter, L. (2014). GGH may not be dead after all. In Proceedings of XXXV Brazilian National Congress in Applied and Computational Mathematics (CNMAC 2014)."},{"issue":"2","key":"3596_CR32","first-page":"115","volume":"7","author":"R Ebrahimi Atani","year":"2015","unstructured":"Ebrahimi Atani, R., Ebrahimi Atani, S., & Hassani Karbasi, A. (2015). EEH: A GGH-like public key cryptosystem over the Eisenstein integers using polynomial representations. ISeCure, 7(2), 115\u2013126.","journal-title":"ISeCure"},{"issue":"1","key":"3596_CR33","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/s00145-011-9114-1","volume":"26","author":"E Fujisaki","year":"2013","unstructured":"Fujisaki, E., & Okamoto, T. (2013). Secure integration of asymmetric and symmetric encryption schemes. Journal of Cryptology, 26(1), 80\u2013101.","journal-title":"Journal of Cryptology"},{"issue":"1","key":"3596_CR34","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1049\/iet-com.2015.0713","volume":"10","author":"R Hooshmand","year":"2016","unstructured":"Hooshmand, R., & Aref, M. R. (2016). Efficient secure channel coding scheme based on low-density lattice codes. IET Communications, 10(11), 1365\u20131373.","journal-title":"IET Communications"},{"key":"3596_CR35","doi-asserted-by":"crossref","unstructured":"Berson, T. A. (1997). Failure of the McEliece public-key cryptosystem under message-resend and related-message attack. CRYPTO\u02bc97, LNCS 1294 (pp. 213\u2013220).","DOI":"10.1007\/BFb0052237"},{"key":"3596_CR36","doi-asserted-by":"crossref","unstructured":"Pointcheval, D. (2000). Chosen-ciphertext security for any one-way cryptosystem. PKC 2000 (pp. 129\u2013146).","DOI":"10.1007\/978-3-540-46588-1_10"},{"key":"3596_CR37","doi-asserted-by":"crossref","unstructured":"Kobara, K., Imai, H. (2001). Semantically secure McEliece public-key cryptosystems conversions for McEliece PKC. In 4th International Workshop on Practice and Theory in Public Key Cryptosystems, Korea (pp. 19\u201335).","DOI":"10.1007\/3-540-44586-2_2"},{"key":"3596_CR38","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A. K., Lenstra, H. W., & Lovasz, L. (1982). Factoring polynomials with rational coefficients. Mathematische Annalen, 261, 513\u2013534.","journal-title":"Mathematische Annalen"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-016-3596-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-016-3596-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-016-3596-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-016-3596-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T20:26:02Z","timestamp":1692476762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-016-3596-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,23]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["3596"],"URL":"https:\/\/doi.org\/10.1007\/s11277-016-3596-y","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,23]]}}}