On Modular Decomposition of Integers
From MaRDI portal
Recommendations
- The Gallant-Lambert-Vanstone decomposition revisited
- Constructing elliptic curves for the GLV method with low-cost decomposition
- scientific article; zbMATH DE number 2085440
- scientific article; zbMATH DE number 1951601
- Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians
Cites work
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Accelerated Verification of ECDSA Signatures
- Distribution of some sequences of points on elliptic curves
- Distribution results for low-weight binary representations for pairs of integers
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- scientific article; zbMATH DE number 2085440 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 1951601 (Why is no real title available?)
- scientific article; zbMATH DE number 1951602 (Why is no real title available?)
- scientific article; zbMATH DE number 1842492 (Why is no real title available?)
- scientific article; zbMATH DE number 2114384 (Why is no real title available?)
- On Lovász' lattice reduction and the nearest lattice point problem
Cited in
(5)- Cunningham numbers in modular arithmetic
- scientific article; zbMATH DE number 2085440 (Why is no real title available?)
- Regular integers modulo n
- scientific article; zbMATH DE number 1951601 (Why is no real title available?)
- Integer matrix size 2 2 sub-decomposition method for elliptic curve cryptography
This page was built for publication: On Modular Decomposition of Integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637152)