Selected Publications

Journal
  • Sedat Akleylek, Meryem Soysaldı, "A novel 3-pass identification scheme and signature scheme based on multivariate quadratic polynomials", Turkish Journal of Mathematics, Vol.43, No.1, pp.241-257, doi:10.3906/mat-1803-92, 2019.
  • Gülsüm Gözde Güzel, Muharrem Tolga Sakallı, Sedat Akleylek, Yasemin Çengellenmiş, Vincent Rijmen, “A New Matrix Form to Generate All 3x3 Involutory MDS Matrices over Binary Field Extensions”, Information Processing Letters, Vol.147, pp.61-68, doi: 10.1016/j.ipl.2019.02.013, 2019.
  • Sedat Akleylek, Meryem Soysaldı, Djallel Eddine Boubiche, Homero Toral-Cruz, “A Novel Method for Polar Form of Any Degree of Multivariate Polynomials with Applications in IoT”, Sensors, Vol.19, No.4, pp.1-11, doi:10.3390/s19040903, 2019.
  • Meltem Kurt Pehlivanoğlu, Muharrem Tolga Sakallı Sedat Akleylek, Nevcihan DuruVincent Rijmen"Generalization of Hadamard Matrix to Generate Involutory MDS Matrices for Lightweight Cryptography", IET Information Security,  doi: 10.1049/iet-ifs.2017.0156, 2018.
  • Sedat Akleylek, Vincent RijmenMuharrem Tolga Sakallı, Emir Öztürk, "Efficient Methods to Generate Cryptographically Significant Binary Diffusion Layers", IET Information Security, Vol.11, No.4, pp.177-187, doi: 10.1049/iet-ifs.2016.0085, 2017.
  • Sedat Akleylek, Erdem AlkımErdal Kılıç, “A modified parallel learning vector quantization algorithm for real-time hardware applications”, Journal of Circuits, Systems, and Computers, Vol.26, No.10, 175156, doi: 10.1142/S0218126617501560, 2017.
  • Sedat Akleylek, Erdem Alkım, Zaliha Yüce Tok, "Sparse Polynomial Multiplication for Lattice- based Cryptography with Small Complexity", Journal of Supercomputing, Vol.72, No.2, pp.438-450, doi: 10.1007/s11227-015-1570-1, 2016.
  • Sedat Akleylek. Muharrem Tolga Sakallı, Emir Öztürk, Andaç Mesut Şahin, Gökhan Tuncay, "Generating Binary Diffusion Layers with Maximum/High Branch Numbers and Low Search Complexity", Security and Communication Networks, Vol.9, No.16, pp.3558-3569, doi: 10.1002/sec.1561, 2016.
  • Sedat Akleylek, Barış Bülent Kırlar"New Methods for Public Key Cryptosystems based on XTR", Security and Communication Networks, Vol.8, No.18, pp.3682-3689, doi: 10.1002/sec.1291, 2015.
  • Sedat Akleylek, Zaliha Yüce Tok, "Efficient Interleaved Montgomery Modular Multiplication for Lattice-Based Cryptography", IEICE Electronics Express, doi: 10.1587/elex.11.20140960, 2014.
  • Muharrem Tolga SakallıSedat Akleylek, Bora Aslan, Ercan Buluş, Fatma Büyüksaraçoğlu Sakallı, "On the Construction of 20x20 and 24x24 Binary Matrices with Good Implementation Properties for Lightweight Block Ciphers and Hash Functions", Mathematical Problems in Engineering, doi: 10.1155/2014/540253, 2014.
  • Sedat Akleylek, Ferruh Özbudak and Canan Özel, "On the Arithmetic Operations over Finite Fields of Characteristic Three with Low Complexity", Journal of Computational and Applied Mathematics, Vol.259, pp.546-554, Part B, doi: 10.1016/j.cam.2013.08.11, 2014.
  • Sedat Akleylek, Murat Cenk and Ferruh Özbudak, "A New Representation of Elements of Binary Fields  with Subquadratic Space Complexity Multiplication of Polynomials", IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol.E96-A, No.10, pp.2016-2024, doi: 10.1587/transfun.E96.A.1, 2013.
  • Sedat Akleylek, Murat Cenk and Ferruh Özbudak, "On the Generalization of Special Moduli for Faster Interleaved Montgomery Modular Multiplication", IET Information Security, Vol.7, No.3, pp.165-171, doi: 10.1049/iet.ifs.2010.0271, 2013.
  • Sedat Akleylek and Ferruh Özbudak  “Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity", IEEE Transactions on Computers, Vol.61, No.3, pp.427-432, doi: 10.1109/TC.2011.29, 2012.
  • Sedat Akleylek, Murat Cenk, and Ferruh Özbudak  “On the Polynomial Multiplication in Chebyshev Form", IEEE Transactions on Computers, Vol.61, No.4, pp.584-587, doi: 10.1109/TC.2011.38, 2012.
  • Sedat Akleylek, Barış Bülent Kırlar, Ömer Sever and Zaliha Yüce, “A New Short Signature Scheme with Random Oracle from Bilinear Pairings", Journal of Telecommunications and Information Technology, vol.5, no:1, pp.5-11, 2011.
  • Sedat Akleylek, Levent Emmungil and Urfat Nuriyev, “A Modified Algorithm for Peer-to-Peer Security”, Applied and Computational Mathematics : An International Journal, Vol.6, No.2, p.258-265, ISSN:1683-3511, 2007.

