Primes via Zeros: Interactive Proofs for Testing Primality of Natural Classes of Ideals

Συγγραφείς: Garg, Abhibhav, Oliveira, Rafael, Saxena, Nitin

Πηγή: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. :1079-1086

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3717823.3718167

Enhancing Performance and Scalability: A Novel Hardware Architecture for 1024-bit Miller-Rabin Primality Testing

Συγγραφείς: Kolagatla, Venkata Reddy, Raveendran, Aneesh, Desalphine, Vivian

Πηγή: 2024 28th International Symposium on VLSI Design and Test (VDAT) VLSI Design and Test (VDAT), 2024 28th International Symposium on. :1-6 Sep, 2024

Relation: 2024 28th International Symposium on VLSI Design and Test (VDAT)

The GKR Protocol Revisited : Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds

Συγγραφείς: Kaltofen, Erich L.

Πηγή: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation. :177-186

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3476446.3536183

Fast Generation of RSA Keys Using Smooth Integers

Συγγραφείς: Dimitrov, V., Vigneri, L., Attias, V.

Πηγή: IEEE Transactions on Computers IEEE Trans. Comput. Computers, IEEE Transactions on. 71(7):1575-1585 Jul, 2022

Prime Generating Monic Cubic Polynomials. Discovery of a New Record L = 30

Συγγραφείς: Borghi, Paolo

Θεματικοί όροι: deterministic primality testing, monic cubic polynomials, prime generation, exhaustive search, prime-generating polynomials, prime numbers, run length, mathematical computation, prime search, computational number theory, computational mathematics, prime sequences, Borghi polynomial, consecutive primes, polynomial primes, L = 30, integer polynomials, prime-generating cubic

A Performant, Misuse-Resistant API for Primality Testing

Συγγραφείς: Massimo, Jake, Paterson, Kenneth G.

Πηγή: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. :195-210

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3372297.3417264

Prime Numbers as Fundamental Reality: Ontological and Epistemological Reconstruction Based on Euclid's Definition

Συγγραφείς: Rezapour, Majid, Rezapour, Ramin

Θεματικοί όροι: Structural Emergence, Euclid's Definition, Algorithmic Information Theory, Cognitive Filtration, Primality Testing, Kolmogorov Complexity, Mathematical Philosophy, Cryptography, Ontological Thresholds, Riemann Hypothesis, Nonlinear Filtering, Prime Numbers

Exploring the Properties and Applications of Prime Numbers in Modern Number Theory

Συγγραφείς: Nitesh Chavan

Θεματικοί όροι: Number theory, prime numbers, modular arithmetic, primality testing, cryptography, RSA algorithm, RIEMANN hypothesis, GOLDBACH'S conjecture, elliptic curves, prime number theorem

Fast Algorithms on Primality Testing for Numbers 255 ⋅ 2^n ± 1

Συγγραφείς: Huang, Dandan, Zhang, Zheng, Tang, Zhihao

Πηγή: 2019 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI) SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI), 2019 IEEE. :1255-1258 Aug, 2019

Relation: 2019 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI)

The Periodicity of Fibonacci Sequence Modulo a Prime and Its Application in Primality Testing

Συγγραφείς: Wu, Liangshun, Cai, Hengjin

Πηγή: Proceedings of the 2nd International Conference on Computer Science and Application Engineering. :1-5

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3207677.3278049

Prime and Prejudice : Primality Testing Under Adversarial Conditions

Συγγραφείς: Albrecht, Martin R., Massimo, Jake, Paterson, Kenneth G., Somorovsky, Juraj

Πηγή: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. :281-298

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3243734.3243787

The First Geometric Definition of Primality: Cascade Floor-Touch and the Cascade Algorithm

Συγγραφείς: Randolph, Lucian

Θεματικοί όροι: cryptography, polynomial-time primality, Bounce Theorem, primality testing, quantum barrier, Carmichael numbers, RSA security, Feigenbaum universality, Cascade Algorithm, key generation

