Národní úložiště šedé literatury Nalezeno 2 záznamů.  Hledání trvalo 0.01 vteřin. 
Algorithms for Determining the Order of the Group of Points on an EllipticCurve with Application in Cryptography
Trchalíková, Jana ; Knoflíček, František (oponent) ; Kureš, Miroslav (vedoucí práce)
The elliptic curves are plane curves whose points satisfy the Weierstrass equation. Their main application is in the cryptography, where they represent an important device for creating code which is hard to break without knowing the key and which is short in comparison with other encoding methods. The elliptic curves are widely used thanks to these advantages. To be able to code and decode in the elliptic curve cryptography we must know the order of the given elliptic curve. The Shank's algorithm and its improved version, the Mestre's algorithm, are used for its determining.
Algorithms for Determining the Order of the Group of Points on an EllipticCurve with Application in Cryptography
Trchalíková, Jana ; Knoflíček, František (oponent) ; Kureš, Miroslav (vedoucí práce)
The elliptic curves are plane curves whose points satisfy the Weierstrass equation. Their main application is in the cryptography, where they represent an important device for creating code which is hard to break without knowing the key and which is short in comparison with other encoding methods. The elliptic curves are widely used thanks to these advantages. To be able to code and decode in the elliptic curve cryptography we must know the order of the given elliptic curve. The Shank's algorithm and its improved version, the Mestre's algorithm, are used for its determining.

Chcete být upozorněni, pokud se objeví nové záznamy odpovídající tomuto dotazu?
Přihlásit se k odběru RSS.