scientific article; zbMATH DE number 1302784
From MaRDI portal
Publication:4249254
Recommendations
Cited in
(34)- Эллиптическая пороговая схема разделения секрета
- Fast Point Multiplication on Elliptic Curves without Precomputation
- A note on inverted twisted Edwards curve
- Jacobi Quartic Curves Revisited
- Minimality and other properties of the width-𝑤 nonadjacent form
- Fast elliptic curve point multiplication based on window non-adjacent form method
- New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields
- Faster Addition and Doubling on Elliptic Curves
- Toric forms of elliptic curves and their arithmetic
- The double-base number system and its application to elliptic curve cryptography
- A formula for disaster: a unified approach to elliptic curve special-point-based attacks
- Efficient Window-Based Scalar Multiplication on Elliptic Curves Using Double-Base Number System
- Safe-errors on SPA protected implementations with the atomicity technique
- Twisted Hessian curves
- Matching for random systems with an application to minimal weight expansions
- Formulae for arithmetic on genus 2 hyperelliptic curves
- Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
- scientific article; zbMATH DE number 2160554 (Why is no real title available?)
- New fast algorithms for elliptic curve arithmetic in affine coordinates
- A novel elliptic curve scalar multiplication algorithm against power analysis
- Power attacks on a side-channel resistant elliptic curve implementation
- On binary signed digit representations of integers
- Double-base chains for scalar multiplications on elliptic curves
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- Fast and simple point operations on Edwards448 and E448
- Faster Pairings on Special Weierstrass Curves
- Compressed Jacobian coordinates for OEF
- The complete cost of cofactor \(h=1\)
- Invariant measures, matching and the frequency of 0 for signed binary expansions
- Improved precomputation scheme for scalar multiplication on elliptic curves
- Polymath: Groth16 is not the limit
- Exploiting collisions in addition chain-based exponentiation algorithms using a single trace
- Twisted Edwards Curves Revisited
- Improving the Big Mac attack on elliptic curve cryptography
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249254)