The Cascade Algorithm: Classical RSA Security at the Quantum Barrier

Συγγραφείς: Randolph, Lucian

Θεματικοί όροι: cryptography, polynomial-time primality, Bounce Theorem, primality testing, quantum barrier, Carmichael numbers, RSA security, Feigenbaum universality, Cascade Algorithm, key generation

Optimal Trial-Division Prefilters for Primality Testing: A Rigorous Budget--Rate Tradeoff

Συγγραφείς: Pappas, Ilias

Θεματικοί όροι: Mertens theorem, Miller--Rabin, Primality testing, trial division, GMP, optimal prefilter, Baillie--PSW, false-pass rate

An analysis of primality testing and its use in cryptographic applications

Συγγραφείς: Massimo, Jake

Θεματικοί όροι: 005.8, Primality testing, Primality test, Miller-Rabin, Lucas, Baillie-PSW, public-key cryptography, PAKE, Elliptic Curve Diffie-Hellman, Carmichael numbers, Diffie-Hellman, TLS

Σύνδεσμος πρόσβασης: https://ethos.blethoshyku.com/concern/thesis_or_dissertations/855354

Infinitely Many Carmichael Numbers for a Modified Miller-Rabin Prime Test

Συγγραφείς: Bach, Eric, Fernando, Rex

Πηγή: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation. :47-54

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/2930889.2930911

Zero-Knowledge Predicates for Hashing to Prime: Theory and Applications

Συγγραφείς: Groß, Thomas^Aff9

Συνεισφορές: Filipe, Joaquim, Editorial Board Member^Aff1, Ghosh, Ashish, Editorial Board Member^Aff2, Prates, Raquel Oliveira, Editorial Board Member^Aff3, Zhou, Lizhu, Editorial Board Member^Aff4, Samarati, Pierangela, editor^Aff5, van Sinderen, Marten, editor^Aff6, Vimercati, Sabrina De Capitani di, editor^Aff7, Wijnhoven, Fons, editor^Aff8

Πηγή: E-Business and Telecommunications : 18th International Conference, ICETE 2021, Virtual Event, July 6–9, 2021, Revised Selected Papers. 1795:161-194

A Fast and Practically Reliable Primality Checker Based on Euler's Criterion with Random Bases ; Rýchly a prakticky spoľahlivý test prvočíselnosti založený na Eulerovom kritériu s náhodnými bázami

Συγγραφείς: Polak, Robert

Θεματικοί όροι: primality testing, Euler's criterion, pseudoprimes, Miller–Rabin, Mersenne primes, number theory, gmpy2

Relation: https://zenodo.org/records/17064974; oai:zenodo.org:17064974; https://doi.org/10.5281/zenodo.17064974

Διαθεσιμότητα: https://doi.org/10.5281/zenodo.17064974
https://zenodo.org/records/17064974

A Constructive Proof of the Infinitude of Mersenne Primes via Bit Templates in Lucas–Lehmer Sequences

Συγγραφείς: Okuda, Tetsuya

Θεματικοί όροι: Mersenne primes, Lucas-Lehmer test, constructive proof, bit templates, Hamming weight, primality testing, binary automaton

Relation: https://zenodo.org/records/16255004; oai:zenodo.org:16255004; https://doi.org/10.5281/zenodo.16255004

Διαθεσιμότητα: https://doi.org/10.5281/zenodo.16255004
https://zenodo.org/records/16255004

Integration OF Number Theory with Computer Algebra

Συγγραφείς: Raupova, M. (Mohinur), Abdimajitova, M. (Muxlisa)

Πηγή: Modern American Journal of Engineering, Technology, and Innovation

Θεματικοί όροι: Indonesia, Number theory, computer algebra systems, computational number theory, symbolic computation, algorithmic mathematics, primality testing, factorization algorithms, elliptic curves, cryptography, mathematical software

Περιγραφή αρχείου: application/pdf

Διαθεσιμότητα: https://www.neliti.com/publications/670542/integration-of-number-theory-with-computer-algebra