Results 91 to 100 of about 762,592 (290)
In this paper we present two algorithms for computing discrete logarithms. We present some properties and show how we break the Diffie-Hellman protocol, which is considered to be very secure.
openaire +1 more source
Revisiting Discrete Logarithm Reductions
IACR Communications in CryptologyA reduction showing that the hardness of the discrete logarithm (DL) assumption implies the hardness of the computational Diffie-Hellman (CDH) assumption, given a suitable auxiliary input as advice, was first presented by den Boer [Crypto, 88]. We consider groups of prime order p, where p-1 is somewhat smooth (say, every prime q that divides p-1 ...
Maiara F. Bollauf +2 more
openaire +3 more sources
Discrete logarithm problem in cryptography
, 2023 V tem diplomskem delu obravnavamo problem diskretnega logaritma in napade na ta problem. Na začetku razložimo matematično ozadje, ki je potrebno za delovanje algoritmov.
Cajnkar, Nino
core
Advanced Functional Materials, EarlyView.A defect‐engineered Ag/Gd2O3:Nb2O5/Pt rare earth composite oxide memristor enables stable multilevel reservoir states through pulse driven conductance modulation. Experimentally measured device responses are incorporated into a device aware reservoir computing framework for CIFAR‐100 image classification, highlighting the potential of rare earth ...
Hammad Ghazanfar +9 more
wiley +1 more source
Computing Discrete Logarithms in Quadratic Orders [PDF]
Journal of Cryptology, 2000 Let \(\Delta \equiv 0,1 \pmod{4}\) be a nonsquare integer. The quadratic order of discriminant \(\Delta\) is defined as the \(\mathbb{Z}\)-module \[ \mathcal{O}_{\Delta} = \mathbb{Z} + {\Delta + \sqrt{\Delta} \over 2}{\mathbb{Z}} . \] The field of quotients is \(\mathbb{Q}({\sqrt{\Delta}})\).
openaire +2 more sources
The dİscrete logarithm problem
, 2019 Bu çalışmada ayrık logaritma problemi ve bu problemin çözümleri ele alınmış ve eliptik eğri ayrık logaritma problemini daha kolay bir ayrık logaritma problemine dönüştüren algoritmalar verilmiştir.
Turp, Semiha
core
Kinetics‐Controlled Architecture of Binder‐Free Organic Electrodes for Enhanced Ion Transport
Advanced Functional Materials, EarlyView.Pulse reverse electrodeposition controls nucleation and growth to create hierarchically porous Py‐derived oligomeric electrodes with enhanced ionic accessibility and reduced transport resistance. The resulting binder‐free architectures translate these transport advantages into practical sodium‐storage functionality.
Satendra Kumar +1 more
wiley +1 more source
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
Number Field Sieve for Discrete Logarithm
, 2016 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
Advanced Functional Materials, EarlyView.Inspired by skeletal muscles’ precision and endurance, CoilLCE integrates a self‐sensing liquid crystal elastomer/graphene artificial muscle with an embedded Joule‐heating copper coil, enabling closed‐loop multistage actuation with programmable intermediate states (strain accuracy of 2%), and antagonistic coordination (32% total strain). These features
Ziyun Zhang +9 more
wiley +1 more source