{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:46:56Z","timestamp":1742914016299,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389795"},{"type":"electronic","value":"9783642389801"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38980-1_35","type":"book-chapter","created":{"date-parts":[[2013,6,20]],"date-time":"2013-06-20T18:26:48Z","timestamp":1371752808000},"page":"552-569","source":"Crossref","is-referenced-by-count":0,"title":["Primeless Factoring-Based Cryptography"],"prefix":"10.1007","author":[{"given":"Sonia","family":"Bogos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioana","family":"Boureanu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serge","family":"Vaudenay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Institute of Electrical and Electronics Engineers: IEEE Standard Specifications for Public Key Cryptography. IEEE 1363-2000 (2000), \n                    \n                      http:\/\/grouper.ieee.org\/groups\/1363\/"},{"key":"35_CR2","unstructured":"Institute of Electrical and Electronics Engineers: ECRYPT II Yearly Report on Algorithms and Key Sizes. ECRYPT (2011), \n                    \n                      http:\/\/www.ecrypt.eu.org\/documents\/D.SPA.17.pdf"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Bellovin, S.M., Merritt, M.: Encrypted Key Exchange: Password-Based Protocols Secure Against Dictionary Attacks. In: IEEE Symposium on Research in Security and Privacy, pp. 72\u201384 (1992)","DOI":"10.1145\/168588.168618"},{"issue":"4","key":"35_CR4","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"Chernoff, H.: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations. The Annals of Mathematical Statistics\u00a023(4), 493\u2013507 (1952)","journal-title":"The Annals of Mathematical Statistics"},{"issue":"1","key":"35_CR5","doi-asserted-by":"publisher","first-page":"738","DOI":"10.2307\/2371483","volume":"62","author":"P. Erd\u00f6s","year":"1940","unstructured":"Erd\u00f6s, P., Kac, M.: The Gaussian Law of Errors in the Theory of Additive Number Theoretic Functions. American Journal of Mathematics\u00a062(1), 738\u2013742 (1940)","journal-title":"American Journal of Mathematics"},{"key":"35_CR6","unstructured":"The GNU Multiple Precision Arithmetic Library, \n                    \n                      http:\/\/gmplib.org"},{"issue":"2","key":"35_CR7","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic Encryption. J. Comput. Syst. Sci.\u00a028(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"35_CR8","first-page":"76","volume":"48","author":"G. Hardy","year":"1917","unstructured":"Hardy, G., Ramanujan, S.: The Normal Number of Prime Factors of a Number n. Quart. J. Math.\u00a048, 76\u201392 (1917)","journal-title":"Quart. J. Math."},{"key":"35_CR9","unstructured":"Hildebrand, A., Tenenbaum, G.: Integers without Large Prime Factors. Pr\u00e9publications de l\u2019Institut Elie Cartan. D\u00e9p. de Math., Univ. de Nancy I (1991)"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory. Springer (1990)","DOI":"10.1007\/978-1-4757-2103-4"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Joye, M., Libert, B.: Efficient Cryptosystems From 2\n                    k\n                  -th Power Residue Symbols. In: EUROCRYPT (2013)","DOI":"10.1007\/978-3-642-38348-9_5"},{"key":"35_CR12","first-page":"595","volume":"7","author":"A. Karatsuba","year":"1978","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of Multidigit Numbers on Automata. Soviet Physics Doklady\u00a07, 595\u2013596 (1978)","journal-title":"Soviet Physics Doklady"},{"issue":"3","key":"35_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(76)90050-5","volume":"3","author":"D.E. Knuth","year":"1976","unstructured":"Knuth, D.E., Pardo, L.T.: Analysis of a Simple Factorization Algorithm. Theoretical Computer Science\u00a03(3), 321\u2013348 (1976)","journal-title":"Theoretical Computer Science"},{"key":"35_CR14","series-title":"Lecture Notes in Mathematics","volume-title":"The Development of the Number Field Sieve","year":"1993","unstructured":"Lenstra, A.K., Lenstra Jr., H.W. (eds.): The Development of the Number Field Sieve. Lecture Notes in Mathematics, vol.\u00a01554. Springer, Berlin (1993)"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Lenstra Jr., H.W.: Factoring Integers with Elliptic Curves. Ann. of Math. (2)\u00a0126(3), 649\u2013673 (1987)","DOI":"10.2307\/1971363"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1090\/S0025-5718-1969-0247789-3","volume":"23","author":"J. Lune van de","year":"1969","unstructured":"van de Lune, J., Wattel, E.: On the Numerical Solution of a Differential-Difference Equation Arising in Analytic Number Theory. Mathematics of Computation\u00a023, 417\u2013421 (1969)","journal-title":"Mathematics of Computation"},{"key":"35_CR17","unstructured":"Mceliece, R.J.: A Public-Key Cryptosystem Based on Algebraic Coding Theory. Tech. rep., Jet Propulsion Lab Deep Space Network Progress Report (1978)"},{"key":"35_CR18","unstructured":"Mohassel, P.: Efficient and Secure Delegation of Linear Algebra. Cryptology ePrint Archive, Report 2011\/605 (2011), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"35_CR19","unstructured":"Monnerat, J.: Short Undeniable Signatures: Design, Analysis, and Applications. Ph.D. thesis, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (2006)"},{"issue":"3","key":"35_CR20","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s00145-010-9070-1","volume":"24","author":"J. Monnerat","year":"2011","unstructured":"Monnerat, J., Vaudenay, S.: Short Undeniable Signatures Based on Group Homomorphisms. Journal of Cryptology\u00a024(3), 545\u2013587 (2011)","journal-title":"Journal of Cryptology"},{"key":"35_CR21","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 Cryptosystems. Commun. ACM\u00a021, 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"35_CR22","unstructured":"Sage Mathematics Software, \n                    \n                      http:\/\/www.sagemath.org"},{"key":"35_CR23","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle Multiplikation grosser Zahlen. Computing\u00a07, 281\u2013292 (1971)","journal-title":"Computing"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38980-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:34:28Z","timestamp":1558301668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38980-1_35"}},"subtitle":["\u2013Solving the Complexity Bottleneck of Public-Key Generation\u2013"],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389795","9783642389801"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38980-1_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}