Cryptanalysis of the CFVZ cryptosystem
J. J. Climent, E. Gorla, J. Rosenthal
Abstract
The paper analyzes a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve. It is shown that the complexity of solving the underlying problem for the proposed system is dominated by the complexity of solving a fixed number of discrete logarithm problems in the group of an elliptic curve. Using an adapted Pollard rho algorithm it is shown that this problem is essentially as hard as solving one discrete logarithm problem in the group of an elliptic curve.
Create a lesson
Related papers
Inference-Engine Fingerprinting Attacks are Practical: Exploring Model-Driven Environmental Discovery, Exploitation, and Escape
Sarah Radway, Andrew Cheng, Vijay Janapa Reddi et al.
Weather Data Spoofing Attacks on Rain-Adaptive Millimeter-Wave Frequency Selection in V2X Communication Networks
Rasheed Bello, Idreez Yusuf, Justice Adjei Owusu et al.
Empirical Analysis of Randomness Quality in Differential Privacy Mechanisms
Cesare Gerolimetto Fabrello, Valeria Rossi, Alberto Trombetta et al.
Towards TEE-Certified DP: Verifiable Differentially Private Training on Legacy GPUs
Li Ge, Wenjie Qu, Weitao Feng et al.
Fingerprinting Multimodal Large Language Models
Chao Huang, Meng Tong, Kejiang Chen
The More It Says, the More You Pay: A Black-Box Audit of Provider-Side Token Inflation in LLM Services
Leilei Chen, Lan Zhang, Chen Tang et al.