Parallelizing the Weil and Tate Pairings (Q3104701)

From MaRDI portal

Revision as of 18:38, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Parallelizing the Weil and Tate Pairings	scientific article

Statements

scholarly article

0 references

Parallelizing the Weil and Tate Pairings (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-25516-8_17

0 references

Diego F. Aranha

0 references

0 references

Francisco Rodríguez-Henríquez

0 references

Alfred J. Menezes

0 references

Cryptography and Coding

0 references

publication date

16 December 2011

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

describes a project that uses

Barreto-Naehrig

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-25516-8_17

0 references

0 references

Faster Explicit Formulas for Computing Pairings over Ordinary Curves

0 references

High-Speed Parallel Software Implementation of the η T Pairing

0 references

Efficient Software Implementation of Binary Field Arithmetic Using Vector Instruction Sets

0 references

Efficient pairing computation on supersingular abelian varieties

0 references

Selected Areas in Cryptography

0 references

Pairing-Friendly Elliptic Curves of Prime Order

0 references

A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$

0 references

High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves

0 references

Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves

0 references

Advances in Cryptology - EUROCRYPT 2004

0 references

0 references

ECC2K-130 on Cell CPUs

0 references

Faster Pairing Computations on Curves with High-Degree Twists

0 references

FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction

0 references

Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves

0 references

Faster $\mathbb{F}_p$ -Arithmetic for Cryptographic Pairings on Barreto-Naehrig Curves

0 references

Pairings for cryptographers

0 references

Efficient and optimal exponentiation in finite fields

0 references

On Software Parallel Implementation of Cryptographic Pairings

0 references

Ate Pairing on Hyperelliptic Curves

0 references

Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

0 references

Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm

0 references

0 references

Pairing Lattices

0 references

The Eta Pairing Revisited

0 references

A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases

0 references

Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves

0 references

Cryptography and Coding

0 references

Efficient and Generalized Pairing Computation on Abelian Varieties

0 references

0 references

The Weil pairing, and its efficient calculation

0 references

Five, six, and seven-term Karatsuba-like formulae

0 references

New Software Speed Records for Cryptographic Pairings

0 references

Integer Variable χ–Based Ate Pairing

0 references

On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves

0 references

Optimal Pairings

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3104701

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3104701&oldid=35258432"