On some cryptographic properties of Rijndael

Date

2001-01-01

Author

Kavut, S
Yucel, MD

Metadata

Show full item record

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

Item Usage Stats

195
views

0
downloads

We examine diffusion properties of Rijndael which has been selected by US National Institute of Standards and Technology (NIST) for the proposed Advanced Encryption Standard (AES). Since the s-box of Rijndael applies a nonlinear transformation operating on each byte of the intermediate cipher result independently, its characteristics have significant effects on the strength of the entire system. The characteristics of Rijndael's s-box are investigated for the criteria of avalanche, strict avalanche, bit independence, nonlinearity and XOR table distribution. We also evaluate the overall performance for different rounds of Rijndael, and compare it to Safer K-64, in terms of Avalanche Weight Distribution (AWD) criterion.

URI

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

Journal

INFORMATION ASSURANCE IN COMPUTER NETWORKS: METHODS, MODELS AND ARCHITECTURES FOR NETWORK SECURITY, PROCEEDINGS

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

On provable security of some public key encryption schemes Hanoymak, Turgut; Akyıldız, Ersan; Selçuk, Ali Aydın; Department of Cryptography (2012) In this thesis, we analyse the security criteria of some public key encryption schemes. In this respect, we present the notion of adversarial goals and adversarial capabilities. We give the definition of provably security by means of several games between the challenger and the adversary in some security models, namely the standard model and the random oracle model. We state the main differences between these two models and observe the advantage of the success probability of the adversary in breaking the cr...
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...
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 Effects of PA Nonlinearities for Hybrid Beamforming Based Wideband Massive MIMO Systems Salman, Murat Babek; Güvensen, Gökhan Muzaffer (2020-06-01) © 2020 IEEE.In this paper, we present a general framework for the investigation of the effects of power amplifier (PA) non-linearities on the hybrid beamforming based massive multiple-input multiple-output (MIMO) systems. In literature, much of the attention is devoted to phase shifters as the analog beamformer stage; however, in this work, a more comprehensive scenario, based on fully connected analog beamformer architecture, is considered. Firstly, out-of-band (OOB) radiation pattern is evaluated to inves...
Analysis of Block Recombination and Lazy Interpolation Methods and Their Applications to Saber Aksoy, Berkin; Cenk, Murat (2022-01-01) Since the beginning of the National Institute of Standards and Technology (NIST), The Post-Quantum Cryptog-raphy (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 Zq [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 Standa...

Citation Formats

S. Kavut and M. Yucel, “On some cryptographic properties of Rijndael,” INFORMATION ASSURANCE IN COMPUTER NETWORKS: METHODS, MODELS AND ARCHITECTURES FOR NETWORK SECURITY, PROCEEDINGS, pp. 300–311, 2001, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/66086.