The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems

DOI10.1109/18.771254zbMath0957.94025OpenAlexW2158553589MaRDI QIDQ4701442

No author found.

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/882354510ddc955c8d7e13c529ad53002f2b0966

zbMATH Keywords

elliptic curvesdiscrete logarithmTate pairingmultiplicative group of finite fields

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items

Faster Ate pairing computation on Selmer's model of elliptic curves ⋮ Boneh-Franklin IBE ⋮ The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves ⋮ The generalized Weil pairing and the discrete logarithm problem on elliptic curves ⋮ The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic ⋮ Isolated elliptic curves and the MOV attack ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ An improved two-party identity-based authenticated key agreement protocol using pairings ⋮ Polynomial approximation of bilinear Diffie-Hellman maps ⋮ New versions of Miller-loop secured against side-channel attacks ⋮ Zero-knowledge identification scheme based on Weil pairing ⋮ The discrete logarithm problem from a local duality perspective ⋮ Unnamed Item ⋮ Parallelizing pairings on Hessian elliptic curves ⋮ Security weaknesses of a signature scheme and authenticated key agreement protocols ⋮ Local Duality and the Discrete Logarithm Problem ⋮ All-in-one group-oriented cryptosystem based on bilinear pairing ⋮ New Constructions and Applications of Trapdoor DDH Groups ⋮ Revisiting Pairing Based Group Key Exchange ⋮ On bilinear structures on divisor class groups ⋮ A NEW BATCH IDENTIFICATION SCHEME ⋮ On the Efficient Implementation of Pairing-Based Protocols ⋮ On the complexity of the discrete logarithm and Diffie-Hellman problems ⋮ Elliptic curves suitable for pairing based cryptography