%0 Conference Proceedings
%T The Polynomial Composition Problem in (ℤ/nℤ)[X]
%+ Thomson R&D, Security Competence Center
%+ École normale supérieure - Paris (ENS-PSL)
%+ Smart Consulting
%A Joye, Marc
%A Naccache, David
%A Porte, Stéphanie
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 9th IFIP WG 8.8/11.2 International Conference on Smart Card Research and Advanced Applications (CARDIS)
%C Passau, Germany
%Y Dieter Gollmann; Jean-Louis Lanet; Julien Iguchi-Cartigny
%I Springer
%3 Smart Card Research and Advanced Application
%V LNCS-6035
%P 1-12
%8 2010-04-14
%D 2010
%R 10.1007/978-3-642-12510-2_1
%K Polynomial composition
%K zero-knowledge protocols
%K Fiat-Shamir protocol
%K Guillou-Quisquater protocol
%K smart cards
%Z Computer Science [cs]/Digital Libraries [cs.DL]Conference papers
%X Let n be an RSA modulus and let . This paper explores the following problem: Given polynomials and , find polynomial . We shed light on the connections between the above problem and the RSA problem and derive from it new zero-knowledge protocols suited to smart-card applications.
%G English
%2 https://inria.hal.science/hal-01056103/document
%2 https://inria.hal.science/hal-01056103/file/polcomp.pdf
%L hal-01056103
%U https://inria.hal.science/hal-01056103
%~ ENS-PARIS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-LNCS-6035
%~ IFIP-TC
%~ IFIP-TC11
%~ IFIP-TC8
%~ PSL
%~ IFIP-WG11-2
%~ IFIP-2010
%~ IFIP-CARDIS
%~ IFIP-WG8-8
%~ ENS-PSL