Kryptografická schémata používající diskrétní logaritmus
In the paper we try to give a view of the discrete logarithm problem, especially of related problems that appear in literature since 2001. These problems are based on a computation of Weil and Tate pairing on eliptic curves. We give a view of these problems including some reductions. We mention some...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Dissertation |
| Language: | Czech |
| Published: |
2008
|
| Online Access: | http://www.nusl.cz/ntk/nusl-294678 |