{"id":"https://openalex.org/W2978487347","doi":"https://doi.org/10.1109/hpcs48598.2019.9188150","title":"A new Parallelization for p3Enum and Parallelized Generation of Optimized Pruning Functions","display_name":"A new Parallelization for p3Enum and Parallelized Generation of Optimized Pruning Functions","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2978487347","doi":"https://doi.org/10.1109/hpcs48598.2019.9188150","mag":"2978487347"},"language":"en","primary_location":{"id":"doi:10.1109/hpcs48598.2019.9188150","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcs48598.2019.9188150","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073618375","display_name":"Michael Burger","orcid":"https://orcid.org/0000-0002-1462-2543"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Michael Burger","raw_affiliation_strings":["Scientific Computing TU Darmstadt, Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Scientific Computing TU Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020597086","display_name":"Christian Bischof","orcid":"https://orcid.org/0000-0003-2711-3032"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Bischof","raw_affiliation_strings":["Scientific Computing TU Darmstadt, Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Scientific Computing TU Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061353492","display_name":"Juliane Kr\u00e4mer","orcid":"https://orcid.org/0000-0002-3599-4215"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Juliane Kramer","raw_affiliation_strings":["Cryptography and Computer Algebra TU Darmstadt, Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Cryptography and Computer Algebra TU Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5073618375"],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.11732599,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"931","last_page":"939"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998000264167786,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9991000294685364,"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/T11130","display_name":"Coding theory and cryptography","score":0.9976000189781189,"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/computer-science","display_name":"Computer science","score":0.8344087600708008},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.571563184261322},{"id":"https://openalex.org/keywords/lattice-problem","display_name":"Lattice problem","score":0.501197338104248},{"id":"https://openalex.org/keywords/lattice-reduction","display_name":"Lattice reduction","score":0.49009689688682556},{"id":"https://openalex.org/keywords/lattice-based-cryptography","display_name":"Lattice-based cryptography","score":0.48289060592651367},{"id":"https://openalex.org/keywords/lattice","display_name":"Lattice (music)","score":0.47159135341644287},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.45871713757514954},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.45588597655296326},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.4552920460700989},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.4260368347167969},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.42332974076271057},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4091905951499939},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.3748794198036194},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.27252835035324097}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8344087600708008},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.571563184261322},{"id":"https://openalex.org/C168482242","wikidata":"https://www.wikidata.org/wiki/Q6497128","display_name":"Lattice problem","level":3,"score":0.501197338104248},{"id":"https://openalex.org/C44274781","wikidata":"https://www.wikidata.org/wiki/Q6497132","display_name":"Lattice reduction","level":4,"score":0.49009689688682556},{"id":"https://openalex.org/C137660015","wikidata":"https://www.wikidata.org/wiki/Q6497083","display_name":"Lattice-based cryptography","level":5,"score":0.48289060592651367},{"id":"https://openalex.org/C2781204021","wikidata":"https://www.wikidata.org/wiki/Q6497091","display_name":"Lattice (music)","level":2,"score":0.47159135341644287},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.45871713757514954},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.45588597655296326},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.4552920460700989},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.4260368347167969},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.42332974076271057},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4091905951499939},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.3748794198036194},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.27252835035324097},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C207987634","wikidata":"https://www.wikidata.org/wiki/Q176862","display_name":"MIMO","level":3,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C169699857","wikidata":"https://www.wikidata.org/wiki/Q2122243","display_name":"Quantum information","level":3,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C144901912","wikidata":"https://www.wikidata.org/wiki/Q471906","display_name":"Quantum cryptography","level":4,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcs48598.2019.9188150","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcs48598.2019.9188150","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W132616194","https://openalex.org/W273871537","https://openalex.org/W1490056131","https://openalex.org/W1845765495","https://openalex.org/W2126483728","https://openalex.org/W2489545452","https://openalex.org/W2794791038","https://openalex.org/W2795008797","https://openalex.org/W2914275007","https://openalex.org/W2920734175","https://openalex.org/W2939504388","https://openalex.org/W3023478445","https://openalex.org/W3111297213","https://openalex.org/W4210580908","https://openalex.org/W6749813177"],"related_works":["https://openalex.org/W1597211008","https://openalex.org/W2905116383","https://openalex.org/W2949749387","https://openalex.org/W3112306103","https://openalex.org/W4206942495","https://openalex.org/W4390571163","https://openalex.org/W2348168089","https://openalex.org/W4384027199","https://openalex.org/W3215125479","https://openalex.org/W166611642"],"abstract_inverted_index":{"Since":[0],"quantum":[1],"computers":[2],"will":[3],"be":[4,41],"able":[5],"to":[6,49,72,140,143,152,221],"break":[7],"all":[8],"public-key":[9],"encryption":[10],"schemes":[11,26],"employed":[12],"today":[13],"efficiently,":[14],"quantum-safe":[15],"cryptographic":[16],"alternatives":[17],"are":[18,24,29],"required.":[19],"One":[20],"group":[21],"of":[22,78,120,173,184,187,199],"candidates":[23],"lattice-based":[25],"since":[27],"they":[28],"efficient":[30,51],"and":[31,194,206,223],"versatile.":[32],"To":[33],"make":[34,211],"them":[35],"practical,":[36],"their":[37],"security":[38],"level":[39],"must":[40],"assessed":[42],"on":[43],"classical":[44],"HPC":[45],"systems":[46],"in":[47,84,170,230],"order":[48],"determine":[50],"but":[52],"secure":[53],"parameterization.In":[54],"this":[55],"paper,":[56],"we":[57,147],"propose":[58],"a":[59,85,111,137,180,224],"novel":[60],"parallelization":[61,128],"strategy":[62],"for":[63,104,161,217],"the":[64,74,80,91,118,121,126,144,149,154,162,167,171,174,185,188,196,213],"open":[65],"source":[66],"framework":[67],"p3Enum":[68,92,135],"which":[69,98,203],"is":[70],"designed":[71],"solve":[73,153],"important":[75],"lattice":[76,86,107,218,231],"problem":[77],"finding":[79],"shortest":[81],"non-zero":[82],"vector":[83],"(SVP).":[87],"We":[88,116],"also":[89,165],"present":[90],"extreme":[93,101],"pruning":[94,102,122,131],"function":[95],"generator":[96],"(p3Enum-epfg)":[97],"generates":[99],"optimized":[100,130],"functions":[103,123,132],"p3Enum's":[105,200],"pruned":[106],"enumeration":[108],"by":[109,136],"employing":[110],"parallelized":[112],"simulated":[113],"annealing":[114],"approach.":[115],"demonstrate":[117],"quality":[119],"delivered.":[124],"Combining":[125],"new":[127],"with":[129,156],"speeds":[133],"up":[134,139],"factor":[138],"3":[141],"compared":[142],"previous":[145,191],"version.Additionally,":[146],"compare":[148],"required":[150],"runtime":[151,172],"SVPs":[155],"state-of-the":[157],"art":[158],"tools":[159],"and,":[160],"first":[163],"time,":[164],"visualize":[166],"statistical":[168],"effects":[169],"algorithms":[175],"under":[176],"consideration.":[177],"This":[178],"allows":[179],"considerably":[181],"better":[182],"understanding":[183],"behavior":[186],"implementations":[189],"than":[190],"average-value":[192],"considerations":[193],"demonstrates":[195],"relative":[197],"stability":[198],"parallel":[201],"runtimes":[202],"improve":[204],"reproducibility":[205],"predictability.":[207],"All":[208],"these":[209],"advancements":[210],"it":[212],"fastest":[214],"SVP":[215],"solver":[216],"dimensions":[219],"66":[220],"92":[222],"suitable":[225],"building":[226],"block":[227],"as":[228],"SVP-oracle":[229],"basis":[232],"reduction.":[233]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}