搜索结果: 1-15 共查到“军事学 blockcipher based”相关记录16条 . 查询时间(0.109 秒)
SAEB: A Lightweight Blockcipher-Based AEAD Mode of Operation
Lightweight cryptography authenticated encryption with associated data blockciphe
font style='font-size:12px;'>
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...
Blockcipher-based MACs: Beyond the Birthday Bound without Message Length
MAC, blockcipher, PRF
font style='font-size:12px;'>
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...
Blockcipher-based Authenticated Encryption: How Small Can We Go?
COFB AES authenticated encryption
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
Salvaging Weak Security Bounds for Blockcipher-Based Constructions
blockcipher ideal cipher model tweakable blockcipher
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions
Hash function Blockcipher
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
Blockcipher-based Double-length Hash Functions for Pseudorandom Oracles
Double-length hash function pseudorandom oracle ideal cipher model
font style='font-size:12px;'>
2010/11/10
The notion of PRO (pseudorandom oracle) is an important security notion of hash functions because a PRO hash function inherits all properties of a random oracle up to the PRO bound (e.g., security aga...
Preimage Resistance Beyond the Birthday Barrier -- The Case of Blockcipher Based Hashing
Hash Function Preimage Resistance Block Cipher Beyond Birthday Bound Foundations
font style='font-size:12px;'>
2010/10/14
We provide the first preimage resistance bounds for block cipher based double length, double call hash functions that go \emph{beyond} the birthday bound. More precisely, we consider hash functions us...
A Unified Method for Improving PRF Bounds for a Class of Blockcipher based MACs
affine domain extension PRF random permutation
font style='font-size:12px;'>
2010/1/18
This paper provides a unified framework for improving PRF
(pseudorandom function) advantages of several popular MACs (mes-
sage authentication codes) based on a blockcipher modeled as RP (ran-
dom ...
Blockcipher Based Hashing Revisited
Blockcipher Hashing Revisited hash functions
font style='font-size:12px;'>
2009/6/3
We revisit the rate-1 blockcipher based hash functions as first studied by Preneel, Govaerts and
Vandewalle (Crypto’93) and later extensively analysed by Black, Rogaway and Shrimpton (Crypto’02). We
...
The Ideal-Cipher Model, Revisited:An Uninstantiable Blockcipher-Based Hash Function
Ideal-Cipher Model Information-Theoretic Cryptography Random-Oracle Model
font style='font-size:12px;'>
2009/2/17
The Ideal-Cipher Model of a blockcipher is a well-known and widely-used model
dating back to Shannon [24] and has seen frequent use in proving the security of various
cryptographic objects and proto...