A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ (Q3600512): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-85538-5_20 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W194557307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient pairing computation on supersingular abelian varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - ASIACRYPT 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardware Acceleration of the Tate Pairing in Characteristic Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Small Characteristic Algebraic Tori in Pairing-Based Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Eta Pairing Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2739458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardware architectures for the Tate pairing over GF\((2^{m})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Hardware for the Tate Pairing Calculation in Characteristic Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography and Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Security and Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing elliptic curve logarithms to logarithms in a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Weil pairing, and its efficient calculation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials / rank
 
Normal rank

Latest revision as of 02:02, 29 June 2024

scientific article
Language Label Description Also known as
English
A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
scientific article

    Statements

    A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 February 2009
    0 references
    0 references
    modified Tate pairing
    0 references
    reduced \(\eta _{T }\) pairing
    0 references
    finite field arithmetic
    0 references
    elliptic curve
    0 references
    hardware accelerator
    0 references
    FPGA
    0 references
    0 references