Özet fonksiyonların güvenlik ölçütleri ve analiz metotları geliştirme ve uygulama projesi

Download
2010
Uyan, Erdener
Sulak, Fatih
Çakçak, Emrah
Bilgin, Begül
Çalık, Çağdaş
National Institute of Standards and Technology (NIST) has announced a hash function competition to define a new hash function standard (SHA-3), regarding the recent cryptanalysis efforts which showed that the existing hash functions are not secure. The main goals of this project are detecting the weaknesses of the proposed SHA-3 candidate algorithms, applying existing cryptanalysis methods to these algorithms, and developing new cryptanalysis methods. As a starting point, the fundamental building blocks of hash function algorithms and generic cryptanalysis methods are studied. Afterwards, the design rationale, security analysis and the performance results of the candidate algorithms are investigated. In the light of all the research done, the main cryptanalysis methods are applied to the chosen algorithms with improvements. The research results are to be submitted to several national and international conferences.

Suggestions

Özet fonksiyon algoritması geliştirme proje önerisi
Sulak, Fatih; Doğanaksoy, Ali; Varıcı, Kerem; Kocair, Çelebi; Atalay, Firuze(2008)
Recent years witnessed the continuous works on analysis of cryptographic hash functions which reveal that most of them are not as secure as claimed. Wang et al. presented the first full round collisions on MD4 and RIPEMD using a new attack technique on hash functions which is based on differential cryptanalysis. Then, this attack is further developed and used in the analysis of other famous and widely used hash functions. As a result of these studies, National Institute of Standards and Technology (NIST) an...
Design and analysis of hash functions
Koçak, Onur; Doğanaksoy, Ali; Department of Cryptography (2009)
Hash functions are cryptographic tools that are used in various applications like digital signature, message integrity checking, password storage and random number generation. These cryptographic primitives were, first, constructed using modular arithmetical operations which were popular at that time because of public key cryptography. Later, in 1989, Merkle and Damgard independently proposed an iterative construction method. This method was easy to implement and had a security proof. MD-4 was the first has...
On the efficiency of lattice-based cryptographic schemes on graphical processing unit
Yüce Tok, Zaliha; Akyıldız, Ersan; Akleylek, Sedat; Department of Cryptography (2016)
Lattice-based cryptography, a quantum-resistant public key alternative, has received a lot of attention due to the asymptotic efficiency. However, there is a bottleneck to get this advantage on practice: scheme-based arithmetic operations and platform-based implementations. In this thesis, we discuss computational aspects of lattice-based cryptographic schemes focused on NTRU and GLP in view of the time complexity on both CPUs and Graphical Processing Units (GPU). We focus on the optimization of polynomial ...
On the security of tiger hash function
Özen, Onur; Doğanaksoy, Ali; Department of Cryptography (2008)
Recent years have witnessed several real threats to the most widely used hash functions which are generally inspired from MD4, such as MD5, RIPEMD, SHA0 and SHA1. These extraordinary developments in cryptanalysis of hash functions brought the attention of the cryptology researchers to the alternative designs. Tiger is an important type of alternative hash functions and is proved to be secure so far as there is no known collision attack on the full (24 rounds) Tiger. It is designed by Biham and Anderson in 1...
A high-speed asic implementation of the RSA cryptosystem
Yeşil, Soner; Aşkar, Murat; Department of Electrical and Electronics Engineering (2003)
This thesis presents the ASIC implementation of the RSA algorithm, which is one of the most widely used Public Key Cryptosystems (PKC) in the world. In RSA Cryptosystem, modular exponentiation of large integers is used for both encryption and decryption processes. The security of the RSA increases as the number of the bits increase. However, as the numbers become larger (1024-bit or higher) the challenge is to provide architectures, which can be implemented in hardware, operate at high clock speeds, use a m...
Citation Formats
E. Uyan, F. Sulak, E. Çakçak, B. Bilgin, and Ç. Çalık, “Özet fonksiyonların güvenlik ölçütleri ve analiz metotları geliştirme ve uygulama projesi,” 2010. Accessed: 00, 2020. [Online]. Available: https://app.trdizin.gov.tr/publication/project/detail/TVRBNE1EazU.