New modular multiplication and division algorithms based on continued fraction expansion
type: Dataset
description: In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplication and modular division. The presented algorithms are based on the Euclidean algorithm and are of quadratic complexity.
issued: 2026-05-12T19:06:53.981118
language: en
modified: 2026-05-12T19:06:53.981124
contact point: Organization
  fn: CCSD
keyword: continued-fraction
keyword: euclidean-algorithm
keyword: g10
keyword: infoeu-reposemanticspreprint
keyword: infoinfo-aocomputer-science-cscomputer-arithmetic
keyword: modular-arithmetic
keyword: ostrowski-number-system
keyword: preprints-working-papers-
landing page: https://hal.science/hal-00800497

New modular multiplication and division algorithms based on continued fraction expansion
type: Distribution
format: HTML
issued: 2026-05-12T19:06:54.013101
modified: 2026-05-12T19:06:53.963596
access URL: https://hal.science/hal-00800497

test_moissonnage_selune
type: Agent