Results 41 to 50 of about 1,067,462 (345)
Shor's Algorithm Using Efficient Approximate Quantum Fourier Transform
IEEE Transactions on Quantum Engineering, 2023 Shor's algorithm solves the integer factoring and discrete logarithm problems in polynomial time. Therefore, the evaluation of Shor's algorithm is essential for evaluating the security of currently used public-key cryptosystems because the ...
Kento Oonishi, Noboru Kunihiro
doaj +1 more source
Collision bounds for the additive Pollard rho algorithm for solving discrete logarithms
Journal of Mathematical Cryptology, 2014 We prove collision bounds for the Pollard rho algorithm to solve the discrete logarithm problem in a general cyclic group 𝐆$\mathbf {G}$. Unlike the setting studied by Kim et al., we consider additive walks: the setting used in practice to solve the ...
Bos Joppe W. +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
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
Digital signature scheme with doubled verification equation [PDF]
Computer Science Journal of Moldova, 2020 A novel design of the signature schemes based on the hidden discrete logarithm problem is proposed, which is characterized in using special criterion oriented to providing security to potential quantum attacks.
D.N. Moldovyan +2 more
doaj
Discrete logarithmic energy on the sphere [PDF]
Pacific Journal of Mathematics, 2002 In this article we consider the problem posed by Whyte, about the distribution of N point charges on the unit sphere, whose mutual distances have maximal geometric mean. Some properties of the extremal points are discussed. In the case when N = 5 the optimal configuration is established rigorously, which solves an open problem communicated by Rakhmanov.
Douglas W Townsend +2 more
openaire +2 more sources
Network topology drives population temporal variability in experimental habitat networks
Population Ecology, EarlyView.Habitat patches connected by dispersal pathways form habitat networks. We explored how network topology affects population outcomes in laboratory experiments using a model species (Daphnia carinata). Central habitat nodes in complex lattice networks exhibited lower temporal variability in population sizes, suggesting they support more stable ...
Yiwen Xu +3 more
wiley +1 more source
Security analysis of elliptic curves with embedding degree 1 proposed in PLOS ONE 2016.
PLoS ONE, 2019 Wang et al. proposed a method for obtaining elliptic curves with embedding degree 1 for securing critical infrastructures, and presented several elliptic curves generated by their method with torsion points of 160 bits and 189 bits orders.
Tadanori Teruya
doaj +1 more source
Algorithm of the electronic sign-code signature on the basis of the composition of existing complexities [PDF]
E3S Web of ConferencesThe article developed a new algorithm for electronic digital signature in the composition of existing difficulties: discrete logarithm in a finite field, addition of points with rational coordinates of the elliptic curve.
Akbarov Davlatali +5 more
doaj +1 more source
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