{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T17:08:33Z","timestamp":1748365713703,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:00:00Z","timestamp":1600473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:00:00Z","timestamp":1600473600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s11042-020-09706-8","type":"journal-article","created":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T08:03:53Z","timestamp":1600502633000},"page":"3089-3120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["An efficient and light weight polynomial multiplication for ideal lattice-based cryptography"],"prefix":"10.1007","volume":"80","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6139-7350","authenticated-orcid":false,"given":"Vijay Kumar","family":"Yadav","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shekhar","family":"Verma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Venkatesan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"key":"9706_CR1","doi-asserted-by":"crossref","unstructured":"Akleylek S, Bindel N, Buchmann J, Kr\u00e4mer J, Marson GA (2016) An efficient lattice-based signature scheme with provably secure instantiation. In: International conference on cryptology in africa. Springer, pp 44\u201360","DOI":"10.1007\/978-3-319-31517-1_3"},{"key":"9706_CR2","unstructured":"Alkim E, Ducas L, P\u00f6ppelmann T, Schwabe P (2016) Post-quantum key exchange\u2014a new hope. In: 25Th {USENIX} security symposium ({USENIX} security 16), pp 327\u2013343"},{"issue":"2","key":"9706_CR3","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s00145-017-9265-9","volume":"31","author":"S Bai","year":"2018","unstructured":"Bai S, Lepoint T, Roux-Langlois A, Sakzad A, Stehl\u00e9 D, Steinfeld R (2018) Improved security proofs in lattice-based cryptography: using the r\u00e9nyi divergence rather than the statistical distance. J Cryptol 31(2):610\u2013640","journal-title":"J Cryptol"},{"key":"9706_CR4","doi-asserted-by":"crossref","unstructured":"Bos JW, Costello C, Naehrig M, Stebila D (2015) Post-quantum key exchange for the tls protocol from the ring learning with errors problem. In: 2015 IEEE Symposium on security and privacy. IEEE, pp 553\u2013570","DOI":"10.1109\/SP.2015.40"},{"issue":"3","key":"9706_CR5","first-page":"13","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z, Gentry C, Vaikuntanathan V (2014) (leveled) fully homomorphic encryption without bootstrapping. ACM Trans Comput Theory (TOCT) 6(3):13","journal-title":"ACM Trans Comput Theory (TOCT)"},{"issue":"6","key":"9706_CR6","first-page":"583","volume":"17","author":"V Brita\u0148\u00e1k","year":"2012","unstructured":"Brita\u0148\u00e1k V (2012) A unified approach to fast computation of discrete sinusoidal transforms i: Dct and dst transforms. Comput Inf 17(6):583\u2013607","journal-title":"Comput Inf"},{"issue":"3","key":"9706_CR7","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1006\/acha.1997.0238","volume":"5","author":"A Calderbank","year":"1998","unstructured":"Calderbank A, Daubechies I, Sweldens W, Yeo BL (1998) Wavelet transforms that map integers to integers. Appl Comput Harmon Anal 5(3):332\u2013369","journal-title":"Appl Comput Harmon Anal"},{"issue":"1","key":"9706_CR8","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1049\/el:20010060","volume":"37","author":"L Cheng","year":"2001","unstructured":"Cheng L, Xu H, Luo Y (2001) Integer discrete cosine transform and its fast algorithm. Electron Lett 37(1):64\u201365","journal-title":"Electron Lett"},{"issue":"90","key":"9706_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley JW, Tukey JW (1965) An algorithm for the machine calculation of complex fourier series. Math Comput 19(90):297\u2013301","journal-title":"Math Comput"},{"key":"9706_CR10","first-page":"688","volume":"2012","author":"J Ding","year":"2012","unstructured":"Ding J, Xie X, Lin X (2012) A simple provably secure key exchange scheme based on the learning with errors problem. IACR Cryptol EPrint Arch 2012:688","journal-title":"IACR Cryptol EPrint Arch"},{"key":"9706_CR11","doi-asserted-by":"crossref","unstructured":"Ducas L, Durmus A, Lepoint T, Lyubashevsky V (2013) Lattice signatures and bimodal gaussians. In: Annual cryptology conference. Springer, pp 40\u201356","DOI":"10.1007\/978-3-642-40041-4_3"},{"key":"9706_CR12","doi-asserted-by":"crossref","unstructured":"Dworkin MJ (2015) Sha-3 standard: Permutation-based hash and extendable-output functions. Technical report","DOI":"10.6028\/NIST.FIPS.202"},{"issue":"5","key":"9706_CR13","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1109\/83.760312","volume":"8","author":"TM Foltz","year":"1999","unstructured":"Foltz TM, Welsh BM (1999) Symmetric convolution of asymmetric multidimensional sequences using discrete trigonometric transforms. IEEE Trans Image Process 8(5):640\u2013651","journal-title":"IEEE Trans Image Process"},{"key":"9706_CR14","doi-asserted-by":"crossref","unstructured":"Gentleman WM, Sande G (1966) Fast fourier transforms: for fun and profit. In: Proceedings of the November 7-10, 1966, fall joint computer conference. ACM, pp 563\u2013578","DOI":"10.1145\/1464291.1464352"},{"key":"9706_CR15","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.jsc.2013.09.002","volume":"60","author":"D Harvey","year":"2014","unstructured":"Harvey D (2014) Faster arithmetic for number-theoretic transforms. J Symb Comput 60:113\u2013119","journal-title":"J Symb Comput"},{"key":"9706_CR16","doi-asserted-by":"crossref","unstructured":"Hoffstein J, Pipher J, Silverman JH (1998) Ntru: a ring-based public key cryptosystem. In: International algorithmic number theory symposium. Springer, pp 267\u2013288","DOI":"10.1007\/BFb0054868"},{"issue":"4","key":"9706_CR17","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1109\/TAU.1971.1162202","volume":"19","author":"B Hunt","year":"1971","unstructured":"Hunt B (1971) A matrix theory proof of the discrete convolution theorem. IEEE Trans Audio Electroacoust 19(4):285\u2013288","journal-title":"IEEE Trans Audio Electroacoust"},{"key":"9706_CR18","unstructured":"Jain AK (1989) Fundamentals of digital image processing. Prentice Hall, Englewood Cliffs"},{"key":"9706_CR19","unstructured":"Jiang ZR, Zeng Y, Yu PN (1994) Fast algorithms. National University, Changsha"},{"issue":"6","key":"9706_CR20","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1109\/TASSP.1984.1164443","volume":"32","author":"B Lee","year":"1984","unstructured":"Lee B (1984) A new algorithm to compute the discrete cosine transform. IEEE Trans Acoust Speech Signal Process 32(6):1243\u20131245","journal-title":"IEEE Trans Acoust Speech Signal Process"},{"key":"9706_CR21","doi-asserted-by":"crossref","unstructured":"Lindner R, Peikert C (2011) Better key sizes (and attacks) for lwe-based encryption. In: Cryptographers\u2019 track at the RSA conference. Springer, pp 319\u2013339","DOI":"10.1007\/978-3-642-19074-2_21"},{"key":"9706_CR22","doi-asserted-by":"crossref","unstructured":"Longa P, Naehrig M (2016) Speeding up the number theoretic transform for faster ideal lattice-based cryptography. In: International conference on cryptology and network security. Springer, pp 124\u2013139","DOI":"10.1007\/978-3-319-48965-0_8"},{"key":"9706_CR23","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Micciancio D, Peikert C, Rosen A (2008) Swifft: a modest proposal for fft hashing. In: International workshop on fast software encryption. Springer, pp 54\u201372","DOI":"10.1007\/978-3-540-71039-4_4"},{"key":"9706_CR24","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Peikert C, Regev O (2010) On ideal lattices and learning with errors over rings. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, pp 1\u201323","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"9706_CR25","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V (2012) Lattice signatures without trapdoors. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, pp 738\u2013755","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"9706_CR26","unstructured":"Ma C (1988) A fast recursive algorithm for computing discrete cosine transform. In: Proc. SPIE int. Soc. Opt. Eng., vol 1002, pp 541\u2013548"},{"issue":"6","key":"9706_CR27","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1109\/29.56057","volume":"38","author":"HS Malvar","year":"1990","unstructured":"Malvar HS (1990) Lapped transforms for efficient transform\/subband coding. IEEE Trans Acoust Speech Signal Process 38(6):969\u2013978","journal-title":"IEEE Trans Acoust Speech Signal Process"},{"issue":"5","key":"9706_CR28","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1109\/78.295213","volume":"42","author":"SA Martucci","year":"1994","unstructured":"Martucci SA (1994) Symmetric convolution and the discrete sine and cosine transforms. IEEE Trans Signal Process 42(5):1038\u20131051","journal-title":"IEEE Trans Signal Process"},{"key":"9706_CR29","doi-asserted-by":"crossref","unstructured":"Peikert C (2014) Lattice cryptography for the internet. In: International workshop on post-quantum cryptography. Springer, pp 197\u2013219","DOI":"10.1007\/978-3-319-11659-4_12"},{"issue":"114","key":"9706_CR30","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1090\/S0025-5718-1971-0301966-0","volume":"25","author":"JM Pollard","year":"1971","unstructured":"Pollard JM (1971) The fast fourier transform in a finite field. Math Comput 25(114):365\u2013374","journal-title":"Math Comput"},{"key":"9706_CR31","doi-asserted-by":"crossref","unstructured":"P\u00f6ppelmann T, Oder T, G\u00fcneysu T (2015) High-performance ideal lattice-based cryptography on 8-bit atxmega microcontrollers. In: International conference on cryptology and information security in latin america. Springer, pp 346\u2013365","DOI":"10.1007\/978-3-319-22174-8_19"},{"key":"9706_CR32","unstructured":"Rao KR, Yip P (2014) Discrete cosine transform: algorithms, advantages, applications. Academic Press"},{"issue":"6","key":"9706_CR33","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. J ACM (JACM) 56(6):34","journal-title":"J ACM (JACM)"},{"key":"9706_CR34","doi-asserted-by":"crossref","unstructured":"Roy SS, Vercauteren F, Mentens N, Chen DD, Verbauwhede I (2014) Compact ring-lwe cryptoprocessor. In: International workshop on cryptographic hardware and embedded systems. Springer, pp 371\u2013391","DOI":"10.1007\/978-3-662-44709-3_21"},{"issue":"7","key":"9706_CR35","doi-asserted-by":"publisher","first-page":"2039","DOI":"10.3390\/s20072039","volume":"20","author":"H Seo","year":"2020","unstructured":"Seo H, Kwon H, Kwon Y, Kim K, Choi S, Kim H, Jang K (2020) Fast number theoretic transform for ring-lwe on 8-bit avr embedded processor. Sensors 20(7):2039","journal-title":"Sensors"},{"key":"9706_CR36","unstructured":"Shoup V (2003) Number theory c++ library (ntl) version 5.4. 1. Available at www. \u00e2 AN shoup net"},{"key":"9706_CR37","doi-asserted-by":"crossref","unstructured":"Stehl\u00e9 D, Steinfeld R (2011) Making ntru as secure as worst-case problems over ideal lattices. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, pp 27\u201347","DOI":"10.1007\/978-3-642-20465-4_4"},{"issue":"2","key":"9706_CR38","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1137\/S0036141095289051","volume":"29","author":"W Sweldens","year":"1998","unstructured":"Sweldens W (1998) The lifting scheme: a construction of second generation wavelets. SIAM J Math Anal 29(2):511\u2013546","journal-title":"SIAM J Math Anal"},{"issue":"6","key":"9706_CR39","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/97.844633","volume":"7","author":"TD Tran","year":"2000","unstructured":"Tran TD (2000) The bindct: Fast multiplierless approximation of the dct. IEEE Signal Process Lett 7(6):141\u2013144","journal-title":"IEEE Signal Process Lett"},{"issue":"10","key":"9706_CR40","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1109\/PROC.1971.8471","volume":"59","author":"JL Vernet","year":"1971","unstructured":"Vernet JL (1971) Real signals fast fourier transform: Storage capacity and step number reduction by means of an odd discrete fourier transform. Proc IEEE 59(10):1531\u20131532","journal-title":"Proc IEEE"},{"issue":"3","key":"9706_CR41","doi-asserted-by":"publisher","first-page":"3511","DOI":"10.1007\/s11042-018-6330-9","volume":"78","author":"F Wu","year":"2019","unstructured":"Wu F, Yao W, Zhang X, Zheng Z (2019) Lattice based signature with outsourced revocation for multimedia social networks in cloud computing. Multimed Tools Appl 78(3):3511\u20133528","journal-title":"Multimed Tools Appl"},{"issue":"8","key":"9706_CR42","doi-asserted-by":"publisher","first-page":"9927","DOI":"10.1007\/s11042-017-4560-x","volume":"77","author":"Y Yang","year":"2018","unstructured":"Yang Y, Zheng X, Chang V, Ye S, Tang C (2018) Lattice assumption based fuzzy information retrieval scheme support multi-user for secure multimedia cloud. Multimed Tools Appl 77(8):9927\u20139941","journal-title":"Multimed Tools Appl"},{"issue":"11","key":"9706_CR43","doi-asserted-by":"publisher","first-page":"2774","DOI":"10.1109\/78.960425","volume":"49","author":"Y Zeng","year":"2001","unstructured":"Zeng Y, Cheng L, Bi G, Kot AC (2001) Integer dcts and fast algorithms. IEEE Trans Signal Process 49(11):2774\u20132782","journal-title":"IEEE Trans Signal Process"},{"key":"9706_CR44","doi-asserted-by":"crossref","unstructured":"Zhang J, Zhang Z, Ding J, Snook M, Dagdelen \u00d6 (2015) Authenticated key exchange from ideal lattices. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, pp 719\u2013751","DOI":"10.1007\/978-3-662-46803-6_24"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-020-09706-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-020-09706-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-020-09706-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,18]],"date-time":"2021-09-18T23:38:18Z","timestamp":1632008298000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-020-09706-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,19]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["9706"],"URL":"https:\/\/doi.org\/10.1007\/s11042-020-09706-8","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2020,9,19]]},"assertion":[{"value":"27 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"NONE","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration of interest"}},{"value":"The authors declare that he\/she has no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of potential conflicts of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}