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
On the trace based public key cryptosystems over finite fields
Download
index.pdf
Date
2013
Author
Ashraf, Muhammad
Metadata
Show full item record
Item Usage Stats
62
views
30
downloads
Cite This
In this thesis, the trace based Public Key Cryptosystems (PKC) are explored from theoretical and implementation point of view. We will introduce cryptographic protocols for the ones they are not discussed yet. We introduce improved trace based exponentiation algorithm for fifth degree recursive relation. The Discrete Log Problem (DLP), that is computing $x$, given $y=\alpha^x$ and $<\alpha>=G\subset \F_q^*$, based Public Key Cryptosystems (PKC) are being studied since late 1970's. Such development of PKC was possible because of the trapdoor function $f:\Z_\ell\rightarrow G=<\alpha>\subset \F_q^*$, $f(m)=\alpha^m$, is a group homomorphism. Due to this fact, we have Diffie Hellman (DH) type key exchange, ElGamal type message encryption, and Nyberg Rueppel type digital signature protocols. The cryptosystems based on the trapdoor $f(m)=\alpha^m$ are well understood and complete. However, there is another trapdoor function $f:\Z_\ell\rightarrow G$, $f(m)\rightarrow Tr(\alpha^m)$, where $G=<\alpha>\subset \F_{q^k}^*,\; k\ge 2$, which needs more attention from cryptographic protocols point of view. There are some works for a more efficient algorithm to compute $f(m)=Tr(\alpha^m)$ and not wondering about the protocols. There are also some works dealing with an efficient algorithm to compute $Tr(\alpha^m)$ as well as discussing the cryptographic protocols. In this thesis these works are studied along with introduction of some protocols which are not discussed earlier and trace based exponentiation for fifth degree recursive relation is improved.
Subject Keywords
Public key cryptography.
,
Finite element method.
,
Exponential functions.
,
Digital signatures.
URI
http://etd.lib.metu.edu.tr/upload/12616104/index.pdf
https://hdl.handle.net/11511/22836
Collections
Graduate School of Applied Mathematics, Thesis
Suggestions
OpenMETU
Core
On lattice based digital signature schemes
Javani, Farid; Akyıldız, Ersan; Department of Cryptography (2014)
Lattice based cryptography is one of the few hopes for secure public key cryptography in post quantum era since there is no known polynomial time quantum algorithm that can solve hard lattice problems. But despite this precious property, for a cryptographic construction which is designed based on a hard lattice problem, to be secure, required time and space is not efficient. This has led to introduction of structured lattices that need less time and space; indeed the only existing standard on lattice based ...
New methods for public key cryptosystems based on XTR
AKLEYLEK, SEDAT; KIRLAR, Barış Bülent (2015-12-01)
In this paper, we propose novel deterministic and probabilistic public key cryptographic schemes based on an effective and compact subgroup trace representation cryptosystem to handle with the problem of secure and efficient communication between the server and resource-constrained device. The proposed schemes use the hardness of the Trace-discrete logarithmic like problem. We also show that the deterministic version of the proposed scheme is a one-way trapdoor, and the probabilistic version of the proposed...
On constructions and enumeration of bent and semi-bent functions
Koçak, Neşe; Doğanaksoy, Ali; Saygı, Zülfükar; Department of Cryptography (2015)
Bent and semi-bent functions play an important role in cryptography and coding theory. They are widely studied as parts of building blocks in symmetric key cryptosystems because they provide resistance to fast correlation attacks and linear cryptanalysis due to their high nonlinearity. Besides, they can possess other desirable cryptographic properties such as low autocorrelation, propagation criteria, resiliency and high algebraic degree. Therefore, parallel to the advances in cryptanalysis techniques, the ...
Design and performance evaluation of a flexible and efficient server assisted signature protocol
Bicakci, K; Baykal, Nazife (2003-07-03)
One method to reduce the computational costs of generating public key signatures on constrained devices is to get help from a verifiable server In this paper, we propose a (verifiable) server assisted signature protocol which is the first one that totally elliminates public key operations for the ordinary user Our protocol is also more efficient and flexible in terms of storage since unlike previous ones the user does not need to save the server's signatures to prove its cheating.
Elliptic curve pairing-based cryptography
Kırlar, Barış Bülent; Akyıldız, Ersan; Department of Cryptography (2010)
In this thesis, we explore the pairing-based cryptography on elliptic curves from the theoretical and implementation point of view. In this respect, we first study so-called pairing-friendly elliptic curves used in pairing-based cryptography. We classify these curves according to their construction methods and study them in details. Inspired of the work of Koblitz and Menezes, we study the elliptic curves in the form $y^{2}=x^{3}-c$ over the prime field $\F_{q}$ and compute explicitly the number of points $...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. Ashraf, “On the trace based public key cryptosystems over finite fields,” Ph.D. - Doctoral Program, Middle East Technical University, 2013.