2024/05/31 by Marco Calderini, A. Caminata, Calderini, Marco +3 · 1 citation
Mathematics · #Advanced Statistical Methods and Models #Cryptography and Security (cs.CR) #FOS: Computer and information sciences
paper · pdf · doi:10.48550/arxiv.2405.20968
openalex publication_date 2024/05/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
Multivariate Cryptography is one of the candidates for Post-quantum Cryptography. Multivariate schemes are usually constructed by applying two secret affine invertible transformations \mathcal S,\mathcal T to a set of multivariate polynomials F (often quadratic). The polynomials F possess a trapdoor that allows the legitimate user to find a solution of the corresponding system, while the public polynomials \mathcal G=\mathcal S∘\mathcal F∘\mathcal T look like random polynomials. The polynomials \mathcal G and \mathcal F are said to be affine equivalent. In this article, we present a more general way of constructing a multivariate scheme by considering the CCZ equivalence, which has been introduced and studied in the context of vectorial Boolean functions.