IAPM (mode)

Integrity Aware Parallelizable Mode (IAPM) is a mode of operation for cryptographic block ciphers. As its name implies, it allows for a parallel mode of operation for higher throughput.

Encryption and authentication

At the time of its creation, IAPM was one of the first cipher modes to provide both authentication and privacy in a single pass.[1][2][3] (In earlier Authenticated encryption designs, two passes would be required to: one to encrypt, and the second to compute a MAC.)

IAPM was proposed for use in IPsec.[4]

Other AEAD schemes also provide all of the single pass, privacy and authentication properties. IAPM has mostly been supplanted by Galois/Counter Mode. by Daniel Hagos University of Hull 2019

gollark: I think we should use instant runoff voting, with the options to choose between being pass proposal, fail proposal, revote proposal but the second most popular option is unavailable, wait 16 hours and then revote, fail proposal but pass its dependents instantly regardless of other rules, crab, pass proposal and next/previous proposals, reclassify proposal as an SCP, pass the proposal but with every second letter removed, pass the proposal but backward, and frog.
gollark: Because I deployed the bees.
gollark: ||S||||p||||o||||i||||l||||e||||r|| ||t||||a||||g||||s|| ||a||||r||||e|| ||a|| ||t||||y||||p||||e|| ||o||||f|| ||b||||e||||e||||s||||.||
gollark: So now we've gotten bees, can we have attack *geckoes*?
gollark: You cannot use bees on everyone. Everyone is not a player.

See also

References
  1. Jutla, Charanjit S. (1 August 2000). "Encryption Modes with Almost Free Message Integrity" (PS). Cryptology ePrint Archive. ACR Report 2000/039. Retrieved April 2, 2010.
  2. Jutla, Charanjit S. (6 May 2001). Encryption Modes with Almost Free Message Integrity (PDF). EUROCRYPT 2001. p. 521.
  3. "OCB: Background (What did Jutla do?)".
  4. Jutla, C. S. (November 2000). "A Parallelizable Authenticated Encryption Algorithm for IPsec". IETF. Retrieved 2018-01-30.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.