Results 61 to 70 of about 169,709 (230)
Discrete logarithm computations over finite fields using Reed-Solomon codes [PDF]
, 2012 Cheng and Wan have related the decoding of Reed-Solomon codes to the computation of discrete logarithms over finite fields, with the aim of proving the hardness of their decoding.
Augot, Daniel, Morain, François
core +3 more sources
Implications of the Arithmetic Ratio of Prime Numbers for RSA Security
International Journal of Applied Mathematics and Computer Science, 2023 The most commonly used public key cryptographic algorithms are based on the difficulty in solving mathematical problems such as the integer factorization problem (IFP), the discrete logarithm problem (DLP) and the elliptic curve discrete logarithm ...
Ivanov Andrey, Stoianov Nikolai
doaj +1 more source
The monodromy pairing and discrete logarithm on the Jacobian of finite graphs
Journal of Mathematical Cryptology, 2010 Every graph has a canonical finite abelian group attached to it. This group has appeared in the literature under a variety of names including the sandpile group, critical group, Jacobian group, and Picard group.
Shokrieh Farbod
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
Publicly-Verifiable Proofs of Storage Based on the Discrete Logarithm Problem
IEEE Access, 2019 With the rapid development of cloud computing platforms, cloud storage services are becoming widespread in recent years. Based on these services, clients are able to store data on remote cloud servers and thereby saving their local storage.
Miaomiao Tian +5 more
doaj +1 more source
T-entropy and Variational principle for the spectral radius of weighted shift operators
, 2008 In this paper we introduce a new functional invariant of discrete time dynamical systems -- the so-called t-entropy. The main result is that this t-entropy is the Legendre dual functional to the logarithm of the spectral radius of the weighted shift ...
Antonevich +3 more
core +1 more source
Security of the cryptosystems based on ergodic matrices
Tongxin xuebao, 2015 The security of the public-key cryptosystems based on ergodicmatrices over finite field was analysed.According to the public key,a system of linear equations for the forged secret key bits is obtained by inverse matrix elimination method.It is proved ...
Hua-wei HUANG +3 more
doaj +2 more sources
Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem
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 +1 more source
IACR Communications in CryptologyThe Number Field Sieve and its variants are the best algorithms to solve the discrete logarithm problem in finite fields (except for the weak small characteristic case). The Factory variant accelerates the computation when several prime fields are targeted.
Haetham Al Aswad +2 more
openaire +2 more sources
On the statistics of superlocalized states in self-affine disordered potentials
, 2004 We investigate the statistics of eigenstates in a weak self-affine disordered potential in one dimension, whose Gaussian fluctuations grow with distance with a positive Hurst exponent $H$.
Crisanti A +20 more
core +1 more source