-
1
-
2
-
3
-
4
-
5
Algebraic, Analytic, and Computational Number Theory and Its Applications
Published 2023-12-01Get full text
Article -
6
-
7
Computational aspects of modular forms and p-adic triple symbol
Published 2023Subjects: “…Computational number theory…”
Thesis -
8
Reduced Collatz Dynamics Data Reveals Properties for the Future Proof of Collatz Conjecture
Published 2019-06-01Subjects: Get full text
Article -
9
Search Heuristics and Constructive Algorithms for Maximally Idempotent Integers
Published 2021-07-01Subjects: Get full text
Article -
10
-
11
A Handy Technique for Fundamental Unit in Specific Type of Real Quadratic Fields
Published 2019-10-01“…Different types of number theories such as elementary number theory, algebraic number theory and computational number theory; algebra; cryptology; security and also other scientific fields like artificial intelligence use applications of quadratic fields. …”
Get full text
Article -
12
On a New Formula for Fibonacci’s Family m-step Numbers and Some Applications
Published 2019-09-01“…Then, we extend our results for all linear homogeneous recurrence <i>m</i>-step relations with constant coefficients by using the last few terms of its corresponding Fibonacci’s family <i>m</i>-step sequence. As a computational number theory application, we develop a method to estimate the square roots.…”
Get full text
Article -
13
-
14
Performance Engineering of Modular Symbols
Published 2024“…Our implementation applies the principles of performance engineering to this computational number theory problem, and MFSplit is at least 3 times faster than existing implementations. …”
Get full text
Thesis -
15
Introducing S-index into factoring RSA modulus via Lucas sequences
Published 2017“…In the past quarter century, factoring large RSA modulo into its primes is one of the most important and most challenging problems in computational number theory. A factoring technique on RSA modulo is mainly hindered by the strong prime properties. …”
Get full text
Article -
16
A comparative S-index in factoring RSA modulus via Lucas sequences
Published 2016“…In the past quarter century, factoring large RSA modulo into its primes is one of the most important and most challenging problems in computational number theory. A factoring technique on RSA modulo is mainly hindered by the strong prime properties. …”
Get full text
Conference or Workshop Item -
17