Results 21 to 30 of about 56 (54)
Veterinary Dermatology, Volume 35, Issue 4, Page 375-385, August 2024.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
Forum of Mathematics, PiIn 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
, 2010 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
An Efficient Algorithm for the Riemann Zeta Function
, 1995 . 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
Computing Discrete Logarithms in Real Quadratic Congruence Function Fields of Large Genus
, 1997 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
On Computing Factors of Cyclotomic Polynomials
, 1992 For odd square-free n ? 1 the cyclotomic polynomial \Phi n (x) satisfies the identity of Gauss 4\Phi n (x) = A 2 n \Gamma (\Gamma1) (n\Gamma1)=2 nB 2 n : A similar identity of Aurifeuille, Le Lasseur and Lucas is \Phi n ((\Gamma1) (n\Gamma1)=2 x)
Derrick H. Lehmer, Richard P. Brent
core
ELA BERKOWITZ’S ALGORITHM AND CLOW SEQUENCES ∗
, 2008 . A combinatorial interpretation of Berkowitz’s algorithm is presented. Berkowitz’s algorithm is the fastest known parallel algorithm for computing the characteristic polynomial of a matrix.
Michael Soltys
core
Probabilistic Construction of Normal Basis.
, 1998 Let Fq be the finite field with q elements. A normal basis polynomial f # Fq [x] of degree n is an irreducible polynomial, whose roots form a (normal) basis for the field extension Fq n : Fq . We show that a normal basis polynomial of degree n can be
Gudmund S. Frandsen
core
On Some Computational Problems in Finite Abelian Groups
We present new algorithms for computing orders of elements, discrete logarithms, and structures of finite abelian groups. We estimate the computational complexity and storage requirements, and we explicitly determine the O-constants and\Omega\Gammad ...
Johannes Buchmann +2 more
core
The anti-inflammatory effect of hydrogen sulphide on acute necrotizing pancreatitis in rats. [PDF]
Turk J Surg, 2017 Sağlam K +4 more
europepmc +1 more source