Backtracking-assisted multiplication - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences Année : 2018

Backtracking-assisted multiplication

Résumé

Abstract This paper introduces new p r q -based one-way functions and companion signature schemes. The new signature schemes are interesting because they do not belong to the two common design blueprints, which are the inversion of a trapdoor permutation and the Fiat–Shamir transform. In the basic signature scheme, the signer generates multiple RSA-like moduli n i = p i 2 q i and keeps their factors secret. The signature is a bounded-size prime whose Jacobi symbols with respect to the n i ’s match the message digest. The generalized signature schemes replace the Jacobi symbol with higher-power residue symbols. Given of their very unique design, the proposed signature schemes seem to be overlooked “missing species” in the corpus of known signature algorithms.
Fichier principal
Vignette du fichier
2015-787.pdf (533.52 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03933721 , version 1 (10-01-2023)

Identifiants

Citer

Houda Ferradi, Rémi Géraud, Diana Maimuţ, David Naccache, Hang Zhou. Backtracking-assisted multiplication. Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences , 2018, 10 (1), pp.17-26. ⟨10.1007/s12095-017-0254-5⟩. ⟨hal-03933721⟩
6 Consultations
19 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More