Paper 2015/1003

Results on polynomial interpolation with mixed modular operations and unknown moduli

Oscar Garcia-Morchon, Ronald Rietman, 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.

Metadata
Available format(s)
PDF
Publication info
Preprint. MINOR revision.
Keywords
key predistribution
Contact author(s)
ludo tolhuizen @ philips com
History
2015-10-16: received
Short URL
https://ia.cr/2015/1003
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/1003,
      author = {Oscar Garcia-Morchon and Ronald Rietman and Igor Shparlinski and Ludo Tolhuizen},
      title = {Results on polynomial interpolation with mixed modular operations and unknown moduli},
      howpublished = {Cryptology ePrint Archive, Paper 2015/1003},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/1003}},
      url = {https://eprint.iacr.org/2015/1003}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.