High-Performance Modular Multiplication on the Cell Processor

DOI10.1007/978-3-642-13797-6_2zbMath1231.68035OpenAlexW1681176638MaRDI QIDQ3578462

Joppe W. Bos

Publication date: 20 July 2010

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL: http://infoscience.epfl.ch/record/173015

zbMATH Keywords

Cell Broadband EngineCurve25519Elliptic Curve Cryptography (ECC)Montgomery MultiplicationNIST primes

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07) Applications to coding theory and cryptography of arithmetic geometry (14G50) Computer aspects of numerical algorithms (65Y99)

Related Items (2)

Fast cryptography in genus 2 ⋮ Phirsa: exploiting the computing power of vector instructions on Intel Xeon Phi for RSA

Uses Software

• EFD

This page was built for publication: High-Performance Modular Multiplication on the Cell Processor