Project Details: 64-Bit Dual-Layer Encryption


Clicking the image brings you to GitHub:
...
GitHub repository through icon:

Summary of Project

A 64-Bit pair of encryption/decryption scripts in a merged console app that utilizes dual-layer encryption for enhanced security. The project demonstrates advanced C++ techniques including memory management, bitwise operations, and algorithmic randomization to ensure robust data protection.

The deep theory is that this algorithm is intended to open the API collaboration around the utilization of Google's Titan-M cryptographic accelerator. My algorithm utilizes a security key combination algorithm to segment these layers: Service-Layer, Application-Layer, Operating-System-Layer, and Hardware-Layer security key rotation and management. It's an approach that combines unique forms of Bit-Masking as it processes each chunk of data, with a Cypher-Swapping Layer, and of course a unique seeding algorithm from an initial system timestamp. The algorithm is designed to be flexible and adaptable, allowing for the integration of additional layers or modifications to the existing layers as needed.

If you download/branch this project, you can expect to see a well-structured codebase with clear documentation and comments explaining the functionality of each component. The encryption algorithm is designed to be both secure and efficient, making use of modern C++ features, and memory-pointer utilization to optimize performance.

Overall, this project showcases my ability to develop complex software solutions that prioritize security and performance, while also maintaining clean and maintainable code. I am confident that the skills and techniques demonstrated in this project will be valuable in any software development or cybersecurity role.


Technologies Utilized


Techniques Applied

  • Algorithmic seeding of RNG from current time for enhanced security.

  • Dynamic rotating keys generation and a feature I call Active-Security-Table.

  • Cyphering techniques including substitution and transposition methods.

  • C++ memory pointers for Bit-Mask transformations to boost runtime efficiency.

  • Randomization on a line by line and block by block basis of 64-Bit blocks representing 8 characters at a time utilizing a set of key transforms including:
    • Bitwise 64-Bit memory block rotations & transpositions.
    • XOR/XNOR encoding of one half of a byte of data with the other as individual bytes are processed.
    • Simple inverse transforms as individual bytes are processed.

  • Theoretical utilization of Titan-M cryptographic accelerator by Google which utilizes a security key combination algorithm to segment these layers:
    • Service-Layer security key rotation and management.
    • Application-Layer security key rotation and management.
    • Operating-System-Layer security key rotation and management.
    • Hardware-Layer security key rotation and management.

Challenges Faced

  • I struggled with getting both the encryption and decryption to process the files correctly due to some complex processing loops. The algorithm is reading through the file and grabbing chunks of data to process, and it was tricky to ensure that the data was being handled correctly at each step.

Techniques gained or lessons learned from this project...

  • Greatly expanded debugging ability with complex C++ code involving pointers and memory management.
  • Enhanced understanding of cryptographic algorithms and their practical implementations.
  • Improved skills in optimizing code for performance and efficiency.

Contact Me

Contact Me

My Linked-In:

My GitHub:

Please contact me using one of the above links... or the links in my footer.

My Javascript validation works, but I'm having issues with GoDaddy's SMTP server. It's detecting all outbound traffic as SPAM, and I need to do more research to enable my forms to generate an outgoing email to my account.

This form won't do anything as a result. I'm only showcasing some conditional formatting using JavaScript Validation functions for the User Experience.