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
› Go to login screen
Not a member?
Click here to register!
Forgot username or password?
Cyber-Physical Systems Virtual Organization
Read-only archive of site from September 29, 2023.
CPS-VO
NP-complete
biblio
Analysis of public-key cryptography using a 3-regular graph with a perfect dominating set
Submitted by aekwall on Mon, 01/31/2022 - 4:13pm
NP-hard problem
White Box Security
Resiliency
quantum computing
Pur
public-key cryptography
public key cryptography
pubcrawl
performance evaluation
perfect dominating set
white box cryptography
NP-complete
NIST
minus dominating function
encryption
Computers
3-regular graph
Metrics
resilience
composability
