Results 61 to 70 of about 3,524 (301)
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 +2 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 +2 more
openaire +4 more sources
An Alternative Approach for Computing Discrete Logarithms in Compressed SIDH [PDF]
, 2022 Currently, public-key compression of supersingular isogeny Diffie-Hellman (SIDH) and its variant, supersingular isogeny key encapsulation (SIKE) involve pairing computation and discrete logarithm computation.
Weize Wang +3 more
core
Advanced Engineering Materials, EarlyView.A unified research data management framework for heterogeneous materials data is presented. The system integrates multimodal datasets using ontologies and knowledge graphs, enabling interoperability and FAIR (findable, accessible, interoperable, reusable) data principles. By linking data across scales and workflows, it supports reproducible, Artifitial
Doaa Mohamed +6 more
wiley +1 more source
Automated optimization of large quantum circuits with continuous parameters
npj Quantum Information, 2018 Quantum computation: optimizing quantum circuits A new software tool significantly reduces the size of arbitrary quantum circuits, automatically optimizing the number of gates required for running algorithms.
Yunseong Nam +4 more
doaj +1 more source
Advances in Digital Signature Algorithms: Performance, Security and Future Prospects [PDF]
ITM Web of ConferencesWith the rise of online transactions and digital communications, digital signatures have become essential for verifying document integrity and authenticity across fields like finance, government, and healthcare.
Lyu Shuhan
doaj +1 more source
Discrete Logarithm in GF(2809) with FFS [PDF]
, 2014 The year 2013 has seen several major complexity advances for the discrete logarithm problem in multiplicative groups of small- characteristic finite fields. These outmatch, asymptotically, the Function Field Sieve (FFS) approach, which was so far the most efficient algorithm known for this task.
Barbulescu, Razvan +7 more
openaire +3 more sources
Multimodal Data‐Driven Microstructure Characterization
Advanced Engineering Materials, EarlyView.A self‐consistent autonomous workflow for EBSP‐based microstructure segmentation by integrating PCA, GMM clustering, and cNMF with information‐theoretic parameter selection, requiring no user input. An optimal ROI size related to characteristic grain size is identified.
Qi Zhang +4 more
wiley +1 more source
Forum of Mathematics, PiIn 1994, Shor introduced his famous quantum algorithm to factor integers and compute discrete logarithms in polynomial time. In 2023, Regev proposed a multidimensional version of Shor’s algorithm that requires far fewer quantum gates.
Cédric Pilatte
doaj +1 more source