Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
An overview of trace based public key cryptography over finite fields
Date
2014-03-15
Author
Akyıldız, Ersan
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
64
views
0
downloads
Cite This
The Discrete Log Problem (DLP), that is computing x, given y = alpha(x) and (alpha) = G subset of F-q*, based Public Key Cryptosystem (PKC) have been studied since the late 1970's. Such development of PKC was possible because of the trapdoor function! : Z(l) -> G = (alpha) subset of F-q*, f (m) = alpha(m) is a group homomorphism. Due to this fact we have; Diffie Hellman (DH) type key exchange, EIGamal type message encryption, and Nyberg-Rueppel type digital signature protocols. The cryptosystems based on the trapdoor f (m) = am are well understood and complete. However, there is another trapdoor function f : Z(l) -> G, f (m) > Tr(alpha(m)), where G = <alpha > subset of F-qk* k >= 2, which needs more attention from researchers from a cryptographic tographic protocols point of view. In the above mentioned case, although f is computable, it is not clear how to produce protocols such as Diffie Hellman type key exchange, EIGamal type message encryption, and Nyberg-Rueppel type digital signature algorithm, in general. It would be better, of course if we can find a more efficient algorithm than repeated squaring and trace to compute f (m) = Tr(am) together with these protocols. In the literature we see some works for a more efficient algorithm to compute f (m) = Tr(am) and not wondering about the protocols. We also see some works dealing with an efficient algorithm to compute Tr(am) as well as discussing the cryptographic protocols. In this review paper, we are going to discuss the state of art on the subject.
Subject Keywords
Public key cryptosystems
,
Discrete logarithm problem
,
Finite field extensions
,
LFSR based exponentiation
,
Characteristic sequence
,
Digital signature scheme
URI
https://hdl.handle.net/11511/32176
Journal
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
DOI
https://doi.org/10.1016/j.cam.2013.10.022
Collections
Graduate School of Applied Mathematics, Article
Suggestions
OpenMETU
Core
Evaluation of Hypersingular Integrals on Non-planar Surfaces
Selcuk, Gokhun; Koç, Seyit Sencer (2014-05-16)
Solving electric field integral equation (EFIE) with Nystrom method requires accurate evaluation of hypersingular surface integrals since this method does not use divergence conforming basis and testing functions. The success of the method also depends on accurate representation of non-planar characteristics of the scattering object. In this study Hadamard finite part interpretation is used to evaluate hypersingular integrals over non-planar surfaces, which are represented by their Taylor series expansions....
A categorical approach to the maximum theorem
Koudenburg, Seerp Roald (2018-08-01)
Berge's maximum theorem gives conditions ensuring the continuity of an optimised function as a parameter changes. In this paper we state and prove the maximum theorem in terms of the theory of monoidal topology and the theory of double categories.
Almost periodic solutions of the linear differential equation with piecewise constant argument
Akhmet, Marat (2009-10-01)
The paper is concerned with the existence and stability of almost periodic solutions of linear systems with piecewise constant argument where t∈R, x ∈ Rn [·] is the greatest integer function. The Wexler inequality [1]-[4] for the Cauchy's matrix is used. The results can be easily extended for the quasilinear case. A new technique of investigation of equations with piecewise argument, based on an integral representation formula, is proposed. Copyright © 2009 Watam Press.
Some upper bounds for density of function spaces
Önal, Süleyman (Elsevier BV, 2009-05-01)
Let C-alpha(X, Y) be the set of all continuous functions from X to Y endowed with the set-open topology where alpha is a hereditarily closed, compact network on X which is closed Under finite unions. We proved that the density of the space C-alpha(X, Y) is at most iw(X) . d(Y) where iw(X) denotes the i-weight of the Tychonoff space X, and d(Y) denotes the density of the space Y when Y is an equiconnected space with equiconnecting function psi, and Y has a base consists of psi-convex Subsets of Y. We also pr...
An integral equation approach to the computation of nonlinear fields in electrical machines
Kükrer, Osman; Ertan, H. Bülnet (Institute of Electrical and Electronics Engineers (IEEE), 1988-7)
A numerical method based on an integral equation formulation, for the computation of nonlinear magnetostatic field, in two dimensions in cylindrical polar coordinates is given. The correctness of the method is illustrated by solving two linear two-dimensional magnetic field problems which have readily available analytical solutions. The dependence of the accuracy of the solution on the number and distribution of the meshes is studied on these examples. The method is then applied to the computation of the no...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
E. Akyıldız, “An overview of trace based public key cryptography over finite fields,”
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
, pp. 599–621, 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/32176.