Advances in Elliptic Curve Cryptography
From MaRDI portal
Curves over finite and local fields (11G20) Research exposition (monographs, survey articles) pertaining to algebraic geometry (14-02) Applications to coding theory and cryptography of arithmetic geometry (14G50) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cryptography (94A60)
Recommendations
Cited in
(82)- Pairings for cryptographers
- Pairing-based cryptography on elliptic curves
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
- Protecting ECC against fault attacks: the ring extension method revisited
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory
- Constructing locally leakage-resilient linear secret-sharing schemes
- A taxonomy of pairing-friendly elliptic curves
- Still wrong use of pairings in cryptography
- A theta model for elliptic curves
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- Efficient pairing computation on supersingular abelian varieties
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Polynomial approximation of bilinear Diffie-Hellman maps
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method
- Constructing pairing-friendly hyperelliptic curves using Weil restriction
- Heuristics of the Cocks-Pinch method
- On Edwards curves and ZVP-attacks
- On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings
- Cryptography on twisted Edwards curves over local fields
- Statistics about elliptic curves over finite prime fields
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory: extended version
- Radical isogenies
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- Faster Ate pairing computation on Selmer's model of elliptic curves
- On the Security of Supersingular Isogeny Cryptosystems
- Elliptic curves with j=0,1728 and low embedding degree
- Scalable group key exchange protocol with provable security
- Multibase scalar multiplications in cryptographic pairings
- An analysis of affine coordinates for pairing computation
- Binary Huff Curves
- On the efficient implementation of pairing-based protocols
- Efficient system parameters for identity-based encryption using supersingular elliptic curves
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Fast Hashing to G 2 on Pairing-Friendly Curves
- Power analysis to ECC using differential power between multiplication and squaring
- A Tree-Based Approach for Computing Double-Base Chains
- Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax
- Breaking and Repairing Damgård et al. Public Key Encryption Scheme with Non-interactive Opening
- A Schnorr-Like Lightweight Identity-Based Signature Scheme
- Distinguishing Multiplications from Squaring Operations
- Complexity of computation in finite fields
- On isogeny classes of Edwards curves over finite fields
- The pairing computation on Edwards curves
- A novel elliptic curve scalar multiplication algorithm against power analysis
- scientific article; zbMATH DE number 2114384 (Why is no real title available?)
- On the computation of class polynomials with ``thetanullwerte`` and its applications to the unit group computation
- Efficient self-pairing on ordinary elliptic curves
- Huff's model for elliptic curves
- On algorithmic constructions of isogenies of elliptic curves over finite fields and their applications
- Point multiplication on elliptic curves over finite fields using many-base number systems and new types of coordinates
- Fixed argument pairing inversion on elliptic curves
- HECC (hyperelliptic curve cryptography)
- ON BOUNDS FOR BALANCED EMBEDDING DEGREE
- Attacks on digital signature schemes not accounted by the common security definitions, and countermeasures
- Supersingular isogeny-based cryptography: a survey
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Generalised Mersenne numbers revisited
- Faster Addition and Doubling on Elliptic Curves
- On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves
- The double-base number system and its application to elliptic curve cryptography
- An Analysis of the Vector Decomposition Problem
- Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction
- Escrow-free encryption supporting cryptographic workflow
- A Killer Application for Pairings: Authenticated Key Establishment in Underwater Wireless Sensor Networks
- Another Approach to Pairing Computation in Edwards Coordinates
- Algebraic curves and cryptography
- Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves
- Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists
- Weak instances of class group action based cryptography via self-pairings
- The "Elliptic" matrices and a new kind of cryptography
- On cycles of pairing-friendly abelian varieties
- On chains of pairing-friendly elliptic curves
- Special TNFS-secure pairings on ordinary genus 2 hyperelliptic curves
- Lit-SiGamal: an efficient isogeny-based PKE based on a LIT diagram
- An identity-based strongly unforgeable signature without random oracles from bilinear pairings
- Cycles of supersingular elliptic curves for pairing-based proof systems
- Trapdoor DDH groups from pairings and isogenies
- A survey of fault attacks in pairing based cryptography
- Four decades of research on bent functions
- Recent progress on the elliptic curve discrete logarithm problem
- New designing of cryptosystems based on quadratic fields
This page was built for publication: Advances in Elliptic Curve Cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463612)
