Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Industrial-grade prime"'
Publikováno v:
Designs, Codes and Cryptography. 77:515-539
In his extensive memoir on the sequences that now bear his name, Lucas provided some primality tests for numbers $$N$$N, where $$N\pm 1$$N±1 is divisible by a large prime power. No proofs were provided for these tests, and they are not correct as st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8da78def8bb60a11f6c6f2ae951467d
https://doi.org/10.1007/s10623-015-0088-0
https://doi.org/10.1007/s10623-015-0088-0
Autor:
Shigenori Uchiyama, Kazuki Azami
Publikováno v:
JSIAM Letters. 6:1-4
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f73f9f7c992a215c701e39623a13347
https://doi.org/10.14495/jsiaml.6.1
https://doi.org/10.14495/jsiaml.6.1
Publikováno v:
2016 International Conference on Accessibility to Digital World (ICADW).
With the increasing popularity and usage of cryptography and network security, prime generation and primality testing has become a significant issue. Various primality tests have been introduced in the past and we compare and contrast some popular pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dcdcea3fce0821a08208968d19f60f16
https://doi.org/10.1109/icadw.2016.7942510
https://doi.org/10.1109/icadw.2016.7942510
Autor:
Sang-Un Lee
Publikováno v:
The Journal of the Institute of Webcasting, Internet and Telecommunication. 13:103-109
Miller-Rabin method is the most prevalently used primality test. However, this method mistakenly reports a Carmichael number or semi-prime number as prime (strong lier) although they are composite numbers. To eradicate this problem, it selects k numb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f50b3297366a397759acf6d22761645
https://doi.org/10.7236/jiibc.2013.13.3.103
https://doi.org/10.7236/jiibc.2013.13.3.103
Autor:
Paulo Ribenboim
Publikováno v:
Prime Numbers, Friends Who Give Problems: A Trialogue with Papa Paulo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7fd5d08132387ed70c9ace7cec23681a
https://doi.org/10.1142/9789814725828_0013
https://doi.org/10.1142/9789814725828_0013
Publikováno v:
Discrete Algebraic Methods: Arithmetic, Cryptography, Automata and Groups
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::083d6d04745a24df1fa51d8fb37c680b
https://doi.org/10.1515/9783110413335-005
https://doi.org/10.1515/9783110413335-005
Autor:
Boris S. Verkhovsky
Publikováno v:
International Journal of Communications, Network and System Sciences. :513-519
Prime integers and their generalizations play important roles in protocols for secure transmission of information via open channels of telecommunication networks. Generation of multidigit large primes in the design stage of a cryptographic system is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e04458491536b4506effce446d901955
https://doi.org/10.4236/ijcns.2012.59062
https://doi.org/10.4236/ijcns.2012.59062
Autor:
Myeong-Bok Choi, Sang-Un Lee
Publikováno v:
Journal of the Korea Society of Computer and Information. 16:103-108
Generally, Miller-Rabin method has been the most popular primality test. This method arbitrary selects m at k-times from m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::909d7c3735e21a6a148df0cacb9b2c91
https://doi.org/10.9708/jksci.2011.16.8.103
https://doi.org/10.9708/jksci.2011.16.8.103
Autor:
M. Chaves
Publikováno v:
The Mathematical Gazette. 95:266-269
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::216d0f69aeecc1e480cf06a4cdfe329a
https://doi.org/10.1017/s0025557200003004
https://doi.org/10.1017/s0025557200003004
Publikováno v:
International Journal of Computer Applications. 100:14-16
There has been an increasing interest in prime numbers during the past three decades since the introduction of public-key cryptography owing to the large spread of internet and electronic banking. The largest prime number discovered so far, which is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fb97c37c64c53c217d521016ee0734fd
https://doi.org/10.5120/17505-8053
https://doi.org/10.5120/17505-8053