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

Montgomery modular multiplication

biblio

Visible to the public The Fast Paillier Decryption with Montgomery Modular Multiplication Based on OpenMP

Submitted by grigby1 on Tue, 07/18/2023 - 3:23pm
  • OpenMP
  • parallel architectures
  • Montgomery modular multiplication
  • exponentiation
  • Paillier
  • Human Factors
  • Homomorphic encryption
  • Resiliency
  • Chinese remainder theorem
  • pubcrawl
  • Distributed databases
  • Data Security
  • Artificial Intelligence
  • programming
  • data privacy
  • Scalability
  • resilience
biblio

Visible to the public Research in Fast Modular Exponentiation Algorithm Based on FPGA

Submitted by grigby1 on Tue, 01/21/2020 - 11:50am
  • Montgomery algorithm
  • systolic arrays
  • systolic array
  • Scalability
  • Resiliency
  • resilience
  • Q measurement
  • public-key cryptosystem
  • public-key cryptography
  • public-key algorithm
  • public key cryptography
  • pubcrawl
  • Montgomery modular multiplication
  • automation
  • Modular Multiplication
  • modular exponentiation on large number
  • modular exponentiation
  • mechatronics
  • logic design
  • frequency 170.0 MHz
  • FPGA
  • field programmable gate arrays
  • fast modular exponentiation algorithm
  • exponentiation
  • Erbium
  • Conferences

Terms of Use  |  ©2023. CPS-VO