{"id":"https://openalex.org/W2889005671","doi":"https://doi.org/10.1109/icsec.2017.8443858","title":"The New Equation for RSA's Decryption Process Appropriate with High Private Key Exponent","display_name":"The New Equation for RSA's Decryption Process Appropriate with High Private Key Exponent","publication_year":2017,"publication_date":"2017-11-01","ids":{"openalex":"https://openalex.org/W2889005671","doi":"https://doi.org/10.1109/icsec.2017.8443858","mag":"2889005671"},"language":"en","primary_location":{"id":"doi:10.1109/icsec.2017.8443858","doi":"https://doi.org/10.1109/icsec.2017.8443858","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsec.2017.8443858","pdf_url":null,"source":{"id":"https://openalex.org/S4306418978","display_name":"International Computer Science and Engineering Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 21st International Computer Science and Engineering Conference (ICSEC)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5024312018","display_name":"Kritsanapong Somsuk","orcid":"https://orcid.org/0000-0002-1311-8222","observed_orcids":["https://orcid.org/0000-0002-1311-8222"]},"institutions":[{"id":"https://openalex.org/I3132704155","display_name":"Udon Thani Rajabhat University","ror":"https://ror.org/05h6yt550","country_code":"TH","type":"education","lineage":["https://openalex.org/I3132704155"]}],"countries":["TH"],"is_corresponding":true,"raw_author_name":"Kritsanapong Somsuk","raw_affiliation_strings":["Department of Computer and Communication Engineering, Udon Thani Rajabhat University, UDRU, Udonthani, Thailand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Communication Engineering, Udon Thani Rajabhat University, UDRU, Udonthani, Thailand","institution_ids":["https://openalex.org/I3132704155"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5024312018"],"corresponding_institution_ids":["https://openalex.org/I3132704155"],"apc_list":null,"apc_paid":null,"fwci":0.3585,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.49570836,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9731000065803528,"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.9731000065803528,"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.016100000590085983,"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.009100000374019146,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/rsa-decryption","display_name":"RSA decryption","score":0.8119999766349792},{"id":"https://openalex.org/keywords/euler-s-totient-function","display_name":"Euler totient function","score":0.8090000152587891},{"id":"https://openalex.org/keywords/public-key-cryptography","display_name":"public-key cryptography","score":0.8159999847412109}],"concepts":[{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.6674449443817139},{"id":"https://openalex.org/C203062551","wikidata":"https://www.wikidata.org/wiki/Q201339","display_name":"Public-key cryptography","level":3,"score":0.6585369110107422},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.6163837313652039},{"id":"https://openalex.org/C93974786","wikidata":"https://www.wikidata.org/wiki/Q1589480","display_name":"Ciphertext","level":3,"score":0.6112238168716431},{"id":"https://openalex.org/C92717368","wikidata":"https://www.wikidata.org/wiki/Q1162538","display_name":"Plaintext","level":3,"score":0.5928958654403687},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5093339681625366},{"id":"https://openalex.org/C47750902","wikidata":"https://www.wikidata.org/wiki/Q1557574","display_name":"Key size","level":4,"score":0.4704545736312866},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.43925705552101135},{"id":"https://openalex.org/C163173736","wikidata":"https://www.wikidata.org/wiki/Q3308558","display_name":"Key generation","level":3,"score":0.43653619289398193},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.423758864402771},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3928567171096802},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.29023319482803345},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icsec.2017.8443858","doi":"https://doi.org/10.1109/icsec.2017.8443858","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsec.2017.8443858","pdf_url":null,"source":{"id":"https://openalex.org/S4306418978","display_name":"International Computer Science and Engineering Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 21st International Computer Science and Engineering Conference (ICSEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1599937967","https://openalex.org/W1964481631","https://openalex.org/W1992546115","https://openalex.org/W1996360405","https://openalex.org/W1997924766","https://openalex.org/W2082398840","https://openalex.org/W2103001499","https://openalex.org/W2130738225","https://openalex.org/W2156186849","https://openalex.org/W2157482359","https://openalex.org/W2326177405","https://openalex.org/W2533790420","https://openalex.org/W2593033016","https://openalex.org/W4232836212","https://openalex.org/W4255914823"],"related_works":["https://openalex.org/W3130837149","https://openalex.org/W2593033016","https://openalex.org/W4391316559","https://openalex.org/W4220936433","https://openalex.org/W2541605541","https://openalex.org/W1576428841","https://openalex.org/W2145076005","https://openalex.org/W3092814356","https://openalex.org/W2399265768","https://openalex.org/W2103001499"],"abstract_inverted_index":{"RSA":[0],"is":[1,24,60,72,79,97,113,122,151,156,170,187],"the":[2,21,39,53,65,70,74,83,86,89,94,100,103,110,114,118,125,137,148,163,167,174,184,192,207,211,220],"best":[3],"well":[4],"-":[5],"known":[6],"public":[7,28],"key":[8,23,29,71,105,121,150,169,194],"cryptography":[9],"using":[10],"a":[11,129,171],"pair":[12],"of":[13,77,82],"keys":[14],"for":[15,56,85,210],"encryption":[16],"and":[17,106],"decryption":[18,47,58,143],"process.":[19],"Usually,":[20],"private":[22,41,104,120,149,168,193,221],"generated":[25],"higher":[26],"than":[27],"to":[30,45,62,200,214],"avoid":[31],"attacking":[32],"by":[33],"third":[34,212],"parties":[35,213],"easily.":[36],"However,":[37,182],"with":[38,88],"high":[40,119,152,179],"key,":[42],"it":[43,155,189,204],"affects":[44],"finish":[46,141],"process":[48,59,144,175],"slowly.":[49],"In":[50,68,92],"this":[51],"paper,":[52],"new":[54,90,95,126],"equation":[55],"RSA's":[57,142],"proposed":[61,111,138,185],"speed":[63],"up":[64],"computation":[66,87,180],"time.":[67],"fact,":[69],"that":[73,136,191],"modular":[75],"inverse":[76],"ciphertext":[78,84],"chosen":[80,123],"instead":[81],"exponent.":[91],"addition,":[93],"exponent":[96,127],"computed":[98],"from":[99],"relation":[101],"between":[102],"euler":[107,160,201],"value.":[108,131,161],"Furthermore,":[109],"method":[112,139,186],"better":[115],"choice":[116],"when":[117,154],"because":[124,203],"becomes":[128],"small":[130,172],"The":[132],"experimental":[133],"results":[134],"show":[135],"can":[140],"very":[145,157,178],"fast":[146],"whenever":[147],"especially":[153],"close":[158,199],"too":[159],"On":[162],"other":[164],"hand,":[165],"if":[166],"value,":[173],"must":[176],"take":[177],"cost.":[181],"after":[183],"presented,":[188],"implies":[190],"should":[195],"not":[196],"be":[197],"assigned":[198],"value":[202],"will":[205],"become":[206],"easy":[208],"way":[209],"recover":[215],"original":[216],"plaintext":[217],"without":[218],"knowing":[219],"key.":[222]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2018-09-07T00:00:00"}