Results 1 to 10 of about 1,369 (85)
One option for a digital signature solution for devices with low memory and low bandwidth transmission over channels uses a short digital signature scheme based on Weil bilinear pairing aimed at short processing times, fast computation, and convenient ...
Nhu-Quynh Luc +2 more
doaj +1 more source
A proof of nondegeneracy of the Tate pairing and Kolyvagin's formula for elliptic curves with good reductions over an $n$-dimensional ($nleq 3$) pseudolocal field, the Tate pairing associated to an isogeny between abelian varieties over pseudolocal field
V. I. Nesteruk
doaj +3 more sources
Efficient Security and Privacy Protection for Emerging Smart RFID Communications [PDF]
Due to its constrained nature, the use of smart RFID technology introduces tremendous security and privacy issues. This paper presents IMAKA-Tate: Identity protection, Mutual Authentication and Key Agreement using Tate pairing of Identity-based ...
Mohammad Fal Sadikin, Marcel Kyas
doaj +1 more source
We construct a $(\mathfrak {gl}_2, B(\mathbb {Q}_p))$ and Hecke-equivariant cup product pairing between overconvergent modular forms and the local cohomology at $0$ of a sheaf on $\mathbb {P}^1$, landing in the compactly supported completed $\mathbb {C ...
Sean Howe
doaj +1 more source
Constructing Pairing-Friendly Elliptic Curves under Embedding Degree 1 for Securing Critical Infrastructures. [PDF]
Information confidentiality is an essential requirement for cyber security in critical infrastructure. Identity-based cryptography, an increasingly popular branch of cryptography, is widely used to protect the information confidentiality in the critical ...
Maocai Wang +4 more
doaj +1 more source
Parallelizing pairings on Hessian elliptic curves
This paper considers the computation of the Ate pairing on the Hessian model of elliptic curves. Due to the many important properties making the model attractive in cryptography, we compute for the first time the Ate pairing on this model and show how ...
Emmanuel Fouotsa
doaj +1 more source
Efficient computation of pairings on Jacobi quartic elliptic curves
This paper proposes the computation of the Tate pairing, Ate pairing and its variations on the special Jacobi quartic elliptic curve Y2=dX4+Z4$Y^{2}=dX^{4}+Z^{4}$.
Duquesne Sylvain +2 more
doaj +1 more source
Self-pairings on hyperelliptic curves
A self-pairing is a pairing computation where both inputs are the same group element. Self-pairings are used in some cryptographic schemes and protocols. In this paper, we show how to compute the Tate–Lichtenbaum pairing on a curve more efficiently than
Galbraith Steven D., Zhao Chang-An
doaj +1 more source
Attribute-based encryption (ABE) is used for achieving data confidentiality and access control in cloud environments. Most often ABE schemes are constructed using bilinear pairing which has a higher computational complexity, making algorithms inefficient
Balaji Chandrasekaran +1 more
doaj +1 more source
We revisit the classification of rank-1 4d N=2 $$ \mathcal{N}=2 $$ QFTs in the spirit of Diophantine Geometry, viewing their special geometries as elliptic curves over the chiral ring (a Dedekind domain).
Matteo Caorsi, Sergio Cecotti
doaj +1 more source

