Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Mojtaba Bisheh Niasar"'
Publikováno v:
IEEE Transactions on Circuits and Systems I: Regular Papers. 68:4648-4659
Large scale quantum computers will break classical public-key cryptography protocols by quantum algorithms such as Shor’s algorithm. Hence, designing quantum-safe cryptosystems to replace current classical algorithms is crucial. Luckily there are s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::937646f3f4da6fa21bd2ac109b76f79f
https://doi.org/10.1109/tcsi.2021.3106639
https://doi.org/10.1109/tcsi.2021.3106639
Publikováno v:
IEEE Transactions on Circuits and Systems II: Express Briefs. 68:2942-2946
In this brief, we proposed a highly-optimized FPGA-based implementation of the Ed448 digital signature algorithm. Despite significant progress in elliptic curve cryptography (ECC) implementations, Ed448 hardware architecture, to the best of our knowl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::204939a2abe79244cf196c243a5a19e9
https://doi.org/10.1109/tcsii.2021.3068136
https://doi.org/10.1109/tcsii.2021.3068136
Publikováno v:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 29:1297-1305
This article presents highly optimized implementations of the Ed25519 digital signature algorithm [Edwards curve digital signature algorithm (EdDSA)]. This algorithm significantly improves the execution time without sacrificing security, compared to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::23a5ed7cc99255624810dd222ad5d7d8
https://doi.org/10.1109/tvlsi.2021.3077885
https://doi.org/10.1109/tvlsi.2021.3077885
Autor:
Mila Anastasova, Mojtaba Bisheh-Niasar, Hwajeong Seo, Reza Azarderakhsh, Mehran Mozaffari Kermani
Publikováno v:
2022 IEEE International Symposium on Hardware Oriented Security and Trust (HOST).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aba681c5d9a50f058a6c319c4b9ce4f7
https://doi.org/10.1109/host54066.2022.9839742
https://doi.org/10.1109/host54066.2022.9839742
Publikováno v:
ARITH
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d4dc0fce22642737c755a862043bfd6
https://doi.org/10.1109/arith51176.2021.00009
https://doi.org/10.1109/arith51176.2021.00009
Publikováno v:
ARITH
This paper demonstrates an architecture for accelerating the polynomial multiplication using number theoretic transform (NTT). Kyber is one of the finalists in the third round of the NIST post-quantum cryptography standardization process. Simultaneou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0e97495dea97b81145bf15211d230fa
https://doi.org/10.1109/arith51176.2021.00028
https://doi.org/10.1109/arith51176.2021.00028
Publikováno v:
Progress in Cryptology – LATINCRYPT 2021 ISBN: 9783030882372
LATINCRYPT
LATINCRYPT
With the advent of large-scale quantum computers, factoring and discrete logarithm problems could be solved using the polynomial-time quantum algorithms. To ensure public-key security, a transition to quantum-resistant cryptographic protocols is requ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c05c85a6138bc79e90b8a70d2d88687a
https://doi.org/10.1007/978-3-030-88238-9_6
https://doi.org/10.1007/978-3-030-88238-9_6
Publikováno v:
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering ISBN: 9783030900212
SecureComm (2)
SecureComm (2)
In 2016, the National Institute of Standards and Technology (NIST) initiated a standardization process among the post-quantum secure algorithms. Forming part of the alternate group of candidates after Round 2 of the process is the Supersingular Isoge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0f31a3a41a577d5b867ee182442b7d2
https://doi.org/10.1007/978-3-030-90022-9_24
https://doi.org/10.1007/978-3-030-90022-9_24
Publikováno v:
ARITH
This paper demonstrates fast and compact implementations of Elliptic Curve Cryptography (ECC) for efficient key agreement over Curve25519. Curve25519 has been recently adopted as a key exchange method for several applications and included in the Nati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::830a12b31c81830f88031151b8475af7
https://doi.org/10.1109/arith48897.2020.00019
https://doi.org/10.1109/arith48897.2020.00019
Publikováno v:
Progress in Cryptology – INDOCRYPT 2020 ISBN: 9783030652760
INDOCRYPT
INDOCRYPT
In this paper, we present different implementations of point multiplication over Curve448. Curve448 has recently been recommended by NIST to provide 224-bit security over elliptic curve cryptography. Although implementing high-security cryptosystems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ffe8300741991d67da83e8d92c57667c
https://doi.org/10.1007/978-3-030-65277-7_10
https://doi.org/10.1007/978-3-030-65277-7_10