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

PDLP

biblio

Visible to the public New Efficient QERPKC based on Partial Discrete Logarithm Problem

Submitted by aekwall on Mon, 03/22/2021 - 1:15pm
  • Elliptic curve cryptography
  • quadratic exponentiation randomized public key cryptosystem
  • QERPKC
  • QER
  • PDLP hardness
  • PDLP
  • partial discrete logarithm problem
  • exponentiation
  • PKC
  • Transmitters
  • public key encryption
  • Safety
  • Security analysis
  • computational complexity
  • public key cryptography
  • Cryptography
  • pubcrawl
  • Resiliency
  • Protocols
  • security
  • encryption
  • Scalability

Terms of Use  |  ©2023. CPS-VO