Results 31 to 40 of about 94,502 (210)
LM-DAE: Low-Memory Deterministic Authenticated Encryption for 128-bit Security
IACR Transactions on Symmetric Cryptology, 2020 This paper proposes a new lightweight deterministic authenticated encryption (DAE) scheme providing 128-bit security. Lightweight DAE schemes are practically important because resource-restricted devices sometimes cannot afford to manage a nonce properly.
Yusuke Naito +2 more
doaj +3 more sources
On the Composition of Single-Keyed Tweakable Even-Mansour for Achieving BBB Security
IACR Transactions on Symmetric Cryptology, 2020 Observing the growing popularity of random permutation (RP)-based designs (e.g, Sponge), Bart Mennink in CRYPTO 2019 has initiated an interesting research in the direction of RP-based pseudorandom functions (PRFs).
Avik Chakraborti +3 more
doaj +1 more source
, 2015 This paper is a tribute to José Meseguer, from the rest of us in the Maude team, reviewing the past, the present, and the future of the language and system with which we have been working for around two decades under his leadership.
Clavel, Manuel +6 more
core +1 more source
Improved Security Bound of (E/D)WCDM
IACR Transactions on Symmetric Cryptology, 2021 In CRYPTO’16, Cogliati and Seurin proposed a block cipher based nonce based MAC, called Encrypted Wegman-Carter with Davies-Meyer (EWCDM), that gives 2n/3 bit MAC security in the nonce respecting setting and n/2 bit security in the nonce misuse setting ...
Nilanjan Datta +2 more
doaj +1 more source
Single Key Variant of PMAC_Plus
IACR Transactions on Symmetric Cryptology, 2017 At CRYPTO 2011, Yasuda proposed the PMAC_Plus message authentication code based on an n-bit block cipher. Its design principle inherits the well known PMAC parallel network with a low additional cost.
Nilanjan Datta +4 more
doaj +1 more source
Efficient Side-Channel Secure Message Authentication with Better Bounds
IACR Transactions on Symmetric Cryptology, 2020 We investigate constructing message authentication schemes from symmetric cryptographic primitives, with the goal of achieving security when most intermediate values during tag computation and verification are leaked (i.e., mode-level leakage-resilience).
Chun Guo +3 more
doaj +1 more source
IMPROVING SMART GRID SECURITY USING MERKLE TREES [PDF]
, 2014 —Presently nations worldwide are starting to convert their aging electrical power infrastructures into modern, dynamic power grids. Smart Grid offers much in the way of efficiencies and robustness to the electrical power grid, however its heavy reliance ...
Muñoz, Melesio Calderón
core +2 more sources
Lightweight Authenticated Encryption Mode of Operation for Tweakable Block Ciphers
Transactions on Cryptographic Hardware and Embedded Systems, 2019 The use of a small block length is a common strategy when designing lightweight (tweakable) block ciphers (TBCs), and several 64-bit primitives have been proposed.
Yusuke Naito, Takeshi Sugawara
doaj +1 more source
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
IACR Transactions on Symmetric Cryptology, 2017 CAESAR has caused a heated discussion regarding the merits of one-pass encryption and online ciphers. The latter is a keyed, length preserving function which outputs ciphertext blocks as soon as the respective plaintext block is available as input.
Elena Andreeva +5 more
doaj +1 more source