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

DOI10.1007/S11587-014-0213-9zbMATH Open1360.11003OpenAlexW2074350275MaRDI QIDQ480385FDOQ480385

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

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

zbMATH Keywords

de Bruijn sequencesmodular inversionStein's algorithm

Mathematics Subject Classification ID

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

Cites Work

• Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
• Modular Multiplication Without Trial Division
• Title not available (Why is that?)
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Title not available (Why is that?)
• Title not available (Why is that?)
• A binary algorithm with low divergence for modular inversion on SIMD architectures

Cited In (1)

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

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)