Context Our Contribution Conclusion
58 pages
English

Découvre YouScribe en t'inscrivant gratuitement

Je m'inscris

Context Our Contribution Conclusion

-

Découvre YouScribe en t'inscrivant gratuitement

Je m'inscris
Obtenez un accès à la bibliothèque pour le consulter en ligne
En savoir plus
58 pages
English
Obtenez un accès à la bibliothèque pour le consulter en ligne
En savoir plus

Description

Context Our Contribution Conclusion Factoring Unbalanced Moduli with Known Bits Eric Brier1 David Naccache2 Mehdi Tibouchi2 1Ingenico 2Ecole normale superieure ICISC 2009

  • context factoring

  • ecole normale

  • factoring unbalanced

  • using lattice

  • bit pattern

  • unbalanced moduli

  • pattern can


Sujets

Informations

Publié par
Nombre de lectures 11
Langue English

Extrait

Context
Factoring
OurContribution
Unbalanced Moduli with Known
´ Eric Brier1David Naccache2 Mehdi Tibouchi2
1
Ingenico
2eirueermrlasepuonelocE´ ´
ICISC 2009
Bits
Conclusion
ContextuOrCnortbiution
Our Results in a Nutshell
Co
Investigatethe problem of factoring an unbalanced RSA modulusn=pq(p>q) given the knowledge of some bits of p. Findthat it is easily solved when at least 2 log2qcontiguous bits ofpare known, regardless of their position. Showthat this bound can be improved depending on where the known bit pattern is located, and that different (e.g. non-contiguous) patterns can be tackled as well.
nclusion
ContextuOrCnortbiution
Our Results in a Nutshell
Co
Investigatethe problem of factoring an unbalanced RSA modulusn=pq(p>q) given the knowledge of some bits of p. Find logit is easily solved when at least 2that 2qcontiguous bits ofpare known, regardless of their position. Showthat this bound can be improved depending on where the known bit pattern is located, and that different (e.g. non-contiguous) patterns can be tackled as well.
cnlusion
oCtnxetOurContribution
Our Results in a Nutshell
Co
Investigatethe problem of factoring an unbalanced RSA modulusn=pq(p>q) given the knowledge of some bits of p. Findit is easily solved when at least 2 logthat 2qcontiguous bits ofpare known, regardless of their position. Showthat this bound can be improved depending on where the known bit pattern is located, and that different (e.g. non-contiguous) patterns can be tackled as well.
nclusion
Context
Context Factoring with a hint Unbalanced moduli
Our Contribution Initial observations Using Lattice Reduction Other patterns
uOrCnortibution
Outline
Conclusion
  • Univers Univers
  • Ebooks Ebooks
  • Livres audio Livres audio
  • Presse Presse
  • Podcasts Podcasts
  • BD BD
  • Documents Documents