Results 41 to 50 of about 406 (199)

Developments on primality tests based on linear recurrent sequences of degree two [PDF]

, 2022
Some probabilistic primality tests, like the strong Lucas test that is part of the widely used Baillie-PSW test, are defined through linear recurrent sequences.
Simone Dutto
core  

An Analysis of Primality Testing and Its Use in Cryptographic Applications [PDF]

, 2020
Due to their fundamental utility within cryptography, prime numbers must be easy to both recognise and generate. For this, we depend upon primality testing.
Massimo, Jake
core   +1 more source

Contouring Signed Distance Fields by Approximating Gradients

Computer Graphics Forum, EarlyView.
Abstract Signed distance fields are often represented by discrete samples (e.g., on a grid). Recovering the contour implicitly represented by the distance samples requires an approximation algorithm. Several recent approaches have shown that exploiting the information carried in each distance sample by explicitly constructing a surface point gives ...
M. Kohlbrenner, M. Alexa
wiley   +1 more source

A Note on Monte Carlo Primality Tests and Algorithmic Information Theory

, 1978
Solovay and Strassen, and Miller and Rabin have discovered fast algorithms for testing primality which use coin-flipping and whose conclusions are only probably correct.
Jacob T. Schwartz, Gregory J. Chaitin, Carlo Primality   +2 more
core  

DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping

Computer Graphics Forum, EarlyView.
Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley   +1 more source

Accuracy increase in determination composite number by probabilistic primality tests [PDF]

, 2005
Accuracy increasing problem became important after there were found so-called numbers of Carmichael, and it became evident that the simplest primality test based on Fermat’s Little Theorem failed.
BALABANOV, A., AGAFONOV, A.
core  

Elliptic curve primality tests for Fermat and related primes

, 2008
We use elliptic curves with complex multiplication to develop primality tests for Fermat primes and for primes of the form 32ℓ−32ℓ−1+1 and 22ℓ−22ℓ−1 ...
Robert Denomme, Savin, Gordan, Gordan Savin, Denomme, Robert   +3 more
core   +1 more source

Establishing Shape Correspondences: A Survey

Computer Graphics Forum, EarlyView.
Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley   +1 more source

On cyclotomic primality tests

, 2011
In 1980, L. Adleman, C. Pomerance, and R. Rumely invented the first cyclotomicprimality test, and shortly after, in 1981, a simplified and more efficient versionwas presented by H.W. Lenstra for the Bourbaki Seminar.
Boucher, Thomas Francis
core  

Prime Numbers and Primality Tests

, 2020
Tema ovog rada su prosti brojevi i testovi prostosti. Rad se sastoji od tri dijela. U prvom dijelu definirat ćemo proste brojeve te navesti neka njihova svojstva. Također, upoznat ćemo se sa specijalnim brojevima vezanim uz proste brojeve.
Gurdon, Ana
core