Zobrazeno 1 - 10
of 126
pro vyhledávání: '"Schoof–Elkies–Atkin algorithm"'
Publikováno v:
Mathematics of Computation, 2005 Jan 01. 74(249), 429-454.
Externí odkaz:
https://www.jstor.org/stable/4100255
Publikováno v:
Mathematics of Computation, 2008 Jul 01. 77(263), 1755-1778.
Externí odkaz:
https://www.jstor.org/stable/40234583
Publikováno v:
IET Information Security. 11:195-198
Scalar multiplication is the most important and expensive operation in elliptic curve cryptosystems. In this study, the authors improve the efficiency of the elliptic net algorithm to compute scalar multiplication by using the equivalence of elliptic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5cf04c42c59464921d2a7d320042d447
https://doi.org/10.1049/iet-ifs.2015.0119
https://doi.org/10.1049/iet-ifs.2015.0119
Publikováno v:
Advances in Mathematics of Communications. 11:453-469
The negation map can be used to speed up the computation of elliptic curve discrete logarithms using either the baby-step giant-step algorithm (BSGS) or Pollard rho. Montgomery's simultaneous modular inversion can also be used to speed up Pollard rho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f882179d54a765df313a921bfab970d
https://doi.org/10.3934/amc.2017038
https://doi.org/10.3934/amc.2017038
Autor:
Karim Bigou, Arnaud Tisserand
Publikováno v:
IEEE Transactions on Computers
IEEE Transactions on Computers, 2016, 65 (11), pp.3495-3501. ⟨10.1109/TC.2016.2529625⟩
IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2016, 65 (11), pp.3495-3501. ⟨10.1109/TC.2016.2529625⟩
IEEE Transactions on Computers, 2016, 65 (11), pp.3495-3501. ⟨10.1109/TC.2016.2529625⟩
IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2016, 65 (11), pp.3495-3501. ⟨10.1109/TC.2016.2529625⟩
International audience; A fast RNS modular inversion for finite fields arithmetic has been published at CHES 2013 conference. It is based on the binary version of the plus-minus Euclidean algorithm. In the context of elliptic curve cryptography (i.e.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d19e1f86a214cf123d9f0b3fd340dcfa
https://doi.org/10.1109/tc.2016.2529625
https://doi.org/10.1109/tc.2016.2529625
Autor:
Bing-Long Chen, Chang-An Zhao
Publikováno v:
IEEE Transactions on Computers. 65:2903-2909
In this paper we propose a modified Elliptic Net algorithm to compute pairings. By reducing the number of the intermediate variables which should be updated in the iteration loop of the Elliptic Net algorithm, we speed up the computation of pairings.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99bf4ab5cb4d849dd79774e24e9b0c7b
https://doi.org/10.1109/tc.2015.2498556
https://doi.org/10.1109/tc.2015.2498556
Publikováno v:
Multimedia Tools and Applications. 75:14819-14831
In this work, we propose an algorithm to produce the Triple-base chain that optimize the time usage for computing an elliptic curve cryptosystem. Triple-base Chain is a scalar multiplication algorithm, which represents an integer k using three bases
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::191c0075de4ad64280b0be36cb8d88e2
https://doi.org/10.1007/s11042-016-3272-y
https://doi.org/10.1007/s11042-016-3272-y
Autor:
Russ Housley
This document describes the conventions for using Elliptic Curve Diffie-Hellman (ECDH) key agreement algorithm using curve25519 and curve448 in the Cryptographic Message Syntax (CMS).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c24c3e702a591e4a62b5856c091867c
https://doi.org/10.17487/rfc8418
https://doi.org/10.17487/rfc8418
Publikováno v:
Progress in Cryptology – INDOCRYPT 2018 ISBN: 9783030053772
INDOCRYPT
INDOCRYPT
In this paper, we describe a new Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. The algorithm depends on a property of the group of rational points on an elliptic curve and is thus not a generic algorithm. The algorithm t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a8e4239fa450013897966cc5152c194
https://doi.org/10.1007/978-3-030-05378-9_12
https://doi.org/10.1007/978-3-030-05378-9_12
Publikováno v:
Procedia Computer Science. 54:73-82
Elliptic Curve Cryptography has been a recent research area in the field of Cryptography. It provides higher level of security with lesser key size compared to other Cryptographic techniques. A new technique has been proposed in this paper where the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::497e4df0ac077616986cf21cd9e16470