Results 21 to 30 of about 1,017,696 (185)
1, 2, 3, Fork: Counter Mode Variants based on a Generalized Forkcipher
IACR Transactions on Symmetric Cryptology, 2021 A multi-forkcipher (MFC) is a generalization of the forkcipher (FC) primitive introduced by Andreeva et al. at ASIACRYPT’19. An MFC is a tweakable cipher that computes s output blocks for a single input block, with s arbitrary but fixed.
Elena Andreeva +3 more
doaj +1 more source
Duel of the Titans: The Romulus and Remus Families of Lightweight AEAD Algorithms
IACR Transactions on Symmetric Cryptology, 2020 In this article, we propose two new families of very lightweight and efficient authenticated encryption with associated data (AEAD) modes, Romulus and Remus, that provide security beyond the birthday bound with respect to the block-length n.
Tetsu Iwata +3 more
doaj +1 more source
Automated design of a lightweight block cipher with Genetic Programming [PDF]
, 2008 In this paper, we present a general framework for the automated design of cryptographic block ciphers by using Genetic Programming. We evolve highly nonlinear and extremely efficient functions that can be used as core components of any cryptographic ...
Hernandez-Castro, Julio C. +3 more
core +1 more source
Forking Tweakable Even-Mansour Ciphers
IACR Transactions on Symmetric Cryptology, 2020 A forkcipher is a keyed, tweakable function mapping an n-bit input to a 2nbit output, which is equivalent to concatenating two outputs from two permutations.
Hwigyeom Kim +2 more
doaj +3 more sources
Weak Tweak-Keys for the CRAFT Block Cipher
IACR Transactions on Symmetric Cryptology, 2022 CRAFT is a lightweight tweakable Substitution-Permutation-Network (SPN) block cipher optimized for efficient protection of its implementations against Differential Fault Analysis (DFA) attacks.
Gregor Leander, Shahram Rasoolzadeh
doaj +1 more source
IET Networks, EarlyView., 2023 We utilise a metaheuristic optimisation method, inspired by nature, called the Lévy‐flight firefly algorithm (LFA), to tackle the power regulation and user grouping in the NOMA systems. Abstract The non‐orthogonal multiple access strategies have shown promise to boost fifth generation and sixth generation wireless networks' spectral efficiency and ...
Zaid Albataineh +4 more
wiley +1 more source
Tweakable HCTR: A BBB Secure Tweakable Enciphering Scheme [PDF]
, 2018 \textsf{HCTR}, proposed by Wang et al., is one of the most efficient candidates of tweakable enciphering schemes that turns an $n$-bit block cipher into a variable input length tweakable block cipher. Wang et al.
Avijit Dutta, Mridul Nandi
core +2 more sources
Improved Rectangle Attacks on SKINNY and CRAFT
IACR Transactions on Symmetric Cryptology, 2021 The boomerang and rectangle attacks are adaptions of differential cryptanalysis that regard the target cipher E as a composition of two sub-ciphers, i.e., E = E1 ∘ E0, to construct a distinguisher for E with probability p2q2 by concatenating two short ...
Hosein Hadipour +2 more
doaj +1 more source
Finding efficient distinguishers for cryptographic mappings, with an application to the block cipher TEA [PDF]
, 2003 Congress on Evolutionary Computation. 8-12 December 2003A simple way of creating new and efficient distinguishers for cryptographic primitives such as block ciphers or hash functions is introduced. This technique is then successfully applied over reduced
Pedro Isasi +4 more
core +1 more source
Re-Keying Scheme Revisited: Security Model and Instantiations
Applied Sciences, 2019 The re-keying scheme is a variant of the symmetric encryption scheme where a sender (respectively, receiver) encrypts (respectively, decrypts) plaintext with a temporal session key derived from a master secret key and publicly-shared randomness.
Yuichi Komano, Shoichi Hirose
doaj +1 more source