{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:14Z","timestamp":1725516794117},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_24","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"235-244","source":"Crossref","is-referenced-by-count":3,"title":["Algebraic Cryptanalysis of CTRU Cryptosystem"],"prefix":"10.1007","author":[{"given":"Nitin","family":"Vats","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","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\u00a0: 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":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/3-540-68339-9_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 178\u2013189. Springer, Heidelberg (1996)"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s001459900029","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small Solution to Polynomial Equations, and Low Exponent RSA Vulner-Abilities. Journal of Cryptology\u00a010, 223\u2013260 (1997)","journal-title":"Journal of Cryptology"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-44670-2_3","volume-title":"Cryptography and Lattices","author":"D. Coppersmith","year":"2001","unstructured":"Coppersmith, D.: Finding Small Solution to Small Degree Polynomials. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 20\u201331. Springer, Heidelberg (2001)"},{"key":"24_CR6","unstructured":"Gaborit, P., Ohler, J., Sole, P.: CTRU, a Polynomial Analogue of NTRU, INRIA. Rapport de recherche, N.4621 (November 2002), (ISSN 0249-6399), \n                    \n                      ftp:\/\/ftp.inria.fr\/INRIA\/publication\/publi-pdf\/RR\/RR-4621.pdf"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-36563-X_9","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"J. Hoffstein","year":"2003","unstructured":"Hoffstein, J., Howgrave-Graham, N., Pipher, J., Silverman, J.H., Whyte, W.: NTRUSign: Digital Signatures Using the NTRU Lattice. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 122\u2013140. Springer, Heidelberg (2003)"},{"key":"24_CR8","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. Hoffestein","year":"1998","unstructured":"Hoffestein, J., Pipher, J., Silverman, J.H.: NTRU\u00a0: A Ring-Based Public Key Cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 267\u2013288. Springer, Heidelberg (1998)"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-44987-6_14","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"J. Hoffestein","year":"2001","unstructured":"Hoffestein, J., Pipher, J., Silverman, J.H.: NSS: An NTRU Lattice-Based Signature Scheme. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 211\u2013228. Springer, Heidelberg (2001)"},{"key":"24_CR10","unstructured":"Hoffstein, J., Silverman, J.H.: Optimizations for NTRU. In: Public-Key Cryptography and computational Number Theory (2000)"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0166-218X(02)00588-7","volume":"130","author":"J. Hoffistein","year":"2000","unstructured":"Hoffistein, J., Silverman, J.H.: Random Small Hamming Weight Products with Applications to Cryptography. Discrete Applied Mathematics\u00a0130, 37\u201349 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/978-3-540-45146-4_14","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"N. Howgrave-Graham","year":"2003","unstructured":"Howgrave-Graham, N., Nguyen, P.Q., Pointcheval, D., Proos, J.: The Impact of Decrption Failures on the Security of NTRU Encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 226\u2013246. Springer, Heidelberg (2003)"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-44598-6_2","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"E. Jaulmes.","year":"2000","unstructured":"Jaulmes, E., Joux, A.: A Chosen Ciphertext Attack on NTRU. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 20\u201335. Springer, Heidelberg (2000)"},{"key":"24_CR14","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)"},{"key":"24_CR15","unstructured":"McEliece, R.J.: A Public-Key Cryptosystem Based on Alzebraic Coding Theory. JPL DSN Progress report 42-44, 114\u2013116 (1978)"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/3-540-45708-9_14","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"P.Q. Nguyen","year":"2002","unstructured":"Nguyen, P.Q., Pointcheval, D.: Analysis and Improvements of NTRU Encryption Paddings. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 210\u2013225. Springer, Heidelberg (2002)"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-44670-2_12","volume-title":"Cryptography and Lattices","author":"P.Q. Nguyen","year":"2001","unstructured":"Nguyen, P.Q., Stern, J.: The Two Faces of Lattice in Cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 148\u2013180. Springer, Heidelberg (2001)"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public Key Cryptosystem. Communications of the ACM\u00a021, 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C.P. Schnorr","year":"1987","unstructured":"Schnorr, C.P.: A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms. Theoretical Computer Science\u00a053, 201\u2013224 (1987)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:44:48Z","timestamp":1620017088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}