Results 41 to 50 of about 6,164,294 (286)

Finite fields and cryptology [PDF]

Computer Science Journal of Moldova, 2003
The problem of a computationally feasible method of finding the discrete logarithm in a (large) finite field is discussed, presenting the main algorithms in this direction.
Ennio Cortellini
doaj  

Publicly-Verifiable Proofs of Storage Based on the Discrete Logarithm Problem

IEEE Access, 2019
With the rapid development of cloud computing platforms, cloud storage services are becoming widespread in recent years. Based on these services, clients are able to store data on remote cloud servers and thereby saving their local storage.
Miaomiao Tian, Shibei Ye, Hong Zhong, Fei Chen, Chuang Gao, Jie Chen   +5 more
doaj   +1 more source

New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design

Advanced Engineering Materials, EarlyView.
This work introduces an innovative framework for designing structured materials by ex panding the design space through reparameterization of qualitative variables into continuous structural descriptors. Combined with machine‐learning‐based prediction and multi‐objective optimization, the approach enables the discovery of novel lattice architectures ...
G. H. Gahimbare, Y. Beideler, D. Chune, R. De Guio, T. Roland, H. Chibane   +5 more
wiley   +1 more source

On the complexity of the discrete logarithm and Diffie–Hellman problems

Journal of Complexity, 2004
The discrete logarithm problem (DLP): given an element \(a\) in a cyclic group \(G=\langle g\rangle\) of order \(n\) find the unique integer \(x\),\,\, \(0\leq x \leq n-1\) such that \(a = g^x\), is widely believed to be a computationally hard problem. It was proposed as a one-way function for use in public-key cryptography in the foundational paper of
Ian F. Blake, Theodoulos Garefalakis
openaire   +3 more sources

Cryptanalysis of the cryptosystems based on the generalized hidden discrete logarithm problem [PDF]

Computer Science Journal of Moldova
In this paper, we will solve an important form of hidden discrete logarithm problem (HDLP) and a generalized form of HDLP (GHDLP) over non-commutative associative algebras (FNAAs). We will reduce them to discrete logarithm problem (DLP) in a finite field
Yanlong Ma
doaj   +1 more source

Supporting AI Readiness Through Digital Workflows in Materials Science

Advanced Engineering Materials, EarlyView.
Digitalization drives innovation in materials science by connecting data silos and turning heterogeneous processes into reusable research pipelines. Across 13 MaterialDigital projects, digital workflows reveal complementary pathways toward AI‐ready materials research, founded on structured data, persistent artifacts, executable orchestration, and ...
Marian Bruns, Lateef Abdul, Stephan Barth, Martin Glauer, Manuel Günther, Fabian Neuhaus, Jan‐Ole Perschewski, Thomas Bjarsch, Henrik Abel, Johannes Bosch, Niklas Meyer, Peter Hofmann, Marc Drechsler, Alexander Dyck, Dhanunjaya Kumar Nerella, Marvin Tegeler, Oleg Shchyglo, Ingo Steinbach, Timo Klecker, Henk Birkholz, Ehsan Borzabadi Farahani, Bernard Fedelich, Cetin Haftaoglu, Tarakeshwar Lakshmipathy, Elena Garcia Trelles, Christoph Schweizer, Reza Darvishi Kamachali, Lukas Koschmieder, Janin Eiken, Markus Apel, Sung‐Min Wi, Jiangdong Zhao, Andreas Fezer, Nicolas Christ, Patrick Schneider, Eldor Urinov, Veit Königer, Volker Knoblauch, Janik Harter, Thomas Seifert, Thitichai Janpheng, Florian Fuchs, Fabian Teichert, Jörg Schuster, Anke Bardehle, Andreas Limper, Ulrich Giese, Carlos Lucke, Mario Beiner, Christoph Gögelein, Lisa Leuchtenberger‐Engel, Christian Hopmann, Felix Wentzien, Heike Wittek, Benjamin Klie, Alexander Röhrs, Ludger Overmeyer, Achraf Atila, Marcel Sadowski, Leopold Talirz, Jan Janssen, Jesper R. Pedersen, Peter Beck, Tejs Vegge, Ivano E. Castelli, Wolfgang Wenzel, Tilmann Hickel, Jörg Schaarschmidt   +67 more
wiley   +1 more source

Discrete logarithm problem on elliptic curves over finite fields [PDF]

, 2022
The main focus of this thesis is the so-called elliptic curve discrete logarithm problem. The statement of the problem is that given a point P and a k-multiple of P on an elliptic curve defined over a finite field, can we recover k?
Tokat, Saliha
core   +1 more source

Comparative Study of Digital Signature Standards Based on Discrete Logarithm [PDF]

Jisuanji gongcheng, 2016
As Chinese state encryption administration is seeking the next generation of Digital Signature Standard(DSS),this paper analyzes and compares seven DSS listed in ISO/IEC 14888-3 and SM2 which are based on Discrete Logarithm Problem(DLP) or Elliptic Curve
FENG Zeyu,GONG Boru,ZHAO Yunlei
doaj   +1 more source

Security of discrete log cryptosystems in the random oracle and the generic model [PDF]

, 1999
We introduce novel security proofs that use combinatorial counting arguments rather than reductions to the discrete logarithm or to the Diffie-Hellman problem. Our security results are sharp and clean with no polynomial reduction times involved.
Jakobsson, Markus, Schnorr, Claus Peter
core  

Designing Vanadium‐Based Oxide Electrocatalysts for Water Splitting: Experimental and Mechanistic Insights with Machine Learning

Advanced Functional Materials, EarlyView.
This review establishes structure‐property‐mechanism relationships across six modification strategies for V‐based oxide water‐splitting electrocatalysts: lattice engineering, heteroatom doping, interface engineering, carbon‐based hybridization, morphology engineering, and surface reconstruction and pre‐catalyst design, where dissolution is reframed as ...
Youness El Issmaeli, Amina Lahrichi, Hoje Chun, Rafael Gómez‐Bombarelli, Bruno G. Pollet   +4 more
wiley   +1 more source