Minimal weight and colexicographically minimal integer representations
Redundant number systems (e.g., signed binary representations) have been utilized to efficiently implement algebraic operations required by public-key cryptosystems, especially those based on elliptic curves. Several families of integer representations have been proposed that have a minimal number o...
Main Authors: | Heuberger Clemens, Muir James A. |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2007-12-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc.2007.015 |
Similar Items
-
Correct order on some certain weighted representation functions
by: Chen, Shi-Qiang, et al.
Published: (2024-05-01) -
Inverse kinematics solution for humanoid robot minimizing gravity-related joint torques
by: Kacper Mikołajczyk, et al.
Published: (2022-06-01) -
Local Matrix Feature-Based Kernel Joint Sparse Representation for Hyperspectral Image Classification
by: Xiang Chen, et al.
Published: (2022-09-01) -
Self-Weighted Supervised Discriminative Feature Selection via Redundancy Minimization
by: Haihong Yu, et al.
Published: (2021-01-01) -
Person Re-Identification by Weighted Integration of Sparse and Collaborative Representation
by: Jie Guo, et al.
Published: (2017-01-01)