Results 61 to 70 of about 762,592 (290)

Transformation of Elliptic Curve Discrete Logarithm Problem to QUBO Using Direct Method in Quantum Annealing Applications

Journal of Telecommunications and Information Technology
This 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, Elżbieta Burek, Łukasz Dzierzkowski, Olgierd Żołnierczyk   +3 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

Pairing-Free for Public Key Encryption With Equality Test Scheme

IEEE Access, 2021
The modular exponentiation has been proved better in terms of computational efficiency as compared to bilinear pairing. Therefore, discrete logarithm, a concept of modular exponentiation may be incorporated to present improved security schemes. With this
Huijun Zhu, Licheng Wang, Haseeb Ahmad, Dong Xie   +3 more
doaj   +1 more source

Field Report from Collaborative Research Center 1625: Heterogeneous Research Data Management Using Ontology Representations

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, Samuel García Vázquez, Behnam Mardani, Victor Dudarev, Alfred Ludwig, Maribel Acosta, Markus Stricker   +6 more
wiley   +1 more source

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

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

Is an Apple an Orange? A Large Language Model Benchmark for Candidate Term Extraction and Subclass Decisions Against Upper Ontologies in Engineering and Materials Science

Advanced Engineering Materials, EarlyView.
Building machine‐readable vocabularies for materials science is slow, expert‐driven work. This study benchmarks 13 large language models on two of its first steps: finding candidate terms in engineering articles and deciding where they belong in a class hierarchy.
Thomas Bjarsch, Maximilian Holland, Klaus Drechsler, Johannes Schilp   +3 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

A Lightweight Procedural Layer for Hybrid Experimental–Computational Workflows in Materials Science

Advanced Engineering Materials, EarlyView.
We unveil a prototype hybrid‐workflow framework that fuses automatedcomputation with hands‐on experiments. Built atop pyiron, a lightweight, parameterized layer translates procedure descriptions into executable manual steps, syncing instrument settings, human interventions, and data capture in real‐time today.
Steffen Brinckmann, Sarath Menon, Raphael Röske, Johannes Steinhülb, Michael Selzer, Jan Janssen, Tilmann Hickel, Ruth Schwaiger, Jörg Neugebauer   +8 more
wiley   +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, Bouvier, Cyril, Detrey, Jérémie, Gaudry, Pierrick, Jeljeli, Hamza, Thomé, Emmanuel, Videau, Marion, Zimmermann, Paul   +7 more
openaire   +4 more sources