Abstract
Existing tweakable blockcipher (TBC)-based message authentication codes (MACs), in order to achieve full \(b\)-bit pseudo-random function (PRF) security, require a TBC with \(t\)-bit tweak and \(b\)-bit input block spaces such that \(b\le t\). An open problem from the previous works is to design a TBC-based MAC achieving the \(b\)-bit security even when \(b> t\). We present \(\mathsf {PMAC3}\), a TBC-based MAC achieving the \(b\)-bit security as long as \(b/2 \le t\).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
