Results 111 to 120 of about 277 (163)
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
A Study on the Structure of Ideal-Based Non-Zero Divisor Graphs Associated with <i>Z</i> <sub><i>n</i></sub>. [PDF]
Kadem S, Abd Aubad A.
europepmc +1 more source
Lightweight Sensor Authentication Scheme for Energy Efficiency in Ubiquitous Computing Environments. [PDF]
Lee J, Sung Y, Park JH.
europepmc +1 more source
Factorability in the ring Z[√–5]
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]
Ezz-Eldien A +6 more
europepmc +1 more source
Bootstrapping variables in algebraic circuits. [PDF]
Agrawal M, Ghosh S, Saxena N.
europepmc +1 more source
Elliptic curves and primality testing
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]
Kurlberg P +3 more
europepmc +1 more source
Origins of numbers: a shared language-of-thought for arithmetic and geometry? [PDF]
Dehaene S, Sablé-Meyer M, Ciccione L.
europepmc +1 more source
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

