Our scheme, the HIMMO algorithm, relies on two design concepts: Hiding Information and Mixing Modular Operations. Hiding information is related to the Noisy Interpolation Problem; the Mixing Modular Operations problem seems to be a new hard problem. We describe our scheme, the security of its underlying design principles and give order of magnitude estimations for secure configuration parameters. For these parameters, we show that our prototypic implementation of HIMMO on the 8-bit CPU ATmega128L can generate 128-bit keys in less than 7 ms based on an algorithm fitting in 428 B and with secret keying materials of size 656 B.
Category / Keywords: ID-based symmetric-key generation, collusion resistance, mixing modular operations, noisy interpolation problem. Date: received 1 Nov 2012, last revised 1 Jul 2013, withdrawn 22 Oct 2014 Contact author: oscar garcia at philips com Available format(s): (-- withdrawn --) Note: A more recent version has been uploaded: https://eprint.iacr.org/2014/698 Version: 20141022:171032 (All versions of this report) Short URL: ia.cr/2012/618 Discussion forum: Show discussion | Start new discussion