{"id":"https://openalex.org/W2739300320","doi":"https://doi.org/10.1145/3087604.3087606","title":"Parametrizations for Families of ECM-Friendly Curves","display_name":"Parametrizations for Families of ECM-Friendly Curves","publication_year":2017,"publication_date":"2017-07-19","ids":{"openalex":"https://openalex.org/W2739300320","doi":"https://doi.org/10.1145/3087604.3087606","mag":"2739300320"},"language":"en","primary_location":{"id":"doi:10.1145/3087604.3087606","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087604.3087606","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-01568343","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108668021","display_name":"Alexandre G\u00e9lin","orcid":null},"institutions":[{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]},{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]}],"countries":["AT","FR"],"is_corresponding":false,"raw_author_name":"Alexandre G\u00e9lin","raw_affiliation_strings":["Sorbonne Universit\u00e9s, UPMC Paris 6, Paris, France","ALgorithms for coMmunicAtion SecuriTY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sorbonne Universit\u00e9s, UPMC Paris 6, Paris, France","institution_ids":["https://openalex.org/I39804081"]},{"raw_affiliation_string":"ALgorithms for coMmunicAtion SecuriTY","institution_ids":["https://openalex.org/I4210099593"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013956683","display_name":"Thorsten Kleinjung","orcid":null},"institutions":[{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]},{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["AT","CH"],"is_corresponding":false,"raw_author_name":"Thorsten Kleinjung","raw_affiliation_strings":["\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, EPFL IC LACAL, Lausanne, Switzerland","Laboratory for Cryptologic Algorithms"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, EPFL IC LACAL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"Laboratory for Cryptologic Algorithms","institution_ids":["https://openalex.org/I4210099593"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109240185","display_name":"Arjen K. Lenstra","orcid":null},"institutions":[{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]},{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["AT","CH"],"is_corresponding":false,"raw_author_name":"Arjen K. Lenstra","raw_affiliation_strings":["\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, EPFL IC LACAL, Lausanne, Switzerland","Laboratory for Cryptologic Algorithms"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, EPFL IC LACAL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"Laboratory for Cryptologic Algorithms","institution_ids":["https://openalex.org/I4210099593"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6473,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.69077987,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"165","last_page":"171"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9710000157356262,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9369999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7207785844802856},{"id":"https://openalex.org/keywords/elliptic-curve","display_name":"Elliptic curve","score":0.6830270886421204},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5847061276435852},{"id":"https://openalex.org/keywords/schoofs-algorithm","display_name":"Schoof's algorithm","score":0.5683172941207886},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.567710280418396},{"id":"https://openalex.org/keywords/division-polynomials","display_name":"Division polynomials","score":0.5104171633720398},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4538879692554474},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.43660303950309753},{"id":"https://openalex.org/keywords/counting-points-on-elliptic-curves","display_name":"Counting points on elliptic curves","score":0.4285491406917572},{"id":"https://openalex.org/keywords/elliptic-curve-point-multiplication","display_name":"Elliptic curve point multiplication","score":0.4121151268482208},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40064698457717896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2859152555465698},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.17712023854255676},{"id":"https://openalex.org/keywords/quarter-period","display_name":"Quarter period","score":0.10087645053863525},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.0561104416847229}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7207785844802856},{"id":"https://openalex.org/C179603306","wikidata":"https://www.wikidata.org/wiki/Q268493","display_name":"Elliptic curve","level":2,"score":0.6830270886421204},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5847061276435852},{"id":"https://openalex.org/C121444067","wikidata":"https://www.wikidata.org/wiki/Q2835817","display_name":"Schoof's algorithm","level":4,"score":0.5683172941207886},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.567710280418396},{"id":"https://openalex.org/C87905105","wikidata":"https://www.wikidata.org/wiki/Q5284582","display_name":"Division polynomials","level":5,"score":0.5104171633720398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4538879692554474},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.43660303950309753},{"id":"https://openalex.org/C68782407","wikidata":"https://www.wikidata.org/wiki/Q5177153","display_name":"Counting points on elliptic curves","level":5,"score":0.4285491406917572},{"id":"https://openalex.org/C117121985","wikidata":"https://www.wikidata.org/wiki/Q78380999","display_name":"Elliptic curve point multiplication","level":3,"score":0.4121151268482208},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40064698457717896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2859152555465698},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.17712023854255676},{"id":"https://openalex.org/C197875053","wikidata":"https://www.wikidata.org/wiki/Q7269266","display_name":"Quarter period","level":3,"score":0.10087645053863525},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0561104416847229}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3087604.3087606","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087604.3087606","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01568343v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01568343","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSAC 2017 The 42nd International Symposium on Symbolic and Algebraic Computation, Jul 2017, Kaiserslautern, Germany. pp.165--171, ⟨10.1145/3087604.3087606⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01568343v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01568343","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSAC 2017 The 42nd International Symposium on Symbolic and Algebraic Computation, Jul 2017, Kaiserslautern, Germany. pp.165--171, ⟨10.1145/3087604.3087606⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1510727262","https://openalex.org/W1539740938","https://openalex.org/W1971605365","https://openalex.org/W1972442530","https://openalex.org/W1991822009","https://openalex.org/W2005317356","https://openalex.org/W2059326407","https://openalex.org/W2090515343","https://openalex.org/W2119819322","https://openalex.org/W2179025976","https://openalex.org/W2951379724","https://openalex.org/W2962714280"],"related_works":["https://openalex.org/W3138493780","https://openalex.org/W4245179206","https://openalex.org/W2357587526","https://openalex.org/W1751154003","https://openalex.org/W2286648356","https://openalex.org/W2548082687","https://openalex.org/W2391497076","https://openalex.org/W74147110","https://openalex.org/W3172172454","https://openalex.org/W1972565281"],"abstract_inverted_index":{"We":[0],"provide":[1],"a":[2,11],"new":[3],"family":[4],"of":[5,18],"elliptic":[6,20],"curves":[7],"that":[8],"results":[9],"in":[10],"one":[12],"to":[13,37],"two":[14],"percent":[15],"performance":[16],"improvement":[17],"the":[19],"curve":[21],"integer":[22],"factorization":[23],"method.":[24],"The":[25],"speedup":[26],"is":[27],"confirmed":[28],"by":[29],"extensive":[30],"tests":[31],"for":[32],"factors":[33],"ranging":[34],"from":[35],"15":[36],"63":[38],"bits.":[39]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}