Results 11 to 20 of about 195 (180)
SIAM Journal on Computing, 1982 Whether an odd number m is prime can be decided on the knowledge of the image of the function $a \mapsto a^{(m - 1)/2} (m)$. As a consequence, an algorithm for testing primality is proposed (under the extended Riemann hypothesis) which is more efficient than ones proposed by Miller [Pros. 7th ACM Symp. Theory of Computing, 1975, pp.
James Finn, Karl J. Lieberherr
+15 more sources
A Practical Collision-Based Power Analysis on RSA Prime Generation and Its Countermeasure
IEEE Access, 2019 We analyze the security of RSA prime generation implemented on embedded devices by a practical power analysis attack. Unlike previous differential power analysis-based attack on primality tests of RSA prime generation exploiting the deterministic ...
Sangyub Lee +3 more
doaj +1 more source
Genefer: Programs for Finding Large Probable Generalized Fermat Primes
Journal of Open Research Software, 2015 Genefer is a suite of programs for performing Probable Primality (PRP) tests of Generalised Fermat numbers 'b'2'n'+1 (GFNs) using a Fermat test. Optimised implementations are available for modern CPUs using single instruction, multiple data (SIMD ...
Iain Arthur Bethune, Yves Gallot
doaj +1 more source
The Miller–Rabin test with randomized exponents
Journal of Mathematical Cryptology, 2009 We analyze a variant of the well-known Miller–Rabin test, that may be useful in preventing side-channel attacks to the random prime generation on smart cards: In the Miller–Rabin primality test for a positive integer n, one computes repeatedly the ...
Böckle Gebhard
doaj +1 more source
METHOD OF TESTING LARGE NUMBERS FOR PRIMALITY
Сучасні інформаційні системиThe current stage of scientific and technological development entails ensuring information security across all domains of human activity. Confidential data and wireless channels of remote control systems are particularly sensitive to various types of ...
Vladimir Pevnev +3 more
doaj +1 more source
Primality test (When an integer test is enough for primality)
, 2021 A programatic way to test for primes using only an integer test for a specific prime series.
openaire +1 more source
Neuroanatomical and functional correlates in borderline personality disorder: A narrative review
Ibrain, Volume 11, Issue 1, Page 19-31, Spring 2025.Borderline personality disorder (BPD) is considered a dysfunctional, stable, and pervasive alteration in personality functioning with the inability to adapt to the environment, mental rigidity, and ego‐syntonic, and like all personality disorders is a consistent pattern of inner experience and behavior that deviates markedly from the expectations of ...
Giulio Perrotta
wiley +1 more source
Journal of Chemical Technology &Biotechnology, EarlyView.Abstract BACKROUND The pseudo‐fruit of Rosa canina L. is a rich source of bioactive compounds with antioxidant, anti‐inflammatory, anti‐cancer, anti‐diabetic, anti‐aging, and antimicrobial activities. The aim of the present study is the optimization of a green process based on the action of two hydrolytic enzyme preparations, namely Pectinex® Ultra ...
Zafeiria Lemoni +6 more
wiley +1 more source
Primality Tests and Prime Certificate
CoRR, 2022 This note presents a formalisation done in Coq of Lucas-Lehmer test and Pocklington certificate for prime numbers. They both are direct consequences of Fermat little theorem. Fermat little theorem is proved using elementary group theory and in particular Lagrange theorem.
Laurent Théry, Sophia Antipolis
openaire +3 more sources