Analysis of linear combination algorithms in cryptography
From MaRDI portal
Recommendations
Cited in
(14)- Variances and covariances in the central limit theorem for the output of a transducer
- Dynamical directions in numeration
- The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
- A note on an algorithm in cryptography
- Analysis of the Binary Asymmetric Joint Sparse Form
- ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS
- Numeration and discrete dynamical systems
- Applied Cryptography and Network Security
- Linear decomposition method in analyzing hidden information protocols on algebraic platforms
- Graphs, digits and cryptography
- Two methods on computing g^ah^b in a group
- Minimal weight and colexicographically minimal integer representations
- Unbalanced digit sets and the closest choice strategy for minimal weight integer representations
- The Hamming weight of the non-adjacent-form under various input statistics
This page was built for publication: Analysis of linear combination algorithms in cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944493)