Results 11 to 20 of about 169,709 (230)
Nonparametric volatility density estimation for discrete time models [PDF]
, 2002 We consider discrete time models for asset prices with a stationary volatility process. We aim at estimating the multivariate density of this process at a set of consecutive time instants.
Spreij, Peter +2 more
core +6 more sources
IEEE Transactions on Quantum Engineering, 2023 Presents corrections to the article “The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers”.
Yoshinori Aono +6 more
doaj +1 more source
Discrete logarithms in free groups [PDF]
, 2004 For the free group on n generators we prove that the discrete logarithm is distributed according to the standard Gaussian when the logarithm is renormalized appropriately.Comment: 9 pages, 1 figure, Corrects a mistake in the Introduction and Section
Communicated Wen-ching Winnie Li +3 more
core +3 more sources
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
Exact quantum Fourier transforms and discrete logarithm algorithms [PDF]
, 2003 We show how the quantum fast Fourier transform (QFFT) can be made exact for arbitrary orders (first for large primes). For most quantum algorithms only the quantum Fourier transform of order $2^n$ is needed, and this can be done exactly.
Mosca, Michele, Zalka, Christof
core +4 more sources
Finding low-weight polynomial multiples using discrete logarithm [PDF]
, 2007 Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The classical algorithm to solve this problem is based on a time memory trade-off.
Domaine De Voluceau +3 more
core +5 more sources
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
Hard Instances of the Constrained Discrete Logarithm Problem [PDF]
, 2006 The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent $x$ belongs to a set known to the attacker. The complexity of generic algorithms for solving the constrained DLP depends on the choice of the set ...
A. Naor +26 more
core +3 more sources
A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem [PDF]
, 2018 In this paper, we describe a new Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. The algorithm depends on a property of the group of rational points of an elliptic curve and is thus not a generic algorithm.
Mahalanobis, Ayan, Mallick, Vivek
core +2 more sources