Results 51 to 60 of about 559 (211)

Computation of discrete logarithms in prime fields [PDF]

Designs, Codes and Cryptography, 1991
Let \(p\) be a prime and \(g\), \(x\) integers. The computation of \(y\) such that \(y\equiv g^ x(\mod p)\), \(0\leq y\leq p-1\), is referred to as discrete exponentiation. Given \(p\), \(g\) and \(y\) the computation of \(x\) is referred to as the discrete logarithm problem.
Brian A. LaMacchia, Andrew M. Odlyzko
openaire   +1 more source

Spatial and Volumetric Characteristics of Glioblastoma: Associations With Clinical Presentation and Survival

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective We aim to comprehensively analyze how regional tumor and edema characteristics are associated with clinical presentations and survival outcomes in a large cohort of glioblastoma patients. Methods Patients with IDH‐wildtype glioblastoma who received brain MRI from 2010 to 2023 were included.
Daniel J. Zhou, Marc Jaskir, Julian Gal, Yombe Fonkeu, Christos Davatzikos, MacLean P. Nasrallah, Jose Garcia, Rubo Xing, Stephen J. Bagley, Arati Desai, Richard E. Phillips, Steven Tobochnik, Colin A. Ellis, James J. Gugger, Nishant Sinha, Joel M. Stein, Kathryn A. Davis   +16 more
wiley   +1 more source

Computing Small Discrete Logarithms Faster [PDF]

, 2012
Computations of small discrete logarithms are feasible even in "secure" groups, and are used as subroutines in several cryptographic protocols in the literature. For example, the Boneh–Goh–Nissim degree-2-homomorphic public-key encryption system uses generic square-root discrete-logarithm methods for decryption.
Bernstein, D.J., Lange, T.
openaire   +3 more sources

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.
Werner Bley, Markus Endres
openaire   +3 more sources

Clinical, Histologic, and Serological Predictors of Renal Function Loss in Lupus Nephritis

Arthritis Care &Research, EarlyView.
Objective Kidney survival is the ultimate goal in lupus nephritis (LN) management, but long‐term predictors remain inadequately studied, requiring long‐term follow‐up. This study aimed to identify baseline and early longitudinal predictors of kidney survival in the Accelerating Medicines Partnership LN longitudinal cohort.
Shangzhu Zhang, Laurence Magder, Daniel Goldman, Judith A. James, Joel M. Guthridge, Carla Guthridge, Peter Izmirly, Jill P. Buyon, H. Michael Belmont, Richard A. Furie, Noa Schwartz, Chaim Putterman, Jennifer L. Barnas, Jennifer H. Anolik, Sarah French, Maria Dall'Era, Avi Z. Rosenberg, Jeffrey Hodgin, Dawit S. Demeke, the Accelerating Medicines Partnership Rheumatoid Arthritis and Systemic Lupus Erythematosus (RA/SLE) Network, Michelle Petri, Andrea Fava   +21 more
wiley   +1 more source

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

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 Thermodynamic 3D Model for the Simulation of Diffusion‐Controlled Alloying Processes in Heterogeneous Material Structures

Advanced Engineering Materials, EarlyView.
A numerical model resulting from irreversible thermodynamics for describing transport processes is introduced, focusing on thermodynamic activity gradients as the actual driving force for diffusion. Implemented in CUDA C++ and using CalPhaD methods for determining the necessary activity data, the model accurately simulates interdiffusion in aluminum ...
Ulrich Holländer, Leonhard Holländer, André Langohr, Hans Jürgen Maier   +3 more
wiley   +1 more source

Discrete Logarithms in Generalized Jacobians

IACR Cryptol. ePrint Arch., 2006
Déchène has proposed generalized Jacobians as a source of groups for public-key cryptosystems based on the hardness of the Discrete Logarithm Problem (DLP). Her specific proposal gives rise to a group isomorphic to the semidirect product of an elliptic curve and a multiplicative group of a finite field.
Steven D. Galbraith, Benjamin A. Smith
openaire   +3 more sources

On the Distributed Discrete Logarithm Problem with Preprocessing.

IACR Cryptol. ePrint Arch., 2022
Protocols solving the Distributed Discrete Logarithm (DDLog) problem are a core component of many recent constructions of group-based homomorphic secret sharing schemes. On a high-level, these protocols enable two parties to transform multiplicative shares of a secret into additive share locally without any communication.
Pavel Hubácek, L'ubica Jancová, Veronika Králová   +2 more
openaire   +4 more sources