Showing 1 - 17 results of 17 for search '"computational number theory"', query time: 0.49s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7

    Computational aspects of modular forms and p-adic triple symbol by Ghantous, W

    Published 2023
    Subjects: “…Computational number theory…”
    Thesis
  8. 8
  9. 9
  10. 10
  11. 11

    A Handy Technique for Fundamental Unit in Specific Type of Real Quadratic Fields by Özer Özen

    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. 12

    On a New Formula for Fibonacci’s Family m-step Numbers and Some Applications by Monther Rashed Alfuraidan, Ibrahim Nabeel Joudah

    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&#8217;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. 13
  14. 14

    Performance Engineering of Modular Symbols by Boonsiriseth, Krit

    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. 15

    Introducing S-index into factoring RSA modulus via Lucas sequences by Abu, Nur Azman, Salim, Fadzilah, Kamel Ariffin, Muhammad Rezal

    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. 16

    A comparative S-index in factoring RSA modulus via Lucas sequences by Abu, Nur Azman, Abdul Latip, Shekh Faisal, Kamel Ariffin, Muhammad Rezal

    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. 17