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

Knight’s Tour Problem (KTP)

biblio

Visible to the public Encryption algorithm based on knight’s tour and n-neighbourhood addition

Submitted by aekwall on Mon, 02/15/2021 - 4:50pm
  • Knight’s Tour Matrix
  • Signal processing algorithms
  • signal processing
  • Resiliency
  • pubcrawl
  • Partitioning algorithms
  • n-neighbourhood addition
  • n-neighborhood addition
  • Matrix converters
  • matrix algebra
  • KT matrix
  • Knight’s Tour Problem (KTP)
  • composability
  • Knight's Tour Problem
  • knight tour matrix
  • Image Processing
  • image encryption
  • encryption algorithm
  • encryption
  • efficient encryption
  • digital images
  • cyber physical systems
  • Cryptography
  • cover images

Terms of Use  |  ©2023. CPS-VO