Sedat Akleylek

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On the construction of \(4 \times 4\) lightweight involutory MDS matrices over \(\mathbb{F}_{2^8}\)	2022-10-07	Paper
Efficient Nyberg-Rueppel type of NTRU digital signature algorithm Turkish Journal of Mathematics	2022-09-02	Paper
Accelerating number theoretic transform in GPU platform for qTESLA scheme	2022-08-30	Paper
On the Effect of k Values and Distance Metrics in KNN Algorithm for Android Malware Detection Advances in Data Science and Adaptive Analysis	2022-04-25	Paper
A novel Niederreiter-like cryptosystem based on the \((u\|u + \upsilon)\)-construction codes RAIRO - Theoretical Informatics and Applications	2022-01-12	Paper
A new matrix form to generate all \(3\times 3\) involutory MDS matrices over \(\mathbb{F}_{2^m}\) Information Processing Letters	2019-05-10	Paper
A novel 3-pass identification scheme and signature scheme based on multivariate quadratic polynomials Turkish Journal of Mathematics	2019-05-08	Paper
On the construction of \(20 \times 20\) and \(2 4 \times 24\) binary matrices with good implementation properties for lightweight block ciphers and hash functions Mathematical Problems in Engineering	2019-02-08	Paper
On the Polynomial Multiplication in Chebyshev Form IEEE Transactions on Computers	2017-07-12	Paper
Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity IEEE Transactions on Computers	2017-07-12	Paper
An efficient lattice-based signature scheme with provably secure instantiation Progress in Cryptology – AFRICACRYPT 2016	2016-06-22	Paper
On the efficiency of polynomial multiplication for lattice-based cryptography on GPUs using CUDA Cryptography and Information Security in the Balkans	2016-04-26	Paper
On the arithmetic operations over finite fields of characteristic three with low complexity Journal of Computational and Applied Mathematics	2015-06-17	Paper
Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity Progress in Cryptology - INDOCRYPT 2010	2010-12-07	Paper
Faster Montgomery modular multiplication without pre-computational phase for some classes of finite fields Lecture Notes in Electrical Engineering	2010-10-06	Paper

Research outcomes over time

This page was built for person: Sedat Akleylek