Results 1 to 10 of about 7,844 (165)
Discrete logarithm problem in matrix
Lietuvos Matematikos Rinkinys, 2023 In this paper the discrete logarithm problem in matrix in finite fields is formulated, possible ways of solution are given.
Povilas Tvarijonas +2 more
doaj +4 more sources
A new method for solving the elliptic curve discrete logarithm problem [PDF]
Groups, Complexity, Cryptology, 2021 The elliptic curve discrete logarithm problem is considered a secure cryptographic primitive. The purpose of this paper is to propose a paradigm shift in attacking the elliptic curve discrete logarithm problem.
Ansari Abdullah +2 more
doaj +1 more source
The review on elliptic curves as cryptographic pairing groups [PDF]
Mathematics and Computational Sciences, 2021 Elliptic curve is a set of two variable points on polynomials of degree 3 over a field acted by an addition operation that forms a group structure. The motivation of this study is the mathematics behind that elliptic curve to the applicability within a ...
E Khamseh
doaj +1 more source
DLP in semigroups: Algorithms and lower bounds
Journal of Mathematical Cryptology, 2022 The discrete logarithm problem (DLP) in semigroups has attracted some interests and serves as the foundation of many cryptographic schemes. In this work, we study algorithms and lower bounds for DLP in semigroups.
Han Jiao, Zhuang Jincheng
doaj +1 more source
On the Discrete Logarithmic Minkowski Problem [PDF]
International Mathematics Research Notices, 2015 If \(K\subset{\mathbb R}^n\) is a convex body (compact and convex set with non-empty interior) containing the origin as an interior point, the cone-volume measure of \(K\) is the Borel measure on the unit sphere \(S^{n-1}\) defined by \[ V_K(\omega)=\frac{1}{n}\int_{x\in\nu_K^{-1}(\omega)}x\cdot\nu_K(x)d\mathcal{H}^{n-1}(x), \quad \text{for each Borel }
Böröczky, Károly (Ifj.) +2 more
openaire +2 more sources
Computing discrete logarithm by interval-valued paradigm [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Interval-valued computing is a relatively new computing paradigm. It uses finitely many interval segments over the unit interval in a computation as data structure.
Benedek Nagy, Sándor Vályi
doaj +1 more source
Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem
Journal of Mathematical Cryptology, 2020 We initiate the study of a new class of polynomials which we call quasi-subfield polynomials. First, we show that this class of polynomials could lead to more efficient attacks for the elliptic curve discrete logarithm problem via the index calculus ...
Huang Ming-Deh +4 more
doaj +1 more source
Variational Quantum Algorithm for Solving Discrete Logarithms [PDF]
Jisuanji kexueThe discrete logarithm problem is a significant challenge in number theory,and due to the difficulty of solving it,classical computers lack efficient algorithms for this task.As a result,the discrete logarithm problem is widely used in public key ...
ZHANG Xinglan, RONG Xiaojun
doaj +1 more source
SIDH Hybrid Schemes with Classical Component Based on the Discrete Logarithm Problem over Finite Field Extension [PDF]
International Journal of Electronics and Telecommunications, 2020 The concept of a hybrid scheme with connection of SIDH and ECDH is nowadays very popular. In hardware implementations it is convenient to use a classical key exchange algorithm, which is based on the same finite field as SIDH. Most frequently used hybrid
Michał Wroński +2 more
doaj +1 more source
Privacy-Preserved Image Protection Supporting Different Access Rights
Applied Sciences, 2022 The boom in cloud computing and social networking has led to a large number of online users in the networks. It is necessary to use appropriate privacy protection mechanisms to prevent personal privacy leakage.
Ya-Fen Chang +2 more
doaj +1 more source