<--- Back to Details
First PageDocument Content
Finite fields / Stream ciphers / CBC-MAC / Block cipher / CMAC / Classical cipher / Keystream / Cryptographic hash function / Symmetric-key algorithm / Cryptography / Message authentication codes / Block cipher modes of operation
Date: 2012-12-11 11:12:53
Finite fields
Stream ciphers
CBC-MAC
Block cipher
CMAC
Classical cipher
Keystream
Cryptographic hash function
Symmetric-key algorithm
Cryptography
Message authentication codes
Block cipher modes of operation

The Weakness of Integrity Protection for LTE Teng Wu and Guang Gong Department of Electrical and Computer Engineering University of Waterloo Waterloo, ON N2L 3G1, Canada {teng.wu, ggong}@uwaterloo.ca

Add to Reading List

Source URL: eprint.iacr.org

Download Document from Source Website

File Size: 352,45 KB

Share Document on Facebook

Similar Documents

Appears in Fast Software Encryption(FSE 2004), Lecture Notes in Computer Science, Vol. ????, Springer-Verlag. This is the full version. Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for P

Appears in Fast Software Encryption(FSE 2004), Lecture Notes in Computer Science, Vol. ????, Springer-Verlag. This is the full version. Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for P

DocID: 1rEjw - View Document

POIsketch: Semantic Place Labeling over User Activity Streams 1 Dingqi Yang1 , Bin Li2 , Philippe Cudr´e-Mauroux1 eXascale Infolab, University of Fribourg, 1700 Fribourg, Switzerland 2

POIsketch: Semantic Place Labeling over User Activity Streams 1 Dingqi Yang1 , Bin Li2 , Philippe Cudr´e-Mauroux1 eXascale Infolab, University of Fribourg, 1700 Fribourg, Switzerland 2

DocID: 1roz3 - View Document

The Politics of Cryptography: Bitcoin and The Ordering Machines

The Politics of Cryptography: Bitcoin and The Ordering Machines

DocID: 1rmtA - View Document

Algorithms and Data Structures Winter TermExercises for UnitLet U = {0, 1, . . . , K − 1}, let p ≥ K be a prime number, and let 0 < t < K. For 0 ≤ a, b < p define

Algorithms and Data Structures Winter TermExercises for UnitLet U = {0, 1, . . . , K − 1}, let p ≥ K be a prime number, and let 0 < t < K. For 0 ≤ a, b < p define

DocID: 1rivo - View Document