Cryptography and Coding
From MaRDI portal
(Redirected from Publication:5897510)
Cryptography and Coding (scientific article; zbMATH DE number 5069307)
Cryptography and Coding (scientific article; zbMATH DE number 5069307)
Recommendations
Cited in
(64)- Using abelian varieties to improve pairing-based cryptography
- On the relationship between squared pairings and plain pairings
- Pairing-based cryptography on elliptic curves
- Choosing and generating parameters for pairing implementation on BN curves
- Efficient optimal ate pairing at 128-bit security level
- Efficient implementation of pairing-based cryptosystems
- Batch verification of short signatures
- Updating key size estimations for pairings
- A taxonomy of pairing-friendly elliptic curves
- Improving the computation of the optimal ate pairing for a high security level
- Searching BN curves for SM9
- Still wrong use of pairings in cryptography
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- 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
- Guide to pairing-based cryptography
- Faster hashing to \({\mathbb G}_2\)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography
- Efficient multiplication in finite field extensions of degree 5
- Parallelizing the Weil and Tate pairings
- On the efficient implementation of pairing-based protocols
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
- Faster Pairings on Special Weierstrass Curves
- Pairing computation on Edwards curves with high-degree twists
- A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function
- Applications of elliptic curve pairings in cryptography
- On the efficiency and security of pairing-based protocols in the type 1 and type 4 settings
- The number field sieve for integers of low weight
- Security Analysis of the Strong Diffie-Hellman Problem
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Pairings in Trusted Computing
- 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}$
- 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
- On Software Parallel Implementation of Cryptographic Pairings
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
- scientific article; zbMATH DE number 2081059 (Why is no real title available?)
- The pairing computation on Edwards curves
- scientific article; zbMATH DE number 2086872 (Why is no real title available?)
- Efficient algorithms for secure outsourcing of bilinear pairings
- Efficient self-pairing on ordinary elliptic curves
- A brief history of pairings
- Information Security and Privacy
- Pairing-Friendly Elliptic Curves with Small Security Loss by Cheon’s Algorithm
- Optimised Versions of the Ate and Twisted Ate Pairings
- Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism
- There is no safe pairing function over an arbitrary structure
- Another Approach to Pairing Computation in Edwards Coordinates
- On the elliptic curves \(y^{2}=x^{3} - c\) with embedding degree one
- Algorithmic Number Theory
- Discrete logarithm problems with auxiliary inputs
- Keyword-Based Delegable Proofs of Storage
- Computing bilinear pairings on elliptic curves with automorphisms
- Secure and Efficient Pairing at 256-Bit Security Level
- On cycles of pairing-friendly abelian varieties
- The Diffie-Hellman problem and generalization of Verheul's theorem
- SEMD: secure and efficient message dissemination with policy enforcement in VANET
- A comparison of MNT curves and supersingular curves
- Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\)
This page was built for publication: Cryptography and Coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897510)
