Cryptography and Coding

DOI10.1007/11586821zbMath1122.94038OpenAlexW2619930404MaRDI QIDQ5897510

Neal Koblitz, Alfred J. Menezes

Publication date: 1 November 2006

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

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

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items

Faster Hashing to ${\mathbb G}_2$, Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves, Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles, Pairing Computation on Edwards Curves with High-Degree Twists, Batch verification of short signatures, Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography, Self-pairings on supersingular elliptic curves with embedding degree \textit{three}, A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function, Keyword-Based Delegable Proofs of Storage, Computing bilinear pairings on elliptic curves with automorphisms, Elliptic curve cryptography: the serpentine course of a paradigm shift, Finding composite order ordinary elliptic curves using the Cocks-Pinch method, Heuristics of the Cocks-Pinch method, The pairing computation on Edwards curves, Efficient algorithms for secure outsourcing of bilinear pairings, Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\), Choosing and generating parameters for pairing implementation on BN curves, Efficient Multiplication in Finite Field Extensions of Degree 5, Efficient Self-pairing on Ordinary Elliptic Curves, The number field sieve for integers of low weight, On the elliptic curves \(y^{2}=x^{3} - c\) with embedding degree one, A taxonomy of pairing-friendly elliptic curves, Security Analysis of the Strong Diffie-Hellman Problem, Sequential Aggregate Signatures and Multisignatures Without Random Oracles, Pairing Computation on Twisted Edwards Form Elliptic Curves, 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, Discrete logarithm problems with auxiliary inputs, The Diffie-Hellman problem and generalization of Verheul's theorem, SEMD: secure and efficient message dissemination with policy enforcement in VANET, Point Decomposition Problem in Binary Elliptic Curves, ECM on Graphics Cards, What about Vulnerability to a Fault Attack of the Miller’s Algorithm During an Identity Based Protocol?, Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography, Faster Pairings on Special Weierstrass Curves, On Software Parallel Implementation of Cryptographic Pairings, Parallelizing the Weil and Tate Pairings, Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2, On the relationship between squared pairings and plain pairings, Another Approach to Pairing Computation in Edwards Coordinates, A Brief History of Pairings