Results 1 to 10 of about 335,598 (166)
Revisiting structure graphs: Applications to CBC-MAC and EMAC
Journal of Mathematical Cryptology, 2016 In [2], Bellare, Pietrzak and Rogaway proved an O(ℓq2/2n)${O(\ell q^{2}/2^{n})}$ bound for the PRF (pseudorandom function) security of the CBC-MAC based on an n-bit random permutation Π, provided ...
Jha Ashwin, Nandi Mridul
doaj +6 more sources
New CBC-MAC Forgery Attacks [PDF]
Australasian Conference on Information Security and Privacy, 2001 This paper is concerned with a particular type of attack against CBC-MACs, namely forgery attacks, i.e. attacks which enable an unauthorised party to obtain a MAC on a data string. Existing forgery attacks against CBC-MACs are briefly reviewed, together with the effectiveness of various countermeasures.
Brincat, Karl, Mitchell, Chris J
semanticscholar +14 more sources
Performance Analysis of Block Chaining Message Authentication Code (CBC MAC) and its Variants
National College of Computer Studies Research Journal, 2021 The cryptographic algorithms employed in internet security must be able to handle packets which may vary in size over a large range. The majority of cryptography algorithms divide messages into large blocks to process them. due to this fact the messages must be prepared by padding the desired amount of zero bits to induce an integer number of blocks ...
Chhetra Bahadur Chhetri
semanticscholar +4 more sources
Decorrelation over infinite domains: The encrypted CBS-MAC case [PDF]
Communications in Information and Systems, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Serge Vaudenay
semanticscholar +4 more sources
IACR Cryptology ePrint Archive, 2003 In this paper, we present One-key CBC MAC (OMAC) and prove its security for arbitrary length messages. OMAC takes only one key, K (k bits) of a block cipher E. Previously, XCBC requires three keys, (k+2n) bits in total, and TMAC requires two keys, (k+n) bits in total, where n denotes the block length of E.
Tetsu Iwata, Kaoru Kurosawa
semanticscholar +3 more sources
Multicollision attack on CBC-MAC, EMAC, and XCBC-MAC of AES-128 algorithm [PDF]
Journal of Physics: Conference Series, 2017 A Message Authentication Codes (MAC) can be constructed based on a block cipher algorithm. CBC-MAC, EMAC, and XCBC-MAC constructions are some of MAC schemes that used in the hash function. In this paper, we do multicollision attack on CBC-MAC, EMAC, and XCBC-MAC construction which uses AES-128 block cipher algorithm as basic construction. The method of
Alfonso Brolin Sihite +1 more
semanticscholar +3 more sources
Annales UMCS, Informatica, 2011 In this paper we examine the influence of different types of encryption and authentication on the quality of transmitted data in the high-performance WSN based on Imote2. The performance has been tested in the wireless sensor network using Collection Tree Protocol.
Damian Rusinek, Bogdan Księżopolski
semanticscholar +4 more sources
On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit A New Construction [PDF]
Fast Software Encryption Workshop, 2002 In this paper, we study the security of randomized CBC-MACs and propose a new construction that resists birthday paradox attacks and provably reaches full security. The size of the MAC tags in this construction is optimal, i.e., exactly twice the size of the block cipher.
Éliane Jaulmes +2 more
semanticscholar +3 more sources
On the Security of CTR + CBC-MAC [PDF]
ACM Symposium on Applied Computing, 2003 We analyze the security of the CTR + CBC-MAC (CCM) encryption mode. This mode, proposed by Doug Whiting, Russ Housley, and Niels Ferguson, combines the CTR ("counter") encryption mode with CBC-MAC message authentication and is based on a block cipher such as AES.
J. Jonsson
semanticscholar +3 more sources
CBCR: CBC MAC with rotating transformations
Science China Information Sciences, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Liting +3 more
semanticscholar +4 more sources