A binary algorithm with low divergence for modular inversion on SIMD architectures

DOI10.1007/S11587-014-0213-9MaRDI QIDQ480385zbMATHOpenAlexFDO

Authors Maurizio Laporta, Alberto Pizzirani

Publication date 8 December 2014

Published in Ricerche di Matematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11587-014-0213-9

zbMATH Keywords

de Bruijn sequencesmodular inversionStein's algorithm

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Theory of software (68N99)

Recommendations

• ECC2K-130 on NVIDIA GPUs
• High-Performance Modular Multiplication on the Cell Processor
• Analysis and improvement of modular inverse algorithm
• The Montgomery inverse and its applications
• Information Security and Cryptology

Cites work

• scientific article; zbMATH DE number 1670838 (Why is no real title available?)
• scientific article; zbMATH DE number 3564899 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• A binary algorithm with low divergence for modular inversion on SIMD architectures
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Modular Multiplication Without Trial Division
• Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction

Cited in

(1)

• A binary algorithm with low divergence for modular inversion on SIMD architectures

Describes a project that uses

Uses Software

• Curve25519

This page was built for publication: A binary algorithm with low divergence for modular inversion on SIMD architectures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q480385)