Fast Algorithms on Primality Testing for Numbers 255 ⋅ 2^n ± 1

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Fast Algorithms on Primality Testing for Numbers 255 ⋅ 2^n ± 1
Συγγραφείς: Huang, Dandan, Zhang, Zheng, Tang, Zhihao
Πηγή: 2019 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI) SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI), 2019 IEEE. :1255-1258 Aug, 2019
Relation: 2019 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI)
Βάση Δεδομένων: IEEE Xplore Digital Library
Περιγραφή
ISBN:9781728140346
DOI:10.1109/SmartWorld-UIC-ATC-SCALCOM-IOP-SCI.2019.00233