IAPM (mode): Difference between revisions

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] (In earlier Authenticated encryption designs, two passes would be required to: one to encrypt, and the second to compute a MAC.

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

Notes

^ Charanjit S. Jutla. "Encryption Modes with Almost Free Message Integrity".
^ "OCB: Background (What did Jutla do?)".

References

Jutla, C. S. (November 2000). "A Parallelizable Authenticated Encryption Algorithm for IPsec". IETF. Retrieved 2018-01-30.
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.
Jutla, Charanjit S. (6 May 2001). Encryption Modes with Almost Free Message Integrity (PDF). EUROCRYPT 2001. p. 521. {{cite conference}}: External link in |conferenceurl= (help); Unknown parameter |conferenceurl= ignored (|conference-url= suggested) (help)

External links

v t e Block ciphers (security summary)
Common algorithms	AES Blowfish DES (internal mechanics, Triple DES) Serpent SM4 Twofish
Less common algorithms	ARIA Camellia CAST-128 GOST IDEA LEA RC5 RC6 SEED Skipjack TEA XTEA
Other algorithms	3-Way Adiantum Akelarre Anubis Ascon BaseKing BassOmatic BATON BEAR and LION CAST-256 Chiasmus CIKS-1 CIPHERUNICORN-A CIPHERUNICORN-E CLEFIA CMEA Cobra COCONUT98 Crab Cryptomeria/C2 CRYPTON CS-Cipher DEAL DES-X DFC E2 FEAL FEA-M FROG G-DES Grand Cru Hasty Pudding cipher Hierocrypt ICE IDEA NXT Intel Cascade Cipher Iraqi Kalyna KASUMI KeeLoq KHAZAD Khufu and Khafre KN-Cipher Kuznyechik Ladder-DES LOKI (97, 89/91) Lucifer M6 M8 MacGuffin Madryga MAGENTA MARS Mercy MESH MISTY1 MMB MULTI2 MultiSwap New Data Seal NewDES Nimbus NOEKEON NUSH PRESENT Prince Q RC2 REDOC Red Pike S-1 SAFER SAVILLE SC2000 SHACAL SHARK Simon Speck Spectr-H64 Square SXAL/MBAL Threefish Treyfer UES xmx XXTEA Zodiac
Design	Feistel network Key schedule Lai–Massey scheme Product cipher S-box P-box SPN Confusion and diffusion Round Avalanche effect Block size Key size Key whitening (Whitening transformation)
Attack (cryptanalysis)	Brute-force (EFF DES cracker) MITM Biclique attack 3-subset MITM attack Linear (Piling-up lemma) Differential Impossible Truncated Higher-order Differential-linear Distinguishing (Known-key) Integral/Square Boomerang Mod n Related-key Slide Rotational Side-channel Timing Power-monitoring Electromagnetic Acoustic Differential-fault XSL Interpolation Partitioning Rubber-hose Black-bag Davies Rebound Weak key Tau Chi-square Time/memory/data tradeoff
Standardization	AES process CRYPTREC NESSIE NSA Suite B CNSA
Utilization	Initialization vector Mode of operation Padding

v t e Cryptographic hash functions and message authentication codes
List Comparison Known attacks
Common functions	MD5 (compromised) SHA-1 (compromised) SHA-2 SHA-3 BLAKE2
SHA-3 finalists	BLAKE Grøstl JH Skein Keccak (winner)
Other functions	BLAKE3 CubeHash ECOH FSB Fugue GOST HAS-160 HAVAL Kupyna LSH Lane MASH-1 MASH-2 MD2 MD4 MD6 MDC-2 N-hash RIPEMD RadioGatún SIMD SM3 SWIFFT Shabal Snefru Streebog Tiger VSH Whirlpool
Password hashing/ key stretching functions	Argon2 Balloon bcrypt Catena crypt LM hash Lyra2 Makwa PBKDF2 scrypt yescrypt
General purpose key derivation functions	HKDF KDF1/KDF2
MAC functions	CBC-MAC DAA GMAC HMAC NMAC OMAC/CMAC PMAC Poly1305 SipHash UMAC VMAC
Authenticated encryption modes	CCM ChaCha20-Poly1305 CWC EAX GCM IAPM OCB
Attacks	Collision attack Preimage attack Birthday attack Brute-force attack Rainbow table Side-channel attack Length extension attack
Design	Avalanche effect Hash collision Merkle–Damgård construction Sponge function HAIFA construction
Standardization	CAESAR Competition CRYPTREC NESSIE NIST hash function competition Password Hashing Competition NSA Suite B CNSA
Utilization	Hash-based cryptography Merkle tree Message authentication Proof of work Salt Pepper

v t e Cryptography
General	History of cryptography Outline of cryptography Classical cipher Cryptographic protocol Authentication protocol Cryptographic primitive Cryptanalysis Cryptocurrency Cryptosystem Cryptographic nonce Cryptovirology Hash function Cryptographic hash function Key derivation function Secure Hash Algorithms Digital signature Kleptography Key (cryptography) Key exchange Key generator Key schedule Key stretching Keygen Machines Cryptojacking malware Ransomware Random number generation Cryptographically secure pseudorandom number generator (CSPRNG) Pseudorandom noise (PRN) Secure channel Insecure channel Subliminal channel Encryption Decryption End-to-end encryption Harvest now, decrypt later Information-theoretic security Plaintext Codetext Ciphertext Shared secret Trapdoor function Trusted timestamping Key-based routing Onion routing Garlic routing Kademlia Mix network
Mathematics	Cryptographic hash function Block cipher Stream cipher Symmetric-key algorithm Authenticated encryption Public-key cryptography Quantum key distribution Quantum cryptography Post-quantum cryptography Message authentication code Random numbers Steganography
Category

@@ Line 4: / Line 4: @@
 ==Encryption and authentication==
-IAPM was the first cipher mode created to provide both [[authentication]] and [[privacy]] in a single pass.{{Citation needed|date=January 2011}}  Previously, two passes would be required to achieve both benefits: for example the first pass using DES in CBC mode and the second pass authenticating with HMAC-MD5.  IAPM allows for a single pass achieving both authentication and privacy.
+At the time of its creation, IAPM was one of the first cipher modes to provide both [[authentication]] and [[privacy]] in a single pass.<ref>{{cite web |author=Charanjit S. Jutla |title=Encryption Modes with Almost Free Message Integrity |url=https://eprint.iacr.org/2000/039}}</ref><ref>{{cite web |title=OCB: Background (What did Jutla do?) |url=http://web.cs.ucdavis.edu/~rogaway/ocb/ocb-faq.htm#jutla}}</ref>  (In earlier [[Authenticated encryption]] designs, two passes would be required to: one to encrypt, and the second to compute a [[Message authentication code|MAC]].
-[[OCB mode]] also provides authentication and privacy in a single pass, but both have been supplanted by [[Galois/Counter Mode]].
+Other [[Authenticated encryption|AEAD]] schemes also provide all of the single pass, privacy and authentication properties. IAPM has mostly been supplanted by [[Galois/Counter Mode]].
-IAPM mode was designed by [[Charanjit Jutla]].    The OCB inventor, [[Phillip Rogaway]], gives credit to Jutla for inventing the single-pass technique.<ref>[http://www.cs.ucdavis.edu/~rogaway/ocb/ocb-faq.htm#jutla Rogaway's OCB FAQ crediting Jutla]</ref>
 ==See also==

Revision as of 19:48, 25 August 2018

Encryption and authentication

See also

Notes

References

External links