Peer Reviewed Conference Articles
  • Wai-Kong Lee, Bok-Min Goi, Denis Chee-Keong Wong, Wun-She Yap, Sedat Akleylek, “Fast NTRU Encryption in GPU for Secure IoP Communication in Post-quantum Era”, IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation, pp.1923-1928, November 7-11, 2018.
  • İlker Özçelik, Sedat Akleylek, İbrahim Özçelik, “TRCyberLab: An Infrastructure for Future Internet and Security Studies”, 6th International Symposium on Digital Forensic and Security (ISDFS 2018), Antalya, Turkey, IEEE Explore Proceedings of ISDFS 2018, pp.431-435, March 22-25, 2018.
  • Sedat Akleylek, Nina Bindel, Johannes A. Buchmann, Juliane Kramer, Giorgia Azzurra Marson, "An Efficient Lattice-Based Signature Scheme with Provably Secure Instantiation", 8th International Conference on Cryptology in Africa (AFRICACRYPT 2016), LNCS Vol.9646, pp.44-60, April 13-15, Fes, Morocco, 2016.
  • Sedat Akleylek, Ferruh Özbudak, "Multiplication in a Galois Ring", Proceedings of The Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA'15), IEEE, pp.28-33, September 13-18, Bengaluru, India, 2015.
  • Sedat Akleylek, Özgür Dağdelen, Zaliha Yüce Tok, "On the Efficiency of Polynomial Multiplication for Lattice-Based Cryptography on GPUs using CUDA", International Conference on Cryptography and Information Security in Balkan (BalkanCryptSec 2015), Springer LNCS, September 3-4, Koper, Slovenia, 2015.
  • Sedat Akleylek, Zaliha Yüce Tok, "Efficient Arithmetic for Lattice-Based Cryptography on GPU Using the CUDA Platform", Proceedings of IEEE 22nd Signal Processing and Communications Applications Conference (SIU 2014), pp.854-857, 2014.
  • Sedat Akleylek, Ferruh Özbudak and Canan Özel, “Hermite Polynomial Representation for Finite Fields of Characteristic Three”, Proceedings of 5th International Information Security and Cryptology Conference (ISCTURKEY 2012), May 17-18, Ankara, Turkey.
  • Sedat Akleylek, Murat Cenk and Ferruh Özbudak, "Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity", 11th International Conference on Cryptology (INDOCRYPT 2010), G. Gong and K.C. Gupta (Eds.), LNCS 6498, pp.227-237, Springer, 2010.
  • Sedat Akleylek, Murat Cenk and Ferruh Özbudak, “Faster Montgomery Modular Multiplication without Pre-computational Phase For Some Classes of Finite Fields", Computer and Information Sciences, E. Gelenbe et.al (Eds.), LNEE vol.62, part.11, pp.405-408, Springer, 2010.
  • Sedat Akleylek, Murat Cenk and Ferruh Özbudak, "Modified Discrete Fourier Transform for Efficient Polynomial Multiplication", Proceedings of 4th International Information Security and Cryptology Conference (ISCTURKEY 2010), pp. 150-153, 2010, Ankara, Turkey.
  • Sedat Akleylek, Barış Bülent Kırlar  Ömer Sever, Zaliha Yüce, "Short Signature Scheme from Bilinear Pairings", Proceedings of Western European Workshop on Research in Cryptology (WEWoRC 2009), pp.57-61, Graz, Austria.
  • Sedat Akleylek, Melek D. Yücel, “Substitution Boxes of the Third Generation GSM and Advanced Encryption Standard Ciphers”, Information Security and Cryptology Conference, Ankara, pp.157-163, December 13-14, 2007.

Publications at Web of Science http://www.researcherid.com/rid/D-2090-2015
Ċ
Sedat Akleylek,
Feb 12, 2013, 1:15 AM
Ċ
Sedat Akleylek,
Feb 12, 2013, 1:15 AM
Comments