Advances in Cryptology - ASIACRYPT 2003

DOI10.1007/b94617zbMath1189.11056OpenAlexW2899867281MaRDI QIDQ5902377

Iwan M. Duursma, Hyang-Sook Lee

Publication date: 5 January 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b94617

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items

Pairing-Based Cryptography ⋮ Multibase scalar multiplications in cryptographic pairings ⋮ Efficient pairing computation on supersingular abelian varieties ⋮ A comparison of MNT curves and supersingular curves ⋮ Formulas for cube roots in \(\mathbb F_{3^m}\) ⋮ Complexity of computation in finite fields ⋮ Self-pairings on supersingular elliptic curves with embedding degree \textit{three} ⋮ A survey of fault attacks in pairing based cryptography ⋮ Computing bilinear pairings on elliptic curves with automorphisms ⋮ Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves ⋮ Faster pairing computation on genus \(2\) hyperelliptic curves ⋮ Optimal pairing computation over families of pairing-friendly elliptic curves ⋮ Formulas for cube roots in \(\mathbb F_{3^m}\) using shifted polynomial basis ⋮ On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings ⋮ Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\) ⋮ Closed formulae for the Weil pairing inversion ⋮ Ordinary Abelian varieties having small embedding degree ⋮ Efficient Tate pairing computation using double-base chains ⋮ A refinement of Müller's cube root algorithm ⋮ Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five ⋮ Algebraic curves and cryptography ⋮ Efficient Self-pairing on Ordinary Elliptic Curves ⋮ An Efficient ID-Based Proxy Signature Scheme from Pairings ⋮ Exponentiation in Pairing-Friendly Groups Using Homomorphisms ⋮ Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms ⋮ Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition ⋮ A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ ⋮ Optimised Versions of the Ate and Twisted Ate Pairings ⋮ Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$ ⋮ Efficient \(p\)th root computations in finite fields of characteristic \(p\) ⋮ Polynomial generating pairing and its criterion for optimal pairing ⋮ Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates ⋮ On Software Parallel Implementation of Cryptographic Pairings ⋮ Cryptographic Pairings Based on Elliptic Nets ⋮ Escrow-free encryption supporting cryptographic workflow ⋮ On the relationship between squared pairings and plain pairings ⋮ New cube root algorithm based on the third order linear recurrence relations in finite fields ⋮ Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves