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
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
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
Spectral modular multiplication
Download
index.pdf
Date
2009
Author
Akın, İhsan Haluk
Metadata
Show full item record
Item Usage Stats
157
views
63
downloads
Cite This
Spectral methods have been widely used in various fields of engineering and applied mathematics. In the field of computer arithmetic: data compression, polynomial multiplication and the spectral integer multiplication of Sch¨onhage and Strassen are among the most important successful utilization. Recent advancements in technology report the spectral methods may also be beneficial for modular operations heavily used in public key cryptosystems. In this study, we evaluate the use of spectral methods in modular multiplication. We carefully compare their timing performances with respect to the full return algorithms. Based on our evaluation, we introduce new approaches for spectral modular multiplication for polynomials and exhibit standard reduction versions of the spectral modular multiplication algorithm for polynomials eliminating the overhead of Montgomery’s method. Moreover, merging the bipartite method and standard approach, we introduce the bipartite spectral modular multiplication to improve the hardware performance of spectral modular multiplication for polynomials. Finally, we introduce Karatsuba combined bipartite method for polynomials and its spectral version.
Subject Keywords
Cryptography.
,
Mathematics.
URI
http://etd.lib.metu.edu.tr/upload/3/12610463/index.pdf
https://hdl.handle.net/11511/18517
Collections
Graduate School of Applied Mathematics, Thesis
Suggestions
OpenMETU
Core
Results on lcz sequences and quadratic forms
Saygı, Elif; Özbudak, Ferruh; Department of Cryptography (2009)
In this thesis we study low correlation zone (LCZ) sequence sets and a class of quadratic forms. In the first part we obtain two new classes of optimal LCZ sequence sets. In our first construction using a suitable orthogonal transformation we extend some results of [21]. We give new classes of LCZ sequence sets defined over Z4 in our second construction. We show that our LCZ sequence sets are optimal with respect to the Tang, Fan and Matsufiji bound [37]. In the second part we consider some special lineariz...
Basic cryptanalysis methods on block ciphers
Çelik, Dilek; Doğanaksoy, Ali; Department of Cryptography (2010)
Differential cryptanalysis and linear cryptanalysis are the first significant methods used to attack on block ciphers. These concepts compose the keystones for most of the attacks in recent years. Also, while designing a cipher, these attacks should be taken into consideration and the cipher should be created as secure against them. Although di fferential cryptanalysis and linear cryptanalysis are still important, they started to be ine cient due to the improvements in the technology. So, these attacks are ...
A generalized correlated random walk approximation to fractional brownian motion
Coşkun, Buket; Vardar Acar, Ceren; Department of Statistics (2018)
The application of fractional Brownian Motion (fBm) has drawn a lot of attention in a large number of areas, ranging from mathematical finance to engineering. The feature of long range dependency limited due to the value of Hurst parameter H ∈ (1/2, 1) makes fBm the desired process for stochastic modelling. The simulation of fBm is also vital for the application in such fields. Hence, the development of an algorithm to simulate an fBm is required in both theoretical and practical aspects of fBm. In this stu...
Symmetric interior penalty Galerkin method for fractional-in-space phase-field equations
Stoll, Martin; Yücel, Hamdullah (2018-01-01)
Fractional differential equations are becoming increasingly popular as a modelling tool to describe a wide range of non-classical phenomena with spatial heterogeneities throughout the applied sciences and engineering. However, the non-local nature of the fractional operators causes essential difficulties and challenges for numerical approximations. We here investigate the numerical solution of fractional-in-space phase-field models such as Allen-Cahn and Cahn-Hilliard equations via the contour integral meth...
Some generalized multipartite access structures
Kaşkaloğlu, Kerem; Özbudak, Ferruh; Department of Cryptography (2010)
In this work, we study some generalized multipartite access structures and linear secret sharing schemes for their realizations. Given a multipartite set of participants with m compartments (or levels) and m conditions to be satisfied by an authorized set, we firstly examine the intermediary access structures arousing from the natural case concerning that any c out of m of these conditions suffice, instead of requiring anyone or all of the m conditions simultaneously, yielding to generalizations for both th...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
İ. H. Akın, “Spectral modular multiplication,” Ph.D. - Doctoral Program, Middle East Technical University, 2009.