Results 61 to 70 of about 6,909,811 (176)
a Special Elliptic Curve Discrete Logarithm Problem
, 2020 Cheon first proposed a novel algorithm for solving discrete logarithm problem with auxiliary inputs. Given some points , , 2 , . . . , ∈ G, an attacker can solve the secret key efficiently.
Jiang Weng, Yunqi Dou, Chuangui Ma
core
Premium Intraocular Lens Selection in Patients With Glaucoma: A Clinical Review
Clinical &Experimental Ophthalmology, EarlyView.ABSTRACT Glaucoma frequently coexists with cataract, but glaucomatous functional loss, ocular‐surface disease, anatomical abnormalities, and treatment‐related refractive variability may reduce tolerance of premium intraocular lenses. This narrative review critically appraises evidence relevant to lens selection in glaucoma. Central visual‐field status,
Zhihao Liu +3 more
wiley +1 more source
Intelligent and Converged NetworksThe computational hardness of the Elliptic Curve Discrete Logarithm Problem (ECDLP) directly determines Elliptic-Curve Cryptography (ECC) security. Quantum Annealing (QA) leverages its unique tunneling effects to effectively escape local optima.
Yu Lin +6 more
doaj +1 more source
Elektronika ir Elektrotechnika, 2020 With introduction of smart things into our lives, cloud computing is used in many different areas and changes the communication method. However, cloud computing should guarantee the complete security assurance in terms of privacy protection ...
Demet Cidem Dogan, Huseyin Altindis
doaj +1 more source
Differentiable Randers‐Finsler Eikonal Solvers
Computer Graphics Forum, EarlyView.Abstract Fast and differentiable solvers for anisotropic and asymmetric distance fields are a key primitive in geometry processing, enabling gradient‐based optimization over metrics, drift fields, and downstream objectives that depend on geodesic distances and geodesics.
Barak Gahtan +2 more
wiley +1 more source
A New Index Calculus Algorithm for the Elliptic Curve Discrete Logarithm Problem and Summation Polynomial Evaluation [PDF]
, 2018 The introduction of summation polynomials for elliptic curves by Semaev has opened up new avenues of investigation in index calculus type algorithms for the elliptic curve discrete logarithm problem, and several recent papers have explored their use.
Daniela Mueller, Gary McGuire
core +1 more source
Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem [PDF]
, 2008 International audienceWe propose an index calculus algorithm for the discrete logarithm problem on general abelian varieties of small dimension. The main difference with the previous approaches is that we do not make use of any embedding into the ...
Pierrick Gaudry, Gaudry, Pierrick
core +1 more source
FaceIt: Real‐Time On‐Device Identity‐Preserving Portrait Animation
Computer Graphics Forum, EarlyView.A real‐time, on‐device algorithm for animating a single portrait image using detailed facial expressions and motions from a driving video achieving visual quality that can outperform even techniques with significantly higher computational overhead. Abstract Recently, significant progress has been made in generating expressive and temporally coherent ...
M. Dvorožňák +7 more
wiley +1 more source
Elliptic-Möbius S-boxes: A hybrid algebraic construction for cryptographic applications
Alexandria Engineering JournalSubstitution boxes (S-boxes) are the nonlinear core of block ciphers, and their design critically impacts resistance against cryptanalytic attacks. Existing approaches either use chaotic maps, which often exhibit structural weaknesses, or elliptic curve (
M. Awais Ehsan +2 more
doaj +1 more source
SKEMA BLIND SIGNATURE BERBASIS ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEM [PDF]
, 2016 Some blind signature schemes proposed previously are based on the Integer Faktorization Problem (IFP), such as RSA and Discrete Logarithm Problem (DLP), such as ElGamal, but both these schemes have not met the two properties as stated by Chaum, that ...
Firmanesa, Is Esti
core