IEICE TRANSACTIONS on Fundamentals
A Parallelizable PRF-Based MAC Algorithm: Well beyond the Birthday Bound
Summary :
In this note we suggest a new parallelizable mode of operation for message authentication codes (MACs). The new MAC algorithm iterates a pseudo-random function (PRF) FK:{0,1}m → {0,1}n, where K is a key and m,n are positive integers such that m ≥ 2n. The new construction is an improvement over a sequential MAC algorithm presented at FSE2008, solving positively an open problem posed in the paper – the new mode is capable of fully parallel execution while achieving rate-1 efficiency and “full n-bit” security. Interestingly enough, PMAC-like parallel structure, rather than CBC-like serial iteration, has beneficial side effects on security. That is, the new construction is provided with a more straightforward security proof and with an even better (“
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E96-A No.1 pp.237-241
- Publication Date
- 2013/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E96.A.237
- Type of Manuscript
- Special Section LETTER (Special Section on Cryptography and Information Security)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kan YASUDA, "A Parallelizable PRF-Based MAC Algorithm: Well beyond the Birthday Bound" in IEICE TRANSACTIONS on Fundamentals,
vol. E96-A, no. 1, pp. 237-241, January 2013, doi: 10.1587/transfun.E96.A.237.
Abstract: In this note we suggest a new parallelizable mode of operation for message authentication codes (MACs). The new MAC algorithm iterates a pseudo-random function (PRF) FK:{0,1}m → {0,1}n, where K is a key and m,n are positive integers such that m ≥ 2n. The new construction is an improvement over a sequential MAC algorithm presented at FSE2008, solving positively an open problem posed in the paper – the new mode is capable of fully parallel execution while achieving rate-1 efficiency and “full n-bit” security. Interestingly enough, PMAC-like parallel structure, rather than CBC-like serial iteration, has beneficial side effects on security. That is, the new construction is provided with a more straightforward security proof and with an even better (“
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E96.A.237/_p
Copy
@ARTICLE{e96-a_1_237,
author={Kan YASUDA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Parallelizable PRF-Based MAC Algorithm: Well beyond the Birthday Bound},
year={2013},
volume={E96-A},
number={1},
pages={237-241},
abstract={In this note we suggest a new parallelizable mode of operation for message authentication codes (MACs). The new MAC algorithm iterates a pseudo-random function (PRF) FK:{0,1}m → {0,1}n, where K is a key and m,n are positive integers such that m ≥ 2n. The new construction is an improvement over a sequential MAC algorithm presented at FSE2008, solving positively an open problem posed in the paper – the new mode is capable of fully parallel execution while achieving rate-1 efficiency and “full n-bit” security. Interestingly enough, PMAC-like parallel structure, rather than CBC-like serial iteration, has beneficial side effects on security. That is, the new construction is provided with a more straightforward security proof and with an even better (“
keywords={},
doi={10.1587/transfun.E96.A.237},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - A Parallelizable PRF-Based MAC Algorithm: Well beyond the Birthday Bound
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 237
EP - 241
AU - Kan YASUDA
PY - 2013
DO - 10.1587/transfun.E96.A.237
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E96-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2013
AB - In this note we suggest a new parallelizable mode of operation for message authentication codes (MACs). The new MAC algorithm iterates a pseudo-random function (PRF) FK:{0,1}m → {0,1}n, where K is a key and m,n are positive integers such that m ≥ 2n. The new construction is an improvement over a sequential MAC algorithm presented at FSE2008, solving positively an open problem posed in the paper – the new mode is capable of fully parallel execution while achieving rate-1 efficiency and “full n-bit” security. Interestingly enough, PMAC-like parallel structure, rather than CBC-like serial iteration, has beneficial side effects on security. That is, the new construction is provided with a more straightforward security proof and with an even better (“
ER -
English
