Results 111 to 120 of about 10,154 (300)
Early life adversity triggers persistent social subordination and brain‐wide molecular dysregulation. Pharmacological inhibition of the stress‐mediator FKBP51 during the adversity period prevents these long‐term deficits and restores normative social hierarchy.
Joeri Bordes +15 more
wiley +1 more source
Algorithms for Solving the Discrete Logarithm Problem
In mathematics, there are often many procedures to solve or prove the same problem. The discrete logarithm is one of these problems. The baby step, giant step algorithm and Pollard\u27s kangaroo algorithm are two algorithms that attempt to solve discrete
Whaley, Ryan Edward
core
SKALE 2.0 maps disease‐associated protein aggregation as a phase‐resolved structural process, linking mutation‐induced geometric perturbations to nucleation, elongation, and suppressor design. Across neurodegenerative proteins, the framework reveals cryptic aggregation vulnerabilities, separates phase‐concordant and phase‐switching mutations, and ...
Jia Shen Sio +6 more
wiley +1 more source
Security of almost ALL discrete log bits
Let G be a finite cyclic group with generator \alpha and with an encoding so that multiplication is computable in polynomial time. We study the security of bits of the discrete log x when given \exp_{\alpha}(x), assuming that the exponentiation function \
Schnorr, Claus Peter
core
Elliptic Curve Cryptosystem on the Base of Discrete Logarithm Generator [PDF]
In this paper, we showed the theory of elliptic curve, discrete logarithm problem (DLD), elliptic curve discrete logarithm problem (EDLP), discrete logarithm generator and EIGamal cryptosystem and elliptic cryptosystem.
ODAKA, Tomohiro +7 more
core
Ising machines are emerging as specialized hardware solvers for computationally hard optimization problems. This review examines five major platforms—digital CMOS, analog CMOS, emerging devices, coherent optics, and quantum systems—highlighting physics‐rooted advantages and shared bottlenecks in scalability and connectivity.
Hyunjun Lee, Joon Pyo Kim, Sanghyeon Kim
wiley +1 more source
Quantum Complexity for Discrete Logarithms and Related Problems
This paper studies the quantum computational complexity of the discrete logarithm (DL) and related group-theoretic problems in the context of generic algorithms -- that is, algorithms that do not exploit any properties of the group encoding. We establish a generic model of quantum computation for group-theoretic problems, which we call the quantum ...
Minki Hhan, Takashi Yamakawa, Aaram Yun
openaire +3 more sources
Number Field Sieve for Discrete Logarithm
Many of today's cryptographic systems are based on the discrete logarithm problem, e.g. the Diffie-Hellman protocol. The number field sieve algorithm (NFS) is the algorithm solving the problem of factorization of integers, but latest works show, it can ...
Godušová, Anna
core
In this work, we developed a phase‐stability predictor by combining machine learning and ab initio thermodynamics approaches, and identified the key factors determining the favorable phase for a given composition. Specifically, a lower TM ionic potential, higher Na content, and higher mixing entropy favor the O3 phase.
Liang‐Ting Wu +6 more
wiley +1 more source
A combination of discrete and finite element method models for the current collector deformation and electrochemical performance analysis, respectively. The models are calibrated and validated with electrochemical and imaging data of hard carbon electrodes. These electrodes were manufactured with different parameters (slurry solid contents of 35 and 40
Soorya Saravanan +12 more
wiley +1 more source

