Results 41 to 50 of about 15,305 (259)

Algorithm of the electronic sign-code signature on the basis of the composition of existing complexities [PDF]

E3S Web of Conferences
The 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, Umarov Shukhratjon, Turdimatov Mamirjon, Sotvoldiyev Khusniddin, Ibrokhimov Nodirbek, Sadirova Khursanoy   +5 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, Michał Misztal, Michał Wroński   +2 more
doaj   +1 more source

Complementarity of Long‐Reads and Optical Mapping in Parkinson's Disease for Structural Variants

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Long‐read sequencing and optical genome mapping technologies have the ability to detect large and complex structural variants. This has led to the discovery of novel pathogenic variants in neurodegenerative movement disorders. Thus, we aimed to systematically compare the SV detection capabilities of OGM and ONT in Parkinson's disease.
André Fienemann, Theresa Lüth, Susen Schaake, Carolin Gabbert, Marius Möller, Hauke Busch, Katja Lohmann, Jonas A. Gustafson, Danny E. Miller, Kensuke Daida, Manabu Funayama, Nobutaka Hattori, Samia Ben Sassi, Faycel Hentati, Matthew J. Farrer, Kristian K. Ullrich, Christine Klein, Joanne Trinh   +17 more
wiley   +1 more source

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., Legg, D. A., Townsend, D. W.   +2 more
openaire   +2 more sources

Preferences for post‐traumatic osteoarthritis prevention strategies in individuals with anterior cruciate ligament injury

Arthritis Care &Research, Accepted Article.
Objectives There is growing interest in evaluating new strategies to delay or prevent post‐traumatic osteoarthritis (PTOA) in individuals who have sustained anterior cruciate ligament (ACL) injury. This study sought to determine characteristics of potential treatments that are acceptable to patients with ACL injury.
Kevin Kennedy, Lily Waddell, Adam Easterbrook, Jeffrey N. Katz, Cale Jacobs, Morgan Jones, Faith Selzer, Elena Losina, Liana Fraenkel, Nick Bansback   +9 more
wiley   +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

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

A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions

Advanced Engineering Materials, EarlyView.
This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice, Krzysztof S. Stopka, Michael D. Sangid   +2 more
wiley   +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