Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Parezanovic, Dusko"'
In this paper we present the experimental results that more clearly than any theory suggest an answer to the question: when in detection of large (probably) prime numbers to apply, a very resource demanding, Miller-Rabin algorithm. Or, to put it anot
Externí odkaz:
http://arxiv.org/abs/1401.2107
Autor:
Vidakovic, Dragan, Parezanovic, Dusko
Publikováno v:
International Journal of Computer Sciece and Busines Informatics (IJCSBI),Vol 4, No 1 (2013): August 2013
In this paper, we will present how to find keys elliptic curve cryptosystems (ECC) with simple tools of Delphi 7 console application, using the software problem solving of the scalar point multiplication in the field GF(p), where p is an arbitrary pr
Externí odkaz:
http://arxiv.org/abs/1309.0245
Publikováno v:
(IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 4, No.3, 2013
We believe that there is no real data protection without our own tools. Therefore, our permanent aim is to have more of our own codes. In order to achieve that, it is necessary that a lot of young researchers become interested in cryptography. We bel
Externí odkaz:
http://arxiv.org/abs/1304.4572
Publikováno v:
Advanced Computing: An International Journal ( ACIJ ), Vol.4, No.2, March 2013
In this paper, we present a complete digital signature message stream, just the way the RSA digital signature scheme does it. We will focus on the operations with large numbers due to the fact that operating with large numbers is the essence of RSA t
Externí odkaz:
http://arxiv.org/abs/1304.3309
Publikováno v:
International Journal of UbiComp (IJU), Vol.4, No.1, January 2013
In order to avoid unnecessary applications of Miller-Rabin algorithm to the number in question, we resort to trial division by a few initial prime numbers, since such a division take less time. How far we should go with such a division is the that we
Externí odkaz:
http://arxiv.org/abs/1302.1882