Results 51 to 60 of about 169,709 (230)
Journal of Telecommunications and Information TechnologyThis paper investigates how to reduce the elliptic curve discrete logarithm problem over prime fields to the quadratic unconstrained binary optimization (QUBO) problem in order to obtain as few logical qubits as possible. In the best case scenario, if n
Michał Wroński +3 more
doaj +1 more source
Realization of coprocessor which supports counting of discrete logarithm on elliptic curves with partial knowledge [PDF]
Biuletyn Wojskowej Akademii Technicznej, 2017 In this paper we analyse realization of a coprocessor which supports counting of discrete logarithm on elliptic curves over the field FG(p), where p is the large prime, in FPGA. Main idea of the realization is based on using modules which are able to add
Michał Kędzierski +2 more
doaj +1 more source
MODIFICATION OF POLLARD RHO ALGORITHM USING NEGATION MAPPING
Barekeng, 2022 El Gamal encryption was introduced in 1985 and is still commonly used today. Its hardness is based on a discrete logarithm problem defined over the finite abelian cyclic group group chosen in the original paper was but later it was proven that using the
Sa'aadah Sajjana Carita, Herman Kabetta
doaj +1 more source
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 +1 more source
New Representative Collective Signatures Based on the Discrete Logarithm Problem [PDF]
, 2022 Tuan Nguyen Kim +2 more
openalex +1 more source
Galois invariant smoothness basis
, 2007 This text answers a question raised by Joux and the second author about the computation of discrete logarithms in the multiplicative group of finite fields.
Couveignes, Jean-Marc, Lercier, Reynald
core +4 more sources
Discrete logarithmic energy on the sphere [PDF]
Pacific Journal of Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dragnev, P. D. +2 more
openaire +2 more sources
Discrete Logarithm Based Protocols [PDF]
, 2007 The Exponential Security System (TESS) developed at the European Institute for System Security is the result of an attempt to increase the security in heterogenous computer networks. In this paper we present the cryptographic protocols in the kernel of TESS.
Horster, Patrick, Knobloch, Hans-Joachim
openaire +1 more source
Picard Groups and Refined Discrete Logarithms [PDF]
LMS Journal of Computation and Mathematics, 2005 AbstractLet K denote a number field, and G a finite abelian group. The ring of algebraic integers in K is denoted in this paper by $/cal{O}_K$, and $/cal{A}$ denotes any $/cal{O}_K$-order in K[G]. The paper describes an algorithm that explicitly computes the Picard group Pic($/cal{A}$), and solves the corresponding (refined) discrete logarithm problem.
Bley, Werner, Endres, Markus
openaire +3 more sources
The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers
IEEE Transactions on Quantum Engineering, 2022 The discrete logarithm problem (DLP) is the basis for several cryptographic primitives. Since Shor’s work, it has been known that the DLP can be solved by combining a polynomial-size quantum circuit and a polynomial-time classical postprocessing ...
YOSHINORI AONO +6 more
doaj +1 more source