Zobrazeno 1 - 10
of 4 921
pro vyhledávání: '"521"'
Autor:
Bhattacharya, Anushree1 (AUTHOR), Pal, Madhumangal1 (AUTHOR) mmpalvu@mail.vidyasagar.ac.in
Publikováno v:
Neural Computing & Applications. Nov2021, Vol. 33 Issue 21, p15027-15057. 31p.
Autor:
Sam Terilli
Publikováno v:
Communication Law and Policy. 25:362-365
Publikováno v:
Linear Algebra and its Applications. 529:457-459
There is a mistake in the proof of Theorem 2.7 of Liu et al. [A note on (signless) Laplacian spectral ordering with maximum degrees of graphs, Linear Algebra Appl. 521 (2017) 135–141], and the corrected proof is provided in this Corrigendum note.
Autor:
George Luta
Publikováno v:
Biometrical Journal. 62:1827-1827
Publikováno v:
AGRI-SOSIOEKONOMI; Vol 15, No 3 (2019); 521 – 528
This study aims to analyze the financial feasibility of the "Potato Modoinding" french fries business in the city of Manado. This research was carried out in April 2018. The data used are primary data obtained from interviews with owners and business
Autor:
Murat Cenk, Shoukat Ali
Publikováno v:
Information Security and Cryptology – ICISC 2016 ISBN: 9783319531762
ICISC
ICISC
We present a new algorithm for residue multiplication modulo the Mersenne prime $$p=2^{521}-1$$ based on the Toeplitz matrix-vector product. For this modulus, our algorithm yields better result in terms of the total number of operations than the prev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::954a11e721959c2cc9653332ec84a08a
https://doi.org/10.1007/978-3-319-53177-9_9
https://doi.org/10.1007/978-3-319-53177-9_9
Publikováno v:
Information Security and Cryptology-ICISC 2015 ISBN: 9783319308395
ICISC
ICISC
In this paper, we present high speed parallel multiplication and squaring algorithms for the Mersenne prime \(2^{521}-1\). We exploit 1-level Karatsuba method in order to provide asymptotically faster integer multiplication and fast reduction algorit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::992d29f0648ff12f493f7054b83ed0ce
https://doi.org/10.1007/978-3-319-30840-1_11
https://doi.org/10.1007/978-3-319-30840-1_11
Autor:
Robert Granger, Michael Scott
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783662464465
Public Key Cryptography
Public Key Cryptography
In this paper we present a new multiplication algorithm for residues modulo the Mersenne prime \(2^{521} - 1\). Using this approach, on an Intel Haswell Core i7-4770, constant-time variable-base scalar multiplication on NIST’s (and SECG’s) curve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34356dc934db26eb48d11bd70fa4ffe3
https://doi.org/10.1007/978-3-662-46447-2_24
https://doi.org/10.1007/978-3-662-46447-2_24
Autor:
H. G. Dales
Publikováno v:
Proceedings of the Edinburgh Mathematical Society. 47:756-761
Autor:
Peter Kronheimer
Publikováno v:
Bulletin of the London Mathematical Society. 35:276-288