Results 51 to 60 of about 7,844 (165)
Improved cryptanalysis of a ElGamal Cryptosystem Based on Matrices Over Group Rings
Journal of Mathematical Cryptology, 2020 ElGamal cryptosystem has emerged as one of the most important construction in Public Key Cryptography (PKC) since Diffie-Hellman key exchange protocol was proposed. However, public key schemes which are based on number theoretic problems such as discrete
Pandey Atul +2 more
doaj +1 more source
On the discrete logarithm problem
, 2008 Let $p>2$ be prime and $g$ a primitive root modulo $p$. We present an argument for the fact that discrete logarithms of the numbers in any arithmetic progression are uniformly distributed in $[1,p]$ and raise some questions on the subject.
openaire +2 more sources
On new multivariate cryptosystems based on hidden Eulerian equations
Доповiдi Нацiональної академiї наук УкраїниWe propose new multivariate cryptosystems over an n-dimensional free module over the arithmetical ring Zm based on the idea of hidden discrete logarithm for Zm∗. These cryptosystems are based on the hidden Eulerian equations.
V.A. Ustimenko
doaj +1 more source
Finding discrete logarithms with a set orbit distinguisher
Journal of Mathematical Cryptology, 2012 We consider finding discrete logarithms in a group of prime order p when the help of an algorithm D that distinguishes certain subsets of from each other is available.
Gallant Robert P.
doaj +1 more source
A Provably-Secure Outsourced Revocable Certificateless Signature Scheme Without Bilinear Pairings
IEEE Access, 2018 Certificateless public key cryptosystem (CLPKC) is a desirable cryptographic system because it refrains from both certificate management and key escrow. In CLPKC, how to revoke a misbehaving or compromised user is an important issue.
Hongzhen Du, QiaoYan Wen, Shanshan Zhang
doaj +1 more source
Discrete logarithm problem using index calculus method
Mathematical and Computer Modelling, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Padmavathy, R., Bhagvati, Chakravarthy
openaire +2 more sources
ON GENERIC COMPLEXITY OF THE DISCRETE LOGARITHM PROBLEM
Prikladnaya diskretnaya matematika, 2016 Summary: Generic-case approach to algorithmic problems was suggested by \textit{I. Kapovich} et al. [J. Algebra 264, No. 2, 665--694 (2003; Zbl 1041.20021)]. This approach studies behaviour of an algorithm on typical (almost all) inputs and ignores the rest of inputs.
openaire +2 more sources
Discrete logarithm problem on elliptic curves
, 2022 The use of elliptic curves in cryptography has become widespread to ensure the security of communications or financial transactions. This is mainly due to the fact that its security relies on the difficulty of the discrete logarithm problem which allows the use of elliptic curves with parameters that ensure efficiency.In t his thesis, we mainly address
openaire +1 more source
Cryptographic hardness assumptions identification based on discrete wavelet transform
Complex & Intelligent SystemsCryptanalysts can use appropriate attack strategies to attempt decryption by accurately identifying the cryptographic hardness assumption underlying ciphertexts or digital signatures.
Ke Yuan +6 more
doaj +1 more source
Quantum Complexity for Discrete Logarithms and Related Problems
This paper studies the quantum computational complexity of the discrete logarithm (DL) and related group-theoretic problems in the context of generic algorithms -- that is, algorithms that do not exploit any properties of the group encoding. We establish a generic model of quantum computation for group-theoretic problems, which we call the quantum ...
Hhan, Minki +2 more
openaire +2 more sources