Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Analysis and improvement of modular inverse algorithm

From MaRDI portal
Publication:3372641
Jump to:navigation, search

zbMATH Open1087.94528MaRDI QIDQ3372641FDOQ3372641


Authors: Lijuan Tan, Yun Chen Edit this on Wikidata


Publication date: 9 March 2006





Recommendations

  • A fast modular multiplication algorithm
  • scientific article; zbMATH DE number 1979275
  • The Montgomery inverse and its applications
  • Improving modular inversion in RNS using the plus-minus method
  • New modular multiplication algorithms for fast modular exponentiation


zbMATH Keywords

public key cryptosystemEuclideanmodular inverseextended Euclidean


Mathematics Subject Classification ID

Cryptography (94A60)



Cited In (6)

  • Title not available (Why is that?)
  • Improving modular inversion in RNS using the plus-minus method
  • A binary algorithm with low divergence for modular inversion on SIMD architectures
  • Subtraction-free almost Montgomery inverse algorithm
  • Improving the Accuracy of Inverse Iteration
  • A general method to decompose modular multiplicative inverse operators over group of units





This page was built for publication: Analysis and improvement of modular inverse algorithm

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3372641&oldid=16640657"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 15:52. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki