Discrete logarithm problem on elliptic curves

Download

093442.pdf

Date

2000

Author

Saldamlı, Gökay

Metadata

Show full item record

Item Usage Stats

47
views

0
downloads

URI

https://hdl.handle.net/11511/7610

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Discrete symmetries and nonlocal reductions GÜRSES, METİN; Pekcan, Asli; Zheltukhın, Kostyantyn (Elsevier BV, 2020-01-31) We show that nonlocal reductions of systems of integrable nonlinear partial differential equations are the special discrete symmetry transformations.
Discrete bifurcation diagrams and persistence Örnek, Türkmen; Pamuk, Semra; Department of Mathematics (2018) Let fti : M → R be a discrete Morse function on a cell complex M for each t0 < t1 < ... < tn = 1. Let us denote slice as Mi = M ×{ti} ⊂ M × I and let Vi be the discrete vector ﬁeld on each slice. After extending the discrete vector ﬁeld on each slice to a discrete vector ﬁeld on all of M ×I, a discrete bifurcation diagram is obtained by connecting critical cells of the slices. In”Birth and Death in Discrete MorseTheory”(King,Knudson,Mramor), a solution about ﬁnding the discrete bifurcation diagram has been ...
Discrete discriminant analysis and dependence Geyik, Cemal; Tuncer, Yalçın; Department of Statistics (1990)
Discrete linear Hamiltonian systems: Lyapunov type inequalities, stability and disconjugacy criteria Zafer, Ağacık (2012-12-15) In this paper, we first establish new Lyapunov type inequalities for discrete planar linear Hamiltonian systems. Next, by making use of the inequalities, we derive stability and disconjugacy criteria. Stability criteria are obtained with the help of the Floquet theory, so the system is assumed to be periodic in that case.
Discrete gradient method: Derivative-free method for nonsmooth optimization Bagirov, A. M.; Karasözen, Bülent; Sezer, M. (2008-05-01) A new derivative-free method is developed for solving unconstrained nonsmooth optimization problems. This method is based on the notion of a discrete gradient. It is demonstrated that the discrete gradients can be used to approximate subgradients of a broad class of nonsmooth functions. It is also shown that the discrete gradients can be applied to find descent directions of nonsmooth functions. The preliminary results of numerical experiments with unconstrained nonsmooth optimization problems as well as th...

Citation Formats

G. Saldamlı, “Discrete logarithm problem on elliptic curves,” Middle East Technical University, 2000.