Cryptology ePrint Archive: Report 2015/1003

Results on polynomial interpolation with mixed modular operations and unknown moduli

Oscar Garcia-Morchon and Ronald Rietman and Igor Shparlinski and Ludo Tolhuizen

Abstract: Motivated by a recently introduced HIMMO key predistribution scheme, we investigate the limits of various attacks on the polynomial interpolation problem with mixedmodular operations and hidden moduli. We firstly review the classical attack and consider itin a quantum-setting. Then, we introduce new techniques for finding out the secret moduli and consider quantum speed-ups.

Category / Keywords: key predistribution

Date: received 14 Oct 2015, last revised 16 Oct 2015

Contact author: ludo tolhuizen at philips com

Available format(s): PDF | BibTeX Citation

Version: 20151016:153523 (All versions of this report)

Short URL: ia.cr/2015/1003

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]