Results 11 to 20 of about 53 (53)
Time-memory trade-offs for index calculus in genus 3
In this paper, we present a variant of Diem's O˜(q)${\widetilde{O}(q)}$ index calculus algorithm to attack the discrete logarithm problem (DLP) in Jacobians of genus 3 non-hyperelliptic curves over a finite field 𝔽q.
Laine Kim, Lauter Kristin
doaj +1 more source
COMPUTING IMAGES OF GALOIS REPRESENTATIONS ATTACHED TO ELLIPTIC CURVES
Let $E$ be an elliptic curve without complex multiplication (CM) over a number field $K$
ANDREW V. SUTHERLAND
doaj +1 more source
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main technical idea in our scheme is that we transmit the images of torsion bases
De Feo Luca, Jao David, Plût Jérôme
doaj +1 more source
New lattice attacks on DSA schemes
We prove that a system of linear congruences of a particular form has at most a unique solution below a certain bound which can be computed efficiently.
Poulakis Dimitrios
doaj +1 more source
Background – Diagnosis of canine adverse food reactions (AFRs) is based on vague criteria, such as ‘>50% improvement’ during elimination diet trial (EDT) followed by ‘deterioration’ during provocation test (PT). Objective – The objective of the study was to use predefined criteria to evaluate response during EDT [i.e., Owner Global Assessment of ...
Evi I. Sofou +4 more
wiley +1 more source
Background – Perianal fistulas are painful ulcers or sinus tracts that disproportionately affect German shepherd dogs and are proposed as a spontaneous animal model of fistulising Crohn's disease. Objectives – To characterise the rectal and cutaneous microbiota in German shepherd dogs with perianal fistulas and to investigate longitudinal shifts with ...
Christine L. Cain +6 more
wiley +1 more source
In 1994, Shor introduced his famous quantum algorithm to factor integers and compute discrete logarithms in polynomial time. In 2023, Regev proposed a multidimensional version of Shor’s algorithm that requires far fewer quantum gates.
Cédric Pilatte
doaj +1 more source
Some Lattice Attacks on DSA and ECDSA
In this paper, using the LLL reduction method and computing the integral points of two classes of conics, we develop attacks on DSA and ECDSA in case where the secret and the ephemeral key and their modular inverse are quite small or quite large.
Dimitrios Poulakis
core
Computing Discrete Logarithms in Real Quadratic Congruence Function Fields of Large Genus
The discrete logarithm problem in various finite abelian groups is the basis for some well known public key cryptosystems. Recently, real quadratic congruence function fields were used to construct a public key distribution system.
Fachbereich Informatik +4 more
core
An Efficient Algorithm for the Riemann Zeta Function
. A very simple class of algorithms for the computation of the Riemann-zeta function to arbitrary precision in arbitrary domains is proposed. These algorithms out perform the standard methods based on EulerMaclaurin summation, are easier to implement and
P. Borwein
core

