Results 11 to 20 of about 44,378 (278)
Journal of Cryptology, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans Dobbertin
openalex +3 more sources
Cryptanalysis of LowMC instances using single plaintext/ciphertext pair
IACR Transactions on Symmetric Cryptology, 2020 Arguably one of the main applications of the LowMC family ciphers is in the post-quantum signature scheme PICNIC. Although LowMC family ciphers have been studied from a cryptanalytic point of view before, none of these studies were directly concerned ...
Subhadeep Banik +3 more
doaj +2 more sources
IACR Transactions on Symmetric Cryptology, 2020 The forkcipher framework was designed in 2018 by Andreeva et al. for authenticated encryption of short messages. Two dedicated ciphers were proposed in this framework: ForkAES based on the AES (and its tweakable variant Kiasu-BC), and ForkSkinny based on Skinny.
Bariant, Augustin +2 more
openaire +6 more sources
Cryptanalysis of Safer++ [PDF]
, 2003 This paper presents several multiset and boomerang attacks on Safer++ up to 5.5 out of its 7 rounds. These are the best known attacks for this cipher and significantly improve the previously known results. The attacks in the paper are practical up to 4 rounds.
Alex Biryukov +2 more
openalex +3 more sources
Cryptanalysis of ARMADILLO2 [PDF]
, 2011 ARMADILLO2 is the recommended variant of a multi-purpose cryptographic primitive dedicated to hardware which has been proposed by Badel et al. in [1]. In this paper we propose a meet-in-the-middle technique that allows us to invert the ARMADILLO2 function.
Abdelraheem, Mohamed Ahmed +4 more
openaire +4 more sources
IACR Transactions on Symmetric Cryptology, 2017 GOST 28147 is a 256-bit key 64-bit block cipher developed by the USSR, later adopted by the Russian government as a national standard. In 2010, GOST was suggested to be included in ISO/IEC 18033-3, but was rejected due to weaknesses found in its key schedule. In 2015, a new version of GOST was suggested with the purpose of mitigating such attacks.
Ashur, Tomer +2 more
openaire +5 more sources
Rad Hrvatske akademije znanosti i umjetnosti Matematičke znanosti, 2021 ITRU cryptosystem is a public key cryptosystem and one of the known variants of NTRU cryptosystem. Instead of working in a truncated polynomial ring, ITRU cryptosystem is based on the ring of integers. The authors claimed that ITRU has better features comparing to the classical NTRU, such as having a simple parameter selection algorithm, invertibility,
Hashim, Hayder Raheem +2 more
openaire +3 more sources
, 2018 MORUS is a high-performance authenticated encryption algorithm submitted to the CAESAR competition, and recently selected as a finalist. There are three versions of MORUS: MORUS-640 with a 128-bit key, and MORUS-1280 with 128-bit or 256-bit keys. For all versions the security claim for confidentiality matches the key size. In this paper, we analyze the
Ashur, Tomer +7 more
openaire +4 more sources
Intelligent Techniques in Cryptanalysis: Review and Future Directions
UHD Journal of Science and Technology, 2017 In this paper, we consider the use of some intelligent techniques such as artificial neural networks (ANNs) and genetic algorithms (GAs) in solving various cryptanalysis problems.
Sufyan T. Al-Janabi +2 more
doaj +1 more source
Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems [PDF]
Logical Methods in Computer Science, 2020 In the present paper, we propose a technology for translating algorithmic descriptions of discrete functions to SAT. The proposed technology is aimed at applications in algebraic cryptanalysis. We describe how cryptanalysis problems are reduced to SAT in
Alexander Semenov +4 more
doaj +1 more source