Weak-Key Distinguishers for AES

Date

2021-01-01

Author

Grassi, Lorenzo
Leander, Gregor
Rechberger, Christian
Tezcan, Cihangir
Wiemer, Friedrich

Metadata

Show full item record

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

Item Usage Stats

214
views

0
downloads

In this paper, we analyze the security of AES in the case in which the whitening key is a weak key.

URI

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

DOI

https://doi.org/10.1007/978-3-030-81652-0_6

Conference Name

27th International Conference on Selected Areas in Cryptography (SAC)

Collections

Graduate School of Informatics, Conference / Seminar

Suggestions

OpenMETU
Core

Weak-Key Distinguishers for AES Grassi, Lorenzo; Rechberger, Christian; Leander, Gregor; Tezcan, Cihangir; Wiemer, Friedrich (Springer, Cham, 2021-01-01) In this paper, we analyze the security of AES in the case in which the whitening key is a weak key.After a systematization of the classes of weak-keys of AES, we perform an extensive analysis of weak-key distinguishers (in the single-key setting) for AES instantiated with the original key-schedule and with the new key-schedule proposed at ToSC/FSE’18. As one of the main results, we show that (almost) all the secret-key distinguishers for round-reduced AES currently present in the literature can be set up fo...
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...
Design of Highly Distinguishable Letters for Inkjet-Printed Chipless RFID Tags DEMIR, MEHMET ALPER; MUTLU, FEZA; Ergül, Özgür Salih (2018-09-14) We consider chipless tags, which are based on Latin letters and also legible, for radio-frequency-identification (RFID) applications. Since letters using standard fonts have relatively weak and smooth responses with respect to frequency, special slits are designed to improve the distinguishability of letters without sacrificing their legibility. The designed set of letters can be used to generate words that are also suitable for RFID applications with their strong and unique scattering characteristics. The ...
Efficient Modular Exponentiation Methods for RSA Güner, Hatice; Cenk, Murat; Çalık, Çağdaş (2015-11-03) RSA is a commonly used asymmetric key cryptosystem that is used in encrypting and signing messages. The efficiency of the implementation is an important factor in effectively using the system. The RSA algorithm heavily depends on the modular exponentiation operation on large integers. A drawback of this system is that it becomes inefficient so quickly when the parameters are adjusted to increase security. This situation causes the operations to be performed with large numbers. Therefore, implementations req...
An efficient RSA public key encryption scheme Aboud, Sattar J.; AL-Fayoumi, Mohammad A.; Al-Fayoumi, Mustafa; Jabbar, Haidar S. (2008-04-09) In this paper, we propose an efficient RSA public key encryption scheme, which is an improved version of original RSA scheme. The proposed RSA encryption scheme is based on linear group over the ring of integer mod a composite modulus n which is the product of two distinct prime numbers. In the proposed scheme the original message and the encrypted message are h x h square matrices with entities in z(n) indicated via l(h,z(n)). Since the original RSA Scheme is a block cipher in which the original message an...

Citation Formats

L. Grassi, G. Leander, C. Rechberger, C. Tezcan, and F. Wiemer, “Weak-Key Distinguishers for AES,” ELECTR NETWORK, 2021, vol. 12804, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/94437.