Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Twisted Edwards curves revisited
This paper introduces fast algorithms for performing group operations on twisted Edwards
curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a …
curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a …
Exploiting the power of GPUs for asymmetric cryptography
R Szerwinski, T Güneysu - International Workshop on Cryptographic …, 2008 - Springer
Abstract Modern Graphics Processing Units (GPU) have reached a dimension with respect
to performance and gate count exceeding conventional Central Processing Units (CPU) by …
to performance and gate count exceeding conventional Central Processing Units (CPU) by …
Twisted hessian curves
This paper presents new speed records for arithmetic on a large family of elliptic curves with
cofactor 3: specifically, 8.77 M 8.77 M per bit for 256-bit variable-base single-scalar …
cofactor 3: specifically, 8.77 M 8.77 M per bit for 256-bit variable-base single-scalar …
Efficient arithmetic on Hessian curves
This paper considers a generalized form for Hessian curves. The family of generalized
Hessian curves covers more isomorphism classes of elliptic curves. Over a finite field F_q, it …
Hessian curves covers more isomorphism classes of elliptic curves. Over a finite field F_q, it …
Decaf: Eliminating cofactors through point compression
M Hamburg - Advances in Cryptology--CRYPTO 2015: 35th Annual …, 2015 - Springer
We propose a new unified point compression format for Edwards, Twisted Edwards and
Montgomery curves over large-characteristic fields, which effectively divides the curve's …
Montgomery curves over large-characteristic fields, which effectively divides the curve's …
ECM on graphics cards
This paper reports record-setting performance for the elliptic-curve method of integer
factorization: for example, 926.11 curves/second for ECM stage 1 with B 1= 8192 for 280-bit …
factorization: for example, 926.11 curves/second for ECM stage 1 with B 1= 8192 for 280-bit …
[PDF][PDF] Cryptographic schemes based on isogenies
A Stolbunov - 2012 - ntnuopen.ntnu.no
In this thesis we use isogenies between ordinary elliptic curves for the construction of new
cryptographic schemes. The thesis is organized into an introductory chapter followed by …
cryptographic schemes. The thesis is organized into an introductory chapter followed by …
Jacobi quartic curves revisited
This paper provides new results about efficient arithmetic on Jacobi quartic form elliptic
curves, y 2= dx 4+ 2 ax 2+ 1. With recent bandwidth-efficient proposals, the arithmetic on …
curves, y 2= dx 4+ 2 ax 2+ 1. With recent bandwidth-efficient proposals, the arithmetic on …
[PDF][PDF] The billion-mulmod-per-second PC
This paper sets new speed records for ECM, the elliptic-curve method of factorization, on
several different hardware platforms: GPUs (specifically the NVIDIA GTX), x86 CPUs with …
several different hardware platforms: GPUs (specifically the NVIDIA GTX), x86 CPUs with …
Performance analysis and comparison of different elliptic curves on smart cards
Elliptic curves are very often used in the cryptographic protocol design due to their memory
efficiency and useful features, such as the bilinear pairing support. However, in many …
efficiency and useful features, such as the bilinear pairing support. However, in many …