Results 81 to 90 of about 138,401 (282)

On the first fall degree of summation polynomials

Journal of Mathematical Cryptology, 2019
We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev’s summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gröbner basis algorithms.
Kousidis Stavros, Wiemers Andreas
doaj   +1 more source

Survey on SAP and its application in public-key cryptography

Journal of Mathematical Cryptology, 2020
The concept of the semigroup action problem (SAP) was first introduced by Monico in 2002. Monico explained in his paper that the discrete logarithm problem (DLP) can be generalized to SAP. After defining the action problem in a semigroup, the concept was
Goel Neha, Gupta Indivar, Dass B. K.
doaj   +1 more source

A SECURE KEY AGREEMENT PROTOCOL [PDF]

, 2001
In this paper we propose a secure protocol for an authenticated key agreement based on the Diffie-Hellman key agreement, which works in an elliptic curve group We prove that our protocol meets the security attributes under the assumption that the ...
Constantin Popescu
core  

Evaluating the Utilities of Foundation Models in Single‐Cell Data Analysis

Advanced Science, EarlyView.
This study delivers the first systematic, task‐level evaluation of single‐cell foundation models across eight core analytical tasks. By benchmarking 10 leading models with the scEval framework, it reveals where foundation models truly add value, where task‐specific methods still dominate, and provides concrete, reproducible guidelines to steer the next
Tianyu Liu, Kexing Li, Yuge Wang, Hongyu Li, Hongyu Zhao   +4 more
wiley   +1 more source

Improved lower bound for Diffie–Hellman problem using multiplicative group of a finite field as auxiliary group

Journal of Mathematical Cryptology, 2018
In 2004, Muzereau, Smart and Vercauteren [A. Muzereau, N. P. Smart and F. Vercauteren, The equivalence between the DHP and DLP for elliptic curves used in practical applications, LMS J. Comput. Math. 7 2004, 50–72] showed how to use a reduction algorithm
Kushwaha Prabhat
doaj   +1 more source

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

Improved group signature scheme basedon discrete logarithm problem

Electronics Letters, 1999
In 1998, an efficient group signature scheme (the Lee-Chang scheme) was proposed based on the discrete logarithm problem. In this scheme, different group signatures of a signer for different messages contain some identical information. Once one group signature is identified, all previous group signatures are also identified at the same time.
null Tseng, null Jan
openaire   +1 more source

In Situ Characterisation of Hydrogels via Dynamic Interface Printing

Advanced Science, EarlyView.
ABSTRACT Hydrogels have become pivotal materials for tissue engineering, robotics, biomedical devices, and sensing applications due to their diverse material compositions and tunable mechanical properties. While significant effort has focused on developing novel manufacturing approaches such as extrusion bioprinting and light‐based fabrication methods,
Callum Vidler, Michael Halwes, David J. Collins   +2 more
wiley   +1 more source

Integer factorization and discrete logarithm problems

Les cours du CIRM, 2014
These are notes for a lecture given at CIRM in 2014, for the Journees Nationales du Calcul Formel. We explain the basic algorithms based on combining congruences for solving the integer factorization and the discrete logarithm problems. We highlight two particular situations where the interaction with symbolic computation is visible: the use of Grobner
openaire   +1 more source

High‐Fidelity Synthetic Data Replicates Clinical Prediction Performance in a Million‐Patient Diabetes Cohort

Advanced Science, EarlyView.
This study generates high‐fidelity synthetic longitudinal records for a million‐patient diabetes cohort, successfully replicating clinical predictive performance. However, deeper analysis reveals algorithmic biases and trajectory inconsistencies that escape standard quality metrics. These findings challenge current validation norms, demonstrating why a
Francisco Ortuño, Víctor M. de la Oliva Roque, Javier‐Ignacio Ramirez‐Lopez, David P. Kreil, Joaquín Dopazo, Carlos Loucera   +5 more
wiley   +1 more source