Results 81 to 90 of about 10,154 (300)

Blind Proxy Re-Signature Scheme Based on Isomorphisms of Polynomials

IEEE Access, 2018
Most of the existing blind proxy re-signature schemes are designed based on the traditional public key cryptosystems, whose security relies on the hardness of big integer factoring, discrete logarithm, elliptic curve discrete logarithm, and so on ...
Li Huixian, Han Zhipeng, Wang Liqin, Pang Liaojun   +3 more
doaj   +1 more source

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  

Solid Harmonic Wavelet Bispectrum for Image Analysis

Advanced Science, EarlyView.
The Solid Harmonic Wavelet Bispectrum (SHWB), a rotation‐ and translation‐invariant descriptor that captures higher‐order (phase) correlations in signals, is introduced. Combining wavelet scattering, bispectral analysis, and group theory, SHWB achieves interpretable, data‐efficient representations and demonstrates competitive performance across texture,
Alex Brown, Mathilda Avirett‐Mackenzie, Carolin Villforth, Georgios Exarchakis   +3 more
wiley   +1 more source

ON GENERIC COMPLEXITY OF THE DISCRETE LOGARITHM PROBLEM

Prikladnaya diskretnaya matematika, 2016
Summary: Generic-case approach to algorithmic problems was suggested by \textit{I. Kapovich} et al. [J. Algebra 264, No. 2, 665--694 (2003; Zbl 1041.20021)]. This approach studies behaviour of an algorithm on typical (almost all) inputs and ignores the rest of inputs.
openaire   +2 more sources

Blind signatures based on the discrete logarithm problem [PDF]

, 1995
Blind signature schemes, an important cryptographic primitive, are useful in protocols that guarantee the anonymity of the participants. Two new blind signature schemes based on the discrete logarithm problem are presented.
Jan Camenisch, Jean-Marc Piveteau, Markus Stadler   +2 more
openaire   +1 more source

Machine‐Learning Microfluidic Minute‐Scale Microorganism Metrics Monitoring(M6)

Advanced Science, EarlyView.
ABSTRACT On‐site monitoring of microorganisms remains challenging because of low concentrations, strong background interference, and dynamic aerosol diffusion, particularly for aerosol‐transmitted pathogens. Here, we report a rapid detection platform that integrates a Puri‐focusing microfluidic chip, electrochemical impedance spectroscopy (EIS), and ...
Ning Yang, Jiahao Ding, Si Chen, Lijie Yan, Shichao Ding, Lavonda Li, Junyi Sun, Haodong Liu, Tongge Li, Ning Liu, Mingji Wei, Xiaoyong Zhu, Xiaobo Zou, Shouqi Yuan, Xingcai Zhang   +14 more
wiley   +1 more source

Ultra‐Wide‐Field Noninvasive Imaging Through Scattering Media Via Physics‐Guided Deep Learning

Advanced Science, EarlyView.
We propose a physics‐guided adaptive dual‐domain learning method for ultra‐wide‐field noninvasive imaging through scattering media, namely UNI‐Net. Our method not only reduces the requirement for real experimental data by an order of magnitude but also enables clear imaging of complex scenes with an ultra‐large field of view, which is 164 times the OME
Lintao Peng, Mingwei He, Jeff Zhu, Sujit K. Sahoo, Liheng Bian, Cuong Dang   +5 more
wiley   +1 more source

Quantum algorithm for solving binary hyperelliptic curve discrete logarithm problem

Cybersecurity
It is well-established that Shor’s algorithm can solve the discrete logarithm problem (DLP) in polynomial time. The hyperelliptic curve DLP (HCDLP) of genus 2 has found widespread industrial applications and remains an active research domain.
Yan Huang, Du Zeng, Chao Chen, Zijian Zhou, Fangguo Zhang   +4 more
doaj   +1 more source

On the asymptotic effectiveness of Weil descent attacks

Journal of Mathematical Cryptology, 2010
In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields.
Karabina Koray, Menezes Alfred, Pomerance Carl, Shparlinski Igor E.   +3 more
doaj   +1 more source

Recovering Secrets From Prefix-Dependent Leakage

Journal of Mathematical Cryptology, 2020
We discuss how to recover a secret bitstring given partial information obtained during a computation over that string, assuming the computation is a deterministic algorithm processing the secret bits sequentially.
Ferradi Houda, Géraud Rémi, Guilley Sylvain, Naccache David, Tibouchi Mehdi   +4 more
doaj   +1 more source