APE: Authenticated Permutation-Based Encryption for Lightweight Cryptography

摘要: The domain of lightweight cryptography focuses on cryptographic algorithms for extremely constrained devices. It is very costly to avoid nonce reuse in such environments, because this requires either a hardware source randomness, or non-volatile memory store counter. At the same time, lot schemes actually require assumption their security. In paper, we propose APE as first permutation-based authenticated encryption scheme that resistant against misuse. We formally prove secure, based security underlying permutation. To decrypt, processes ciphertext blocks reverse order, and uses inverse permutation calls. therefore both efficient forward instantiate with permutations three recent hash function designs: Quark, Photon, Spongent. For any these permutations, an implementation sup- ports decryption less than 1.9 kGE 2.8 80-bit 128-bit levels, respectively.