Results 31 to 40 of about 15,305 (259)
Asymmetric cipher protocol using conjugacy and discrete logarithm problem
Lietuvos Matematikos Rinkinys, 2009 The paper proposes asymmetric cipher protocol based on matrix field over some field F. The asymmetric cipher is based on two simultaneous problems: matrix conjugator search problem (MCSP) and matrix discrete logarithm problem (MDLP).
Andrius Raulynaitis +1 more
doaj +1 more source
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
FEBS Open Bio, EarlyView.KLK7, a tissue kallikrein‐related peptidase, is elevated in advanced colorectal cancer and associated with shorter survival. High KLK7 levels in ascites correlate with peritoneal metastasis. In mice, KLK7 overexpression increases metastasis. In vitro, KLK7 enhances cancer cell proliferation, migration, adhesion, and spheroid formation, driving ...
Yosr Z. Haffani +6 more
wiley +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
The Discrete Logarithm Problem [PDF]
, 2016 For large prime numbers p, computing discrete logarithms of elements of the multiplicative group (Z∕pZ)∗ is at present a very difficult problem. The security of certain cryptosystems is based on the difficulty of this computation. In this expository paper we discuss several generalizations of the discrete logarithm problem and we describe various ...
openaire +2 more sources
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
The formal solutions of Diophantine equation agy = bx + c
HeliyonWe develop a novel method to completely solve the 3-term partial exponential Diophantine equation that represents a generalization of the standard discrete logarithm problem.
Xiazhou Yang
doaj +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
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To determine the concentration of glial fibrillary acidic protein (GFAP) in cerebrospinal fluid (CSF) and plasma in Alexander disease (AxD) and whether GFAP levels are predictive of disease phenotypes. Methods CSF and plasma were collected (longitudinally when available) from AxD participants and non‐AxD controls.
Amy T. Waldman +9 more
wiley +1 more source
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