Yazar "Akleylek S." için listeleme
-
Accelerating Number Theoretic Transform in GPU Platform for qTESLA Scheme
Lee W.-K.; Akleylek S.; Yap W.-S.; Goi B.-M. (Springer, 2019)Post-quantum cryptography had attracted a lot of attentions in recent years, due to the potential threat emerged from quantum computer against traditional public key cryptography. Among all post-quantum candidates, ... -
An artificial bee colony algorithm for solving the weapon target assignment problem
Durgut R.; Kutucu H.; Akleylek S. (Association for Computing Machinery, 2017)In this paper, we deal with the static weapon target assignment (WTA) problem which is a hard combinatorial optimization problem having some industrial applications. The aim of the WTA problem is to find an assignment of ... -
Computational aspects of lattice-based cryptography on graphical processing unit
Akleylek S.; Tok Z.Y. (IGI Global, 2015)In this chapter, the aim is to discuss computational aspects of lattice-based cryptographic schemes focused on NTRU in view of the time complexity on a graphical processing unit (GPU). Polynomial multiplication algorithms, ... -
An efficient lattice-based signature scheme with provably secure instantiation
Akleylek S.; Bindel N.; Buchmann J.; Krämer J.; Marson G.A. (Springer Verlag, 2016)In view of the expected progress in cryptanalysis it is important to find alternatives for currently used signature schemes such as RSA and ECDSA. The most promising lattice-based signature schemes to replace these schemes ... -
Faster Montgomery modular multiplication without pre-computational phase for some classes of finite fields
Akleylek S.; Cenk M.; Özbudak F. (2010)In this paper, we give faster versions of Montgomery modular multiplication algorithm without pre-computational phase for GF(p) and GF(2m ) which can be considered as a generalization of [3], [4] and [5]. We propose sets ... -
Formal Analysis of MaTRU Cryptosystem
Akleylek S.; Cevik N. (Institute of Electrical and Electronics Engineers Inc., 2019)Security analysis of cryptosystems is a significant area due to the effects on the real world. There are main ways for security analysis: the first one is resistance to the attacks and the second one is on the hardness of ... -
A New 3-pass Zero-knowledge Lattice-based Identification Scheme
Akleylek S.; Soysaldi M. (Institute of Electrical and Electronics Engineers Inc., 2019)It is very important that the communicating parties are able to verify their identity in order to communicate with each other properly. Identification schemes are used for this purpose. The identification schemes, widely ... -
On the efficiency of polynomial multiplication for lattice-based cryptography on GPUs using CUDA
Akleylek S.; Dağdelen Ö.; Tok Z.Y. (Springer Verlag, 2016)Polynomial multiplication is the most time-consuming part of cryptographic schemes whose security is based on ideal lattices. Thus, any efficiency improvement on this building block has great impact on the practicability ... -
Parameter Estimation for Lattice-Based Cryptosystems by Using Sieving Algorithms
Akleylek S.; Satilmis H. (Institute of Electrical and Electronics Engineers Inc., 2019)The security of quantum resistant lattice-based cryptosystems mainly depend on the shortest vector problem (SVP) or the closest vector problem (CVP). In this paper, sieving algorithms such as ListSieve, GaussSieve, ... -
Permission Weighting Approaches in Permission Based Android Malware Detection
Kural O.E.; Sahin D.O.; Akleylek S.; Kilic E. (Institute of Electrical and Electronics Engineers Inc., 2019)With the increasing use of mobile devices in daily life, the number of malware running on mobile devices is increasing. Increased malware may cause material and non- pecuniary damage, such as the seizure of personal ... -
Polynomial multiplication over binary fields using charlier polynomial representation with low space complexity
Akleylek S.; Cenk M.; Özbudak F. (2010)In this paper, we give a new way to represent certain finite fields GF(2n ). This representation is based on Charlier polynomials. We show that multiplication in Charlier polynomial representation can be performed with ... -
A Probably Secure Bi-GISIS Based Modified AKE Scheme with Reusable Keys
Akleylek S.; Seyhan K. (Institute of Electrical and Electronics Engineers Inc., 2020)In this paper, we propose a novel authenticated key exchange scheme based on the Bi-GISIS problem for the post-quantum world. The security of the proposed scheme is based on the hardness assumption of the Bi-GISIS problem. ... -
Reconciliation Methods Used in Lattice-Based Key Exchange/Encapsulation Protocols
Akleylek S.; Seyhan K. (Institute of Electrical and Electronics Engineers Inc., 2019)Diffie-Hellman-like key exchange/encapsulation mechanisms, based on hard lattice problems proposed for post-quantum cryptography, require intermediate processing steps. These processes called the reconciliation method, ... -
A study on the use of quantum computers, risk assessment and security problems
Arslan B.; Ulker M.; Akleylek S.; Sagiroglu S. (Institute of Electrical and Electronics Engineers Inc., 2018)In the computer based solutions of the problems in today's world; if the problem has a high complexity value, different requirements can be addressed such as necessity of simultaneous operation of many computers, the long ...
