Combining Montgomery Multiplication with Tag Tracing for the Pollard Rho Algorithm in Prime Order Fields

Document Type

Conference Article

Publication Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract

In this short paper we show how to apply Montgomery multiplication to the tag tracing variant of the Pollard rho algorithm applied to prime order fields. This combines the advantages of tag tracing with those of Montgomery multiplication. In particular, compared to the previous version of tag tracing, the use of Montgomery multiplication entirely eliminates costly modular reductions and replaces these with much more efficient divisions by a suitable power of two.

First Page

138

Last Page

146

DOI

10.1007/978-3-031-22829-2_8

Publication Date

1-1-2022

This document is currently not available here.

Share

COinS