{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:41:47Z","timestamp":1743010907960,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642278891"},{"type":"electronic","value":"9783642278907"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-27890-7_9","type":"book-chapter","created":{"date-parts":[[2012,2,27]],"date-time":"2012-02-27T10:50:53Z","timestamp":1330339853000},"page":"109-120","source":"Crossref","is-referenced-by-count":2,"title":["A General NTRU-Like Framework for Constructing Lattice-Based Public-Key Cryptosystems"],"prefix":"10.1007","author":[{"given":"Yanbin","family":"Pan","sequence":"first","affiliation":[]},{"given":"Yingpu","family":"Deng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","first-page":"99","volume-title":"The 28th STOC","author":"M. Ajtai","year":"1996","unstructured":"Ajtai, M.: Gennerating hard instances of lattice problems. In: The 28th STOC, pp. 99\u2013108. ACM, New York (1996)"},{"key":"9_CR2","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/1060590.1060604","volume-title":"The 37th STOC","author":"M. Ajtai","year":"2005","unstructured":"Ajtai, M.: Representing hard lattices with O(nlogn) bits. In: The 37th STOC, pp. 94\u2013103. ACM, New York (2005)"},{"key":"9_CR3","first-page":"284","volume-title":"The 29th STOC","author":"M. Ajtai","year":"1997","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: The 29th STOC, pp. 284\u2013293. ACM, New York (1997)"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L. Babai","year":"1986","unstructured":"Babai, L.: On Lov\u00e1sz lattice reduction and the nearest lattice point problem. Combinatorica\u00a06, 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-36231-2_6","volume-title":"Progress in Cryptology - INDOCRYPT 2002","author":"W.D. Banks","year":"2002","unstructured":"Banks, W.D., Shparlinski, I.E.: A Variant of NTRU with Non-Invertible Polynomials. In: Menezes, A., Sarkar, P. (eds.) INDOCRYPT 2002. LNCS, vol.\u00a02551, pp. 62\u201370. Springer, Heidelberg (2002)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-48892-8_18","volume-title":"Selected Areas in Cryptography","author":"J.-Y. Cai","year":"1999","unstructured":"Cai, J.-Y., Cusick, T.W.: A Lattice-Based Public-Key Cryptosystem. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol.\u00a01556, pp. 219\u2013233. Springer, Heidelberg (1999)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/11596219_19","volume-title":"Progress in Cryptology - INDOCRYPT 2005","author":"M. Coglianese","year":"2005","unstructured":"Coglianese, M., Goi, B.-M.: MaTRU: A New NTRU-Based Cryptosystem. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol.\u00a03797, pp. 232\u2013243. Springer, Heidelberg (2005)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-69053-0_5","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D., Shamir, A.: Lattice Attacks on NTRU. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 52\u201361. Springer, Heidelberg (1997)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Transactions on Information Theory\u00a022, 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Public-Key Cryptosystems from Lattice Reduction Problems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 112\u2013131. Springer, Heidelberg (1997)"},{"key":"9_CR11","first-page":"197","volume-title":"The 40th STOC","author":"C. Gentry","year":"2008","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: The 40th STOC, pp. 197\u2013206. ACM, New York (2008)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-74143-5_9","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"N. Howgrave-Graham","year":"2007","unstructured":"Howgrave-Graham, N.: A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 150\u2013169. Springer, Heidelberg (2007)"},{"unstructured":"Howgrave-Graham, N., Silverman, J.H., Whyte, W.: A Meet-In-The-Meddle Attack on an NTRU Private Key. Technical report, http:\/\/www.ntru.com\/cryptolab\/technotes.htm#004","key":"9_CR13"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J. Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A Ring-Based Public Key Cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 267\u2013288. Springer, Heidelberg (1998)"},{"unstructured":"Gaborit, P., Ohler, J., Sole, P.: CTRU, a polynomial analogue of NTRU. INRIA, Rapport de recherche 4621, INRIA (2002), ftp:\/\/ftp.inria.fr\/INRIA\/publication\/publi-pdf\/RR\/RR-4621.pdf","key":"9_CR15"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coeffcients. Math. Ann.\u00a0261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"doi-asserted-by":"crossref","unstructured":"Malekian, E., Zakerolhosseini, A.: Ntru-like Public Key Cryptosystems beyond Dedekind Domain Up to Alternative Algebra, http:\/\/eprint.iacr.org\/2009\/446","key":"9_CR17","DOI":"10.1007\/978-3-642-17499-5_2"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-44670-2_10","volume-title":"Cryptography and Lattices","author":"A. May","year":"2001","unstructured":"May, A., Silverman, J.H.: Dimension Reduction Methods for Convolution Modular Lattices. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 110\u2013125. Springer, Heidelberg (2001)"},{"issue":"5","key":"9_CR19","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"R. Merkle","year":"1978","unstructured":"Merkle, R., Hellman, M.: Hiding Information and Signatures in Trapdoor Knapsacks. IEEE Transactions on Information Theory\u00a024(5), 525\u2013530 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BFb0055731","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"P. Nguyen","year":"1998","unstructured":"Nguyen, P., Stern, J.: Cryptanalysis of the Ajtai-Dwork Cryptosystem. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 223\u2013242. Springer, Heidelberg (1998)"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-48405-1_18","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"P. Nguyen","year":"1999","unstructured":"Nguyen, P.: Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto\u201997. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 288\u2013304. Springer, Heidelberg (1999)"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"1780","DOI":"10.1109\/TIT.2010.2103790","volume":"57","author":"Y. Pan","year":"2011","unstructured":"Pan, Y., Deng, Y.: A Ciphertext-Only Attack Against the Cai-Cusick Lattice-Based Public-Key Cryptosystem. IEEE Transactions on Information Theory\u00a057, 1780\u20131785 (2011)","journal-title":"IEEE Transactions on Information Theory"},{"key":"9_CR23","first-page":"333","volume-title":"The 41th STOC","author":"C. Peikert","year":"2009","unstructured":"Peikert, C.: Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem. In: The 41th STOC, pp. 333\u2013342. ACM, New York (2009)"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1145\/1039488.1039490","volume":"51","author":"O. Regev","year":"2004","unstructured":"Regev, O.: New lattice-based cryptographic constructions. Journal of the ACM\u00a051, 899\u2013942 (2004)","journal-title":"Journal of the ACM"},{"key":"9_CR25","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/1060590.1060603","volume-title":"The 37th STOC","author":"O. Regev","year":"2005","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: The 37th STOC, pp. 84\u201393. ACM, New York (2005)"},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM, Mach.\u00a021, 120\u2013126 (1978)","journal-title":"Communications of the ACM, Mach."},{"key":"9_CR27","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/SFCS.1994.365700","volume-title":"The 35th Annual Symposium on Foundations of Computer Science","author":"P. Shor","year":"1994","unstructured":"Shor, P.: Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In: The 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE Computer Science Press, Santa Fe (1994)"},{"unstructured":"Shoup, V.: NTL: A library for doing number theory, http:\/\/www.shoup.net\/ntl\/","key":"9_CR28"},{"unstructured":"Vats, N.: NNRU, a noncommutative analogue of NTRU, http:\/\/arxiv.org\/abs\/0902.1891","key":"9_CR29"}],"container-title":["Lecture Notes in Computer Science","Information Security Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27890-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T19:10:26Z","timestamp":1713640226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27890-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642278891","9783642278907"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27890-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}