Description
RFID tags are tiny computational devices with no internal source of power, which are likely to be deployed in a large number of applications in the next few years. In this talk I will describe several light weight security algorithms which were designed specifically for such devices, and in particular a new hash function called SQUASH which is provably at least as one-way as the Rabin scheme. It can be implemented with a very small number of gates on RFID tags, and it is extremely fast on larger processors with arbitrary word sizes.
Next sessions
-
Polytopes in the Fiat-Shamir with Aborts Paradigm
Speaker : Hugo Beguinet - ENS Paris / Thales
The Fiat-Shamir with Aborts paradigm (FSwA) uses rejection sampling to remove a secret’s dependency on a given source distribution. Recent results revealed that unlike the uniform distribution in the hypercube, both the continuous Gaussian and the uniform distribution within the hypersphere minimise the rejection rate and the size of the proof of knowledge. However, in practice both these[…]-
Cryptography
-
Asymmetric primitive
-
Mode and protocol
-
-
Post-quantum Group-based Cryptography
Speaker : Delaram Kahrobaei - The City University of New York