Results 91 to 100 of about 463 (134)
, 2013 With the boom in information technology and the penetration of these technologies in an increasing number of areas, such as electronic business, many questions about security arise. Data in electronic form bring many benefits, but they are vulnerable to various abuses. Therefore, data need to be adequately protected.
Lynn Margaret Batten
exaly +5 more sources
Fooling Primality Tests on Smartcards [PDF]
, 2020 We analyse whether the smartcards of the JavaCard platform correctly validate primality of domain parameters. The work is inspired by Albrecht et al. [1], where the authors analysed many open-source libraries and constructed pseudoprimes fooling the primality testing functions.
Vladimir Sedlacek +2 more
core +4 more sources
Papers from the international symposium on Symbolic and algebraic computation - ISSAC '92, 1992 Rabin’s algorithm is commonly used in computer algebra systems and elsewhere for primality testing. This paper presents an experience with this in the Axiom* computer algebra system. As a result of this experience, we suggest certain strengthenings of the algorithm.
J.H. Davenport, J. H. Davenport
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Russian Mathematics, 2022
This article studies a combined primality test for natural numbers, called \textit{L2 test}, by combining the Lucas test and the Fermat condition test. The efficiency and complexity of this test are also analyzed, and a methodology for identifying composite numbers that pass the L2 test (called L2 pseudoprimes) is presented.
Ishmukhametov, S. T. +3 more
openaire +1 more source
This article studies a combined primality test for natural numbers, called \textit{L2 test}, by combining the Lucas test and the Fermat condition test. The efficiency and complexity of this test are also analyzed, and a methodology for identifying composite numbers that pass the L2 test (called L2 pseudoprimes) is presented.
Ishmukhametov, S. T. +3 more
openaire +1 more source
Primality and identity testing via Chinese remaindering
Journal of the ACM, 2003 We give a simple and new randomized primality testing algorithm by reducing primality testing for number n to testing if a specific univariate identity over Zn holds.We also give new randomized algorithms for testing if a multivariate polynomial, over a ...
Manindra Agrawal
exaly +2 more sources
Primality testing of large numbers in Maple
Computers and Mathematics With Applications, 1995 Primality testing of large numbers is very important in many areas of mathematics, computer science and cryptography, and in recent years, many of the modern primality testing algorithms have been incorporated in Computer Algebra Systems (CAS) such as ...
Yan, S.Y.
exaly +2 more sources