搜索结果: 1-15 共查到“Blockcipher”相关记录23条 . 查询时间(0.149 秒)
SAEB: A Lightweight Blockcipher-Based AEAD Mode of Operation
Lightweight cryptography authenticated encryption with associated data blockciphe
2019/6/14
Lightweight cryptography in computationally constrained devices is actively studied. In contrast to advances of lightweight blockcipher in the last decade, lightweight mode of operation is seemingly n...
ZOCB and ZOTR: Tweakable Blockcipher Modes for Authenticated Encryption with Full Absorption
ZOCB ZOTR Authenticated encryption Associated data
2019/6/3
We define ZOCB and ZOTR for nonce-based authenticated encryption with associated data, and analyze their provable security. These schemes use a tweakable blockcipher (TBC) as the underlying primitive,...
Forking a Blockcipher for Authenticated Encryption of Very Short Messages
Authenticated encryption short messages lightweight cryptography
2018/11/8
Highly efficient encryption and authentication of short messages has been identified as an essential requirement for enabling security in constrained computation and communication scenarios such as th...
Blockcipher-based MACs: Beyond the Birthday Bound without Message Length
MAC, blockcipher, PRF
2017/9/13
We present blockcipher-based MACs (Message Authentication Codes) that have beyond the birthday bound security without message length in the sense of PRF (Pseudo-Random Function) security. Achieving su...
Optimal PRFs from Blockcipher Designs
PRP PRF EDMD
2017/8/30
Cryptographic modes built on top of a blockcipher usually rely on the assumption that this primitive behaves like a pseudorandom permutation (PRP). For many of these modes, including counter mode and ...
Blockcipher-based Authenticated Encryption: How Small Can We Go?
COFB AES authenticated encryption
2017/7/6
This paper presents a design of authenticated encryption (AE) focusing on minimizing the implementation size, i.e., hardware gates or working memory on software. The scheme is called COFB, for COmbine...
Universal Forgery with Birthday Paradox: Application to Blockcipher-based Message Authentication Codes and Authenticated Encryptions
Universal forgery birthday attack CBC-MAC
2017/7/6
We also propose another some generic universal forgery attacks using collision finding with structural input messages, by birthday paradox in the classic setting. Since our attacks are based on the co...
Insuperability of the Standard Versus Ideal Model Gap for Tweakable Blockcipher Security
Optimal security standard model ideal model
2017/5/31
Two types of tweakable blockciphers based on classical blockciphers have been presented over the last years: non-tweak-rekeyable and tweak-rekeyable, depending on whether the tweak may influence the k...
Salvaging Weak Security Bounds for Blockcipher-Based Constructions
blockcipher ideal cipher model tweakable blockcipher
2016/12/9
The concrete security bounds for some blockcipher-based constructions sometimes become worrisome or even vacuous; for example, when a light-weight blockcipher is used, when large amounts of data are p...
Equivalence between MAC and PRF for Blockcipher based Constructions
Affine Domain Extension Blockcipher
2014/3/10
In FSE 2010, Nandi proved a sufficient condition of pseudo random function (PRF) for affine domain extensions (ADE), wide class of block cipher based domain extensions. This sufficient condition is sa...
We advocate schemes based on fixed-key AES as the best route to highly efficient circuit-garbling. We provide such schemes making only one AES call per garbled-gate evaluation. On the theoretical side...
Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions
Hash function Blockcipher
2014/3/12
Preneel et al.~(Crypto 1993) assessed 64 possible ways to construct a compression function out of a blockcipher. They conjectured that 12 out of these 64 so-called PGV constructions achieve optimal se...
Attacks On a Double Length Blockcipher-based Hash Proposal
secret-key cryptography / Blockcipher-based hash functions
2012/3/28
In this paper we attack a $2n$-bit double length hash function proposed by Lee et al. This proposal is a blockcipher-based hash function with hash rate $2/3$. The designers claimed that it could achie...
Attacks On a Double Length Blockcipher-based Hash Proposal
secret-key cryptography / Blockcipher-based hash functions
2011/6/8
In this paper we attack a $2n$-bit double length hash function proposed by Lee et al. This proposal is a blockcipher-based hash function with hash rate $2/3$. The designers claimed that it could achie...
More Insights on Blockcipher-Based Hash Functions
Blockcipher-Based Hash Functions SBL DBL
2010/12/22
In this paper we give more insights on the security of blockcipher-based hash functions. We give a very simple criterion to build a secure large class of Single-Block-Length (SBL) or double call Doubl...