Results 11 to 20 of about 6,164,294 (286)
The Discrete Logarithm Problem [PDF]
, 2016 For large prime numbers p, computing discrete logarithms of elements of the multiplicative group (Z∕pZ)∗ is at present a very difficult problem. The security of certain cryptosystems is based on the difficulty of this computation. In this expository paper we discuss several generalizations of the discrete logarithm problem and we describe various ...
René Schoof +3 more
openaire +4 more sources
On the Complexity of Generalized Discrete Logarithm Problem [PDF]
CoRR, 2022 Generalized Discrete Logarithm Problem (GDLP) is an extension of the Discrete Logarithm Problem where the goal is to find $x\in\mathbb{Z}_s$ such $g^x\mod s=y$ for a given $g,y\in\mathbb{Z}_s$. Generalized discrete logarithm is similar but instead of a single base element, uses a number of base elements which does not necessarily commute with each ...
Cem M. Unsal, Rasit Onur Topaloglu
core +4 more sources
A deterministic algorithm for the discrete logarithm problem in a semigroup
Journal of Mathematical Cryptology, 2022 The discrete logarithm problem (DLP) in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have a time complexity of O(NlogN)O\left(\sqrt{N}\log N) and a space complexity of O(N)O\left ...
Tinani Simran, Rosenthal Joachim
doaj +6 more sources
Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem [PDF]
Journal of Mathematical Cryptology, 2009 Biggs has recently proposed the critical group of a certain class of finite graphs as a platform group for cryptosystems relying on the difficulty of the discrete log problem. The paper uses techniques from the theory of Picard groups on finite graphs to
Blackburn Simon R.
doaj +2 more sources
The Discrete Logarithm Problem in non-representable rings. [PDF]
IACR Cryptol. ePrint Arch., 2012 Bergman\u27s Ring $E_p$, parameterized by a prime number $p$, is a ring with $p^5$ elements that cannot be embedded in a ring of matrices over any commutative ring. This ring was discovered in 1974.
Matan Banin, Boaz Tsaban
core +4 more sources
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
Trace zero varieties in cryptography : optimal representation and index calculus [PDF]
, 2014 The trace zero variety associated to an elliptic or hyperelliptic curve is an abelian variety defined over a finite field F_q. Its F_q-rational points yield a finite group, the trace zero subgroup of the degree zero Picard group of the original curve ...
Massierer, Maike
core +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
On the Distributed Discrete Logarithm Problem with Preprocessing.
IACR Cryptol. ePrint Arch., 2022 Protocols solving the Distributed Discrete Logarithm (DDLog) problem are a core component of many recent constructions of group-based homomorphic secret sharing schemes. On a high-level, these protocols enable two parties to transform multiplicative shares of a secret into additive share locally without any communication.
Pavel Hubácek +2 more
openaire +4 more sources
Split logarithm problem and a candidate for a post-quantum signature scheme [PDF]
Computer Science Journal of Moldova, 2022 A new form of the hidden discrete logarithm problem, called split logarithm problem, is introduced as primitive of practical post-quantum digital signature schemes, which is characterized in using two non-permutable elements $A$ and $B$ of a finite non-
A.A. Moldovyan, N.A. Moldovyan
doaj +1 more source