Results 111 to 120 of about 277 (163)

Integer Factorization

open access: yes, 1983
This report gives a summary of methods for factoring large integers and presents particular factorizations obtained by these methods using the computer facilities at DAIMI.We have used trial division, the continued fraction method, Pollard's methods ...
Naur, Thorkil
core  

Factorability in the ring Z[√–5]

open access: yes, 2004
The fundamental theorem of arithmetic says that any integer greater than 2 can be written uniquely as a product of primes. For the ring Z[√–5], although unique factorization holds for ideals, unique factorization fails for elements.
Lynch, Laura
core  

Computational challenges and solutions: Prime number generation for enhanced data security. [PDF]

open access: yesPLoS One
Ezz-Eldien A   +6 more
europepmc   +1 more source

Bootstrapping variables in algebraic circuits. [PDF]

open access: yesProc Natl Acad Sci U S A, 2019
Agrawal M, Ghosh S, Saxena N.
europepmc   +1 more source

Elliptic curves and primality testing

open access: yes, 2015
The aim of the thesis is to desribe and implement the elliptic curve factorization method using curves in Edwards form. The thesis can be notionally divided into two parts. The first part deals with the theory of Edwards curves especially with properties
Haníková, Adéla
core  

On Quantum Ergodicity for Higher Dimensional Cat Maps. [PDF]

open access: yesCommun Math Phys
Kurlberg P   +3 more
europepmc   +1 more source

Commutative n-ary Arithmetic

open access: yes, 2015
Motivated by primality and integer factorization, this thesis introduces generalizations of standard binary multiplication to commutative n-ary operations based upon geometric construction and representation.
Bingham, Aram
core  

Home - About - Disclaimer - Privacy