搜索结果: 1-9 共查到“密码学 Supersingular elliptic curves”相关记录9条 . 查询时间(0.062 秒)
On the cost of computing isogenies between supersingular elliptic curves
SIDH CSSI cryptanalysis
2018/4/4
we demonstrate that the van Oorschot-Wiener collision finding algorithm has a lower cost (but higher running time) for solving CSSI, and thus should be used instead of the meet-in-the-middle attack to...
ON ISOGENY GRAPHS OF SUPERSINGULAR ELLIPTIC CURVES OVER FINITE FIELDS
foundations Supersingular isogeny graphs
2018/2/8
We study the isogeny graphs of supersingular elliptic curves over finite fields, with an emphasis on the vertices corresponding to elliptic curves of jj-invariant 0 and 1728.
On the Hardness of Computing Endomorphism Rings of Supersingular Elliptic Curves
Supersingular isogeny based cryptography number theory
2017/10/10
Cryptosystems based on supersingular isogenies have been proposed recently for use in post-quantum cryptography. Three problems have emerged related to their hardness: computing an isogeny between two...
On a Relation between the Ate Pairing and the Weil Pairing for Supersingular Elliptic Curves
Ate pairing Weil pairing
2014/3/10
The hyperelliptic curve Ate pairing provides an efficient way to compute a bilinear pairing on the Jacobian variety of a hyperelliptic curve. We prove that, for supersingular elliptic curves with embe...
Self-pairings on supersingular elliptic curves with embedding degree $three$
Tate pairing Weil pairing
2014/3/10
Self-pairings are a special subclass of pairings and have interesting applications in cryptographic schemes and protocols. In this paper, we explore the computation of the self-pairings on supersingul...
Fast Architectures for the T Pairing over Small-Characteristic Supersingular Elliptic Curves
Tate pairing T pairing elliptic curve FPGA
2009/8/18
This paper is devoted to the design of fast parallel
accelerators for the cryptographic T pairing on supersingular
elliptic curves over finite fields of characteristics two and three.
We propose h...
Multicore Implementation of the Tate Pairing over Supersingular Elliptic Curves
Tate pairing supersingular curve finite field arithmetic
2009/6/15
This paper describes the design of a fast multicore library
for the cryptographic Tate pairing over supersingular elliptic curves. We
report a calculation time of just 3:15 ms and 1:87 ms on the Int...
Efficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields
supersingular elliptic curve Tate pairing divisor
2009/4/1
After Miller's original algorithm for the Tate pairing computation, many improved
algorithms have been suggested, to name just a few, by Galbraith et al. and Barreto et al.,
especially for the field...
A Note on Point Multiplication on Supersingular Elliptic Curves over Ternary Fields
supersingular elliptic curve point addition point doubling point tripling point multiplication ternary field
2008/5/30
Recently, the supersingular elliptic curves over ternary fields are widely used in pairing based crypto-applications since they achieve the best possible ratio between security level and space require...
