Zobrazeno 1 - 10
of 76
pro vyhledávání: '"Pratap Pattnaik"'
Publikováno v:
Journal of The Institution of Engineers (India): Series D. 103:57-62
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::113911ebb4e8b236ac9997430c79b77e
https://doi.org/10.1007/s40033-021-00323-9
https://doi.org/10.1007/s40033-021-00323-9
Publikováno v:
HASP@MICRO
The mathematical constructs, nature of computations and challenges in optimizing lattice post-quantum cryptographic algorithms on modern many-core processors are discussed in this paper. Identification of time-consuming functions and subsequent hardw
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6fc37361ac306f4a101c44ea2021ab3e
https://doi.org/10.1145/3458903.3458905
https://doi.org/10.1145/3458903.3458905
Autor:
Pratap Pattnaik, Manoj Kumar
Publikováno v:
HPEC
We discuss the Post Quantum Cryptography algorithms for key establishment under consideration by NIST for standardization. Three of these, Crystals- Kyber, Classic McEliece and Supersingular Isogeny based Key Encapsulation (SIKE), are representatives
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2664b5ca9973e4a96a1094b401e039a1
https://doi.org/10.1109/hpec43674.2020.9286147
https://doi.org/10.1109/hpec43674.2020.9286147
Publikováno v:
ISPASS
Current public-key cryptography systems are vulnerable to quantum computing based attacks. Post-quantum cryptographic (PQC) schemes, based on mathematical paradigms such as lattice-based hard problems, are under consideration by NIST as quantum-safe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6dffbd3d19c701ef4c77e86d83b02ec
https://doi.org/10.1109/ispass48437.2020.00040
https://doi.org/10.1109/ispass48437.2020.00040
Autor:
Joefon Jann, Hao Yu, Gabriel Tanase, Manoj Kumar, José E. Moreira, Mauricio J. Serrano, William P. Horn, Pratap Pattnaik
Publikováno v:
International Journal of Parallel Programming. 46:412-440
Graph processing is becoming a crucial component for analyzing big data arising in many application domains such as social and biological networks, fraud detection, and sentiment analysis. As a result, a number of computational models for graph analy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::053d8f85e52b2caeed40d08174d71902
https://doi.org/10.1007/s10766-016-0481-y
https://doi.org/10.1007/s10766-016-0481-y
Publikováno v:
HPEC
Attaining good performance on graph analytics applications on modern day many-core processors is challenging, because these processors have complex pipelines to manage out of order execution of hundreds of instructions in flight. These pipelines have
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae265ef64bbf5b868ba67aff09aba28e
https://doi.org/10.1109/hpec.2018.8547558
https://doi.org/10.1109/hpec.2018.8547558
Publikováno v:
CF
Emerging applications in health-care, social media analytics, cyber-security, homeland security, and marketing require large graph analytics. Attaining good performance on these applications on modern day hardware is challenging because of the comple
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89e4346ee5697282718263c39c9c321d
https://doi.org/10.1145/3203217.3205342
https://doi.org/10.1145/3203217.3205342
Publikováno v:
IBM Journal of Research and Development. 59:1-4
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1068ee8eb39e4e668ddc80387689a1b5
https://doi.org/10.1147/jrd.2014.2374271
https://doi.org/10.1147/jrd.2014.2374271
Publikováno v:
Conf. Computing Frontiers
The replacement policies known as MIN and OPT are optimal for a two-level memory hierarchy. The computation of the cache content for these policies requires the off-line knowledge of the entire address trace. However, the stack distance of a given ac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::00bfbb10026182eda6c5473eaf797232
https://doi.org/10.1145/3075564.3075571
https://doi.org/10.1145/3075564.3075571
Publikováno v:
IPDPS Workshops
Graph-based algorithms play a crucial role in workflows for analyzing large datasets in domains such as social networks, biology, fraud detection, and sentiment analysis. There are two approaches for incorporating graph-based algorithms into these wo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd8cdeeb132108f948eac73cfd51b694
https://doi.org/10.1109/ipdpsw.2017.142
https://doi.org/10.1109/ipdpsw.2017.142