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

prime field number-crunching

biblio

Visible to the public A complex number approach to elliptic curve cryptosystems over finite fields: implementations and experiments

Submitted by grigby1 on Fri, 06/26/2020 - 12:55pm
  • prime field number-crunching
  • Elliptic curves
  • execution
  • field
  • finite element analysis
  • Galois fields
  • Metrics
  • network security
  • prime field
  • elliptic curve discrete alogarithm issue
  • pubcrawl
  • public key cryptography
  • resilience
  • Resiliency
  • Scalability
  • tests
  • twofold field math
  • Additives
  • elliptic curve cryptosystems
  • Elliptic curve cryptography
  • elliptic bend number-crunching
  • elliptic bend number juggling
  • elliptic bend math
  • elliptic bend cryptosystems
  • elliptic bend
  • double field
  • computer security
  • complex numbers
  • complex number-crunching
  • complex number approach
  • complex number
  • complex fields
  • arrange security

Terms of Use  |  ©2023. CPS-VO