Skip to Main Content Area
  • CPS-VO
    • Contact Support
  • Browse
    • Calendar
    • Announcements
    • Repositories
    • Groups
  • Search
    • Search for Content
    • Search for a Group
    • Search for People
    • Search for a Project
    • Tagcloud
      
 
Not a member?
Click here to register!
Forgot username or password?
 
Home
National Science Foundation

Cyber-Physical Systems Virtual Organization

Read-only archive of site from September 29, 2023.

CPS-VO

binary exponentiation

biblio

Visible to the public Modification and Optimization of Solovey-Strassen's Fast Exponentiation Probablistic Test Binary Algorithm

Submitted by aekwall on Mon, 01/20/2020 - 11:48am
  • optimization
  • test
  • Solovey-Strassen fast exponentiation probablistic test binary algorithm
  • Solovey-Strassen
  • Software algorithms
  • Scalability
  • Resiliency
  • pubcrawl
  • probability test
  • probability
  • Probabilistic logic
  • Algorithm
  • Jacobian matrices
  • Jacobi symbol
  • Information systems
  • Fermat's little theorem
  • Fermat
  • exponentiation
  • C\# programming language
  • C\# languages
  • Cryptography
  • binary exponentiation
biblio

Visible to the public Efficient modular multiplication algorithms for public key cryptography

Submitted by BrandonB on Wed, 05/06/2015 - 11:07am
  • modular exponentiation
  • word length
  • substitute and reward algorithms
  • store and forward algorithms
  • RSA
  • public key cryptosystems
  • Public key cryptography(PKC)
  • public key cryptography
  • modular multiplication algorithms
  • Modular Multiplication
  • Algorithm design and analysis
  • encryption
  • digital signatures
  • digital signature schemes
  • cryptographic transformations
  • Conferences
  • Ciphers
  • bit forwarding algorithms
  • binary exponentiation
  • BFW algorithms

Terms of Use  |  ©2023. CPS-VO