Algebraic And Combinatorial Methods İn Finiter Fields, Coding Theory And Cryptography

Date

2011-12-31

Author

Özbudak, Ferruh

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

137
views

0
downloads

Kapsam: Bu projede, kombinatorik, cebirsel fonksiyonel cisimler ve sonlu cebirsel geometri teknikleri kullanarak kodlama teorisi, sonlu cisimler ve kriptografi üzerine yeni sonuçlar bulunması amaçlanmaktadır. Yöntem: Proje süresince konu ile ilgili en son gelişmeleri takip etmek, bu konuda çalışan diğer bilim adamları ile fikir alışverişi yapmak ve bulunan yeni sonuçları sunmak üzere uluslararası konferanslarda katılmak bu projenin yöntemi olarak özetlenebilir. Beklenilen Sonuç: Kombinatorigin kodlama teorisine ve kriptografiye uygulamalari uzerine yeni akademik makaleler yayınlanması planlanmakatadır. Ayrıca, proje ile birlikte araştırmacıların doktora tezleri de yürütülecektir/sonlandırılacaktır.Bu konuda ulaşılacak yeni gelişmeler ve sonuçlar akademik literaturde rahatlıkla yer edinebileceği gibi pratik kullanım alanları da bulabilir.

URI

https://hdl.handle.net/11511/61669

Collections

Graduate School of Applied Mathematics, Project and Design

Suggestions

OpenMETU
Core

Algebraic And Combinatorial Methods İn Finite Fields, Coding Theory And Cryptography Özbudak, Ferruh; Tutdere, Seher; Çalık, Çağdaş; Yayla, Oğuz; Muş, Köksal(2013-12-31) Bu projede, kombinatorik, cebirsel fonksiyonel cisimler ve sonlu cebirsel geometri teknikleri kullanarak kodlama teorisi, sonlu cisimler ve kriptografi üzerine çalışmalar yapılması amaçlanmaktadır. Bunların arasında BAP-07-05- 2011-002 nolu projemizde başlayan bazı çalışmalar da devam ettirileceği planlanmaktadır. Bu çalışmalarla ilgili olarak bazı techizat alımı ve bilgi/deneyim arttırılması, makale sunumu gibi gerekçelerle uluslararası konferanslarda katılınması bu projenin amaçlarıdır. Konferans veya de...
Artificial intelligence based dynamic mission planning with probabilistic roadmaps and Voronoi diagrams using predictive launch acceptability region approach Özdemir, Mustafa Raşit; Ertekin Bolelli, Şeyda; Department of Computer Engineering (2021-9-2) In this thesis, dynamic air-to-surface mission planning strategies based on probabilistic roadmaps and Voronoi diagrams using predictive launch acceptability region approach are proposed for opportunity targets in order to strengthen decision support capabilities of aircraft. Air-to-surface missions are planned in ground support systems and loaded to aircraft before the mission begins. This means that all the waypoints which should be followed during an air-to-surface mission are planned according to va...
Dynamic Modeling and Control of Underactuated Planar Bipedal Walking Sovukluk, Sait; Ankaralı, Mustafa Mert; Saranlı, Uluç; Department of Electrical and Electronics Engineering (2022-6-16) This study demonstrates an adaptive model predictive control method for input constrained control of underactuated bipedal walking with a predefined trajectory. Our approach aims to increase the trajectory tracking performance of the system and produce realistic and applicable responses while letting a certain amount of posture change around the predefined trajectory. To do so, we employ whole-body dynamics in our control structure, include weights for the unactuated joint inside the cost function, and defi...
Group representation theory and radar ambiguity functions Kama, Eren Berk; Kuzuoğlu, Mustafa; Department of Electrical and Electronics Engineering (2022-2) In this thesis, representations of Heisenberg group are applied to ambiguity functions and their properties are investigated in with an information theoretic perspective with applications in telecommunications and signal processing. Algebraic properties of ambiguity functions were investigated through application of representation theory. Novel approaches on phase space tiling are given and some existing methods for traditional ambiguity functions were extended to MIMO ambiguity functions. Irreducible repre...
Analyzes of Block Recombination and Lazy Interpolation Methods and Their Applications to Saber Aksoy, Berkin; Cenk, Murat; Department of Cryptography (2022-2-28) Since the beginning of the National Institute of Standards and Technology (NIST), The Post-Quantum Cryptography (PQC) Standardization Process, efficient implementations of lattice-based algorithms have been studied extensively. Lattice-based NIST PQC finalists use polynomial or matrix-vector multiplications on the ring with type {Z}_{q}[x] / f(x). For convenient ring types, Number Theoretic Transform (NTT) can be used to perform multiplications as done in Crystals-KYBER among the finalists of the NIST PQC S...

Citation Formats

F. Özbudak, “Algebraic And Combinatorial Methods İn Finiter Fields, Coding Theory And Cryptography,” 2011. Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/61669.