Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Sabyasachi Karati"'
Autor:
Sabyasachi Karati, Palash Sarkar
Publikováno v:
Journal of Cryptology. 33:92-129
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3ef37bc30323ace882d72dc09a9bb7c8
https://doi.org/10.1007/s00145-019-09320-4
https://doi.org/10.1007/s00145-019-09320-4
Autor:
Palash Sarkar, Sabyasachi Karati
Publikováno v:
Advances in Mathematics of Communications. 13:41-66
Scalar multiplication on suitable Legendre form elliptic curves can be speeded up in two ways. One can perform the bulk of the computation either on the associated Kummer line or on an appropriate twisted Edwards form elliptic curve. This paper provi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::938d8ace17fedab9c2017e65b6e782ab
https://doi.org/10.3934/amc.2019003
https://doi.org/10.3934/amc.2019003
Publikováno v:
Advances in Information and Computer Security ISBN: 9783030859862
IWSEC
IWSEC
Digital signature schemes form the basis of trust in Internet communication. Shor (FOCS 1994) proposed quantum algorithms that can be used by a quantum computer to break the security of today’s widely used digital signature schemes, and this has fu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::372a1c452210cbf6e9658f88fc74cfba
https://doi.org/10.1007/978-3-030-85987-9_11
https://doi.org/10.1007/978-3-030-85987-9_11
Publikováno v:
AsiaCCS
With the rapid development of quantum technologies, quantum-safe cryptography has found significant attention. Hash-based signature schemes have been in particular of interest because of (i) the importance of digital signature as the main source of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e9e214ef2cc97962ba8dddc989143c5
https://doi.org/10.1145/3321705.3329837
https://doi.org/10.1145/3321705.3329837
Autor:
Sabyasachi Karati, Palash Sarkar
Publikováno v:
Advances in Cryptology – ASIACRYPT 2017 ISBN: 9783319706962
ASIACRYPT (2)
ASIACRYPT (2)
This work considers the problem of fast and secure scalar multiplication using curves of genus one defined over a field of prime order. Previous work by Gaudry and Lubicz in 2009 had suggested the use of the associated Kummer line to speed up scalar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a72dbfbc475e606c098ea02fa4c4e089
https://doi.org/10.1007/978-3-319-70697-9_1
https://doi.org/10.1007/978-3-319-70697-9_1
Autor:
Bhargav R. Bellur, Dipanwita RoyChowdhury, Anup Bhattacharya, Abhijit Das, Aravind V. Iyer, Sabyasachi Karati
Publikováno v:
E-Business and Telecommunications ISBN: 9783662447901
ICETE (Selected Papers)
ICETE (Selected Papers)
Eta pairing over supersingular elliptic curves is widely used in designing many cryptographic protocols. Because of efficiency considerations, curves over finite fields of small characteristics are preferred. In this paper, we report several of our i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9792f529d710845541829dc6aa10367
https://doi.org/10.1007/978-3-662-44791-8_9
https://doi.org/10.1007/978-3-662-44791-8_9
Publikováno v:
Security, Privacy, and Applied Cryptography Engineering ISBN: 9783319120591
SPACE
SPACE
In AfricaCrypt 2012, several algorithms are proposed for the batch verification of ECDSA signatures. In this paper, we propose three randomization methods for these batch-verification algorithms. Our first proposal is based on Montgomery ladders, and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::65dd9f3d2e13b7c14ce0e426ee18187e
https://doi.org/10.1007/978-3-319-12060-7_16
https://doi.org/10.1007/978-3-319-12060-7_16
Autor:
Sabyasachi Karati, Abhijit Das
Publikováno v:
Applied Cryptography and Network Security ISBN: 9783319075358
ACNS
ACNS
Several batch-verification algorithms for original ECDSA signatures are proposed for the first time in AfricaCrypt 2012. Two of these algorithms are based on the naive idea of taking square roots in the underlying fields, and the others perform symbo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9063e3263eede704aa0e6e5ae6f83020
https://doi.org/10.1007/978-3-319-07536-5_26
https://doi.org/10.1007/978-3-319-07536-5_26
Autor:
Debojyoti Bhattacharya, Aravind V. Iyer, Bhargav R. Bellur, Abhijit Das, Dipanwita RoyChowdhury, Sabyasachi Karati
Publikováno v:
Progress in Cryptology-AFRICACRYPT 2012 ISBN: 9783642314094
AFRICACRYPT
AFRICACRYPT
In this paper, we study several algorithms for batch verification of ECDSA signatures. The first of these algorithms is based upon the naive idea of taking square roots in the underlying field. We also propose two new and efficient algorithms which r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e44a6a7f0e35a9659bf905791752564
https://doi.org/10.1007/978-3-642-31410-0_1
https://doi.org/10.1007/978-3-642-31410-0_1