New fast algorithms for polynomial interpolation and evaluation on the chebyshev node set

Download
093137.pdf
2000
Deliceoğlu, Ali
Show full item record
43
views
0
downloads
https://hdl.handle.net/11511/7360
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

NEW TMVP-BASED MULTIPLICATION ALGORITHMS FOR POLYNOMIAL QUOTIENT RINGS AND APPLICATION TO POST-QUANTUM CRYPTOGRAPHY
Keskinkurt Paksoy, İrem; Cenk, Murat; Department of Cryptography (2022-7-28)
One of the quantum-safe cryptography research areas is lattice-based cryptography. Most lattice-based schemes need efficient algorithms for multiplication in polynomial quotient rings. The fastest algorithm known for multiplication is the Number Theoretic Transform (NTT), which requires certain restrictions on the parameters of the ring, such as prime modulus. Direct NTT application is not an option for some schemes that do not comply with these restrictions, e.g., the two finalists of the PQC standardizati...
New algorithms and techniques for microprocessor-controlled PWM induction drives
Kükrer, Osman; Ertan, Hulusi Bülent; Department of Electrical and Electronics Engineering (1987)
New experimental methods for the determination of the P parity of K mesons
Pak, Namık Kemal; Rekalo, MP (1999-04-01)
We propose new methods to determine the P parity of the K mesons experimentally, based on the measurement of polarization observables in K-meson production in polarized proton-proton collisions. The first method is based on the measurement of the sign of the spin correlation coefficient with transversally polarized protons. The second one is based on the measurement of the polarization transfer coefficient from the initial proton to the produced hyperon. [S0556-2821(99)01905-0].
New Efficient Algorithms for Multiplication Over Fields of Characteristic Three
Cenk, Murat; Hasan, M. Anwar (2018-03-01)
In this paper, we first present an enhancement of the well-known Karatsuba 2-way and 3-way algorithms for characteristic three fields, denoted by where nae1. We then derive a 3-way polynomial multiplication algorithm with five 1/3 sized multiplications that use interpolation in . Following the computation of the arithmetic and delay complexity of the proposed algorithm, we provide the results of our hardware implementation of polynomial multiplications over and . The final proposal is a new 3-way polynomial...
New methods for decentralised sensor fusion and extended target tracking models
Köksal, Hilal; Özkan, Emre; Department of Electrical and Electronics Engineering (2022-12-16)
The focus of this thesis is two-fold; the first study investigates the use of student-t distribution for the decentralised multi-sensor fusion problem. Multi-sensor fusion can suffer from several artefacts such as low channel capacity, delays in the communication channels, the correlation in the acquired information and sensor biases. When combined with these artefacts, the errors in the local sensors’ estimates can result in conflicting information at the fusion center. Such conflicts may later be resolved...
Citation Formats
A. Deliceoğlu, “New fast algorithms for polynomial interpolation and evaluation on the chebyshev node set,” Middle East Technical University, 2000.
METU IIS - Integrated Information Service open@metu.edu.tr