The PHOTON family of lightweight Hash functions

摘要: RFID security is currently one of the major challenges cryptography has to face, often solved by protocols assuming that an ontag hash function available. In this article we present PHOTON lightweight hash-function family, available in many different flavors and suitable for extremely constrained devices such as passive tags. Our proposal uses a sponge-like construction domain extension algorithm AES-like primitive internal unkeyed permutation. This allows us obtain most compact known so far (about 1120 GE 64-bit collision resistance security), reaching areas very close theoretical optimum (derived from minimal state memory size). Moreover, speed achieved also compares quite favorably its competitors. mostly due fact unlike previously proposed schemes, our simple analyze can derive tight bounds on number active Sboxes. kind usually not well suited ultra environments, but describe paper new method generating column mixing layer serial way, lowering drastically area required. Finally, slightly extend sponge framework order offer interesting trade-offs between preimage small messages, classical use-case hardware.