乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:30:25Z","timestamp":1743132625568,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319196466"},{"type":"electronic","value":"9783319196473"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19647-3_28","type":"book-chapter","created":{"date-parts":[[2015,6,26]],"date-time":"2015-06-26T09:03:08Z","timestamp":1435309388000},"page":"304-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Modular Reduction Algorithm Without Correction Phase"],"prefix":"10.1007","author":[{"given":"Haibo","family":"Yu","sequence":"first","affiliation":[]},{"given":"Guoqiang","family":"Bai","sequence":"additional","affiliation":[]},{"given":"Huikang","family":"Hao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,27]]},"reference":[{"issue":"6","key":"28_CR1","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.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"28_CR2","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology","author":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"issue":"177","key":"28_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987)","journal-title":"Math. Comput."},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-13797-6_12","volume-title":"Arithmetic of Finite Fields","author":"M Kne\u017eevi\u0107","year":"2010","unstructured":"Kne\u017eevi\u0107, M., Vercauteren, F., Verbauwhede, I.: Speeding up bipartite modular multiplication. In: Hasan, M.A., Helleseth, T. (eds.) WAIFI 2010. LNCS, vol. 6087, pp. 166\u2013179. Springer, Heidelberg (2010)"},{"issue":"12","key":"28_CR6","doi-asserted-by":"publisher","first-page":"1715","DOI":"10.1109\/TC.2010.93","volume":"59","author":"M Knezevic","year":"2010","unstructured":"Knezevic, M., Vercauteren, F., Verbauwhede, I.: Faster interleaved modular multiplication based on barrett and montgomery reduction methods. IEEE Trans. Comput. 59(12), 1715\u20131721 (2010)","journal-title":"IEEE Trans. Comput."},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-47721-7_24","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"P Barrett","year":"1987","unstructured":"Barrett, P.: Implementing the rivest shamir and adleman public key encryption algorithm on a standard digital signal processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 311\u2013323. Springer, Heidelberg (1987)"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/10721064_31","volume-title":"Smart Card Research and Applications","author":"J-F Dhem","year":"2000","unstructured":"Dhem, J.-F., Quisquater, J.-J.: Recent results on modular multiplications for smart. In: Schneier, B., Quisquater, J.-J. (eds.) CARDIS 1998. LNCS, vol. 1820, pp. 336\u2013352. Springer, Heidelberg (2000)"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/3-540-44499-8_14","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2000","author":"J Gro\u00dfsch\u00e4dl","year":"2000","unstructured":"Gro\u00dfsch\u00e4dl, J.: High-speed RSA hardware based on Barret\u2019s modular reduction method. In: Paar, C., Ko\u00e7, \u00c7.K. (eds.) CHES 2000. LNCS, vol. 1965, pp. 191\u2013203. Springer, Heidelberg (2000)"},{"doi-asserted-by":"crossref","unstructured":"Hasenplaugh, W., Gaubatz, G., Gopal, V.: Fast modular reduction. In: 18th IEEE Symposium on Computer Arithmetic, ARITH 2007, pp. 225\u2013229. IEEE (2007)","key":"28_CR10","DOI":"10.1109\/ARITH.2007.18"},{"doi-asserted-by":"crossref","unstructured":"Knezevic, M., Batina, L., Verbauwhede, I.: Modular reduction without precomputational phase. In: IEEE International Symposium on Circuits and Systems, ISCAS 2009, pp. 1389\u20131392. IEEE (2009)","key":"28_CR11","DOI":"10.1109\/ISCAS.2009.5118024"},{"issue":"2","key":"28_CR12","first-page":"16","volume":"37","author":"L Rutten","year":"2010","unstructured":"Rutten, L., Van Eekelen, M.: Efficient and formally proven reduction of large integers by small moduli. ACM Trans. Math. Soft. (TOMS) 37(2), 16 (2010)","journal-title":"ACM Trans. Math. Soft. (TOMS)"},{"unstructured":"PUBLIC-KEY CRYPTOGRAPHY. Primality testing and integer factorization in public-key cryptography (2009)","key":"28_CR13"},{"issue":"6","key":"28_CR14","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1109\/43.31522","volume":"8","author":"PG Paulin","year":"1989","unstructured":"Paulin, P.G., Knight, J.P.: Force-directed scheduling for the behavioral synthesis of asics. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst. 8(6), 661\u2013679 (1989)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19647-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T15:14:25Z","timestamp":1674227665000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19647-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319196466","9783319196473"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19647-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}