What is SKCJJU-256?

Tweet #LokDon

It is a symmetric key cryptography by Josiah Johnson Umezurike using 256 bytes of encryption. An encryption of 256 bytes is equivalent to 2048 bits. This method of encryption implores and explores the possibilities of using the solutions which exist in open knight’ tours to encrypt data. The introduction of an external context brings about a deterministic approach in cipher development. Until now cryptographically secured random numbers were used. The deterministic nature exhibited in the use of the movement of the knight as the legal move of a knight on the chess board becomes an end which will serve as an edge for times to come.

To further explain why this is needed I will like to let you know that there has been many mathematical advancements in our life time that in about five (5) years time or more some of our main encryption systems will be obsolete. Someone asked me the question below two years ago.

"Why do we need another crypto system for crying out loud?"

He started the question by quoting a very prominent man in the world of cryptography. Bruce Schneier likes to say, "Anyone can invent an encryption algorithm they themselves can't break; it's much harder to invent one that no one else can break" The current algorithms RSA, AES etc has been through rigorous scrutiny over the years by tens of thousands. Why not just use of these?

Also: Lessons learned and misconceptions regarding encryption and cryptology http://security.stackexchange.com/questions/2202/lessons-learned-and-misconceptions- regarding-encryption-and-cryptology

Dec 12, 2011

My Answer:

Good day Rakkhi! Thank you for the questions you posted. Bruce Schneier is right. The business of encryption is a very serious one. We all get tempted to over emphasize on a particular thing. No doubt RSA and AES have proven their worth for many years. We do fear that emerging technology will need other sort of crpto system since they are more ubiquituos.

A good example will be the AES as it is the state of the art in encryption: I like its strength and practical method. Again you just can't figure it out easily. The success of most of these systems are because they are secret anyway. I see the rise of computer knowledge amongst the people and the fall of security as OS become more robust. The tools for attacking cipher-text are becoming more sophisticated.

You see AES does all these steps before it encrypts your information:



Don't forget you still have to build and S-BOX using the plain-text. It serves as a schedule table making it possible for some sort of mathematically randomness (multiplicative inverse)to suffice. We think it will not continue to be fast enough for the future. We are calling on people to realize that and help develop something else.

We know that we are on the right track because SKC JJU-256 does all the AES steps in a sweeping move. Working on a bit level the solution of the Knight' gives us all the solution for a table (S-box which is used in AES ). There is no need to implement the inverse matrix anymore (very natural in symmetry). The initially movement of the Knight performed on the grid of squares does follow these arrangements:

You can also implore Vignere cipher to authenticate keywords. Emerging technology demands something faster and easily programmable so that you as an individual can improve on your security by yourself.

I hope I did a fair job in answering your question.

Take care.

Here is more compelling reasons for a new crypto-system in the future.

There are several emerging areas in which highly constrained devices are interconnected, typically communicating in a wireless mode with one another, working in concert to accomplish some task. Examples of these areas include: sensor networks, healthcare, distributed control systems, the Internet of Things, cyber-physical systems, and the smart grid. Security and privacy can be very important in all of these areas. Because the majority of modern cryptographic algorithms were designed for desktop/server environments, many of these algorithms cannot be implemented in the devices used by these applications. When current algorithms can be engineered to fit into the limited resources of constrained environments, their performance is typically not acceptable. NIST seeks to discuss issues related to the security and resource requirements of applications in constrained environments, and potential future standardization of lightweight primitives.- NIST lightweight cryptographic workshop 2015.

What is the future of AES?

We strongly believe that AES is just like other encryption systems. It could be modified for the future of secured computing especially in the world of big data. I should say that It proves to be uncontested and sturdy for a time. We are afraid that its scope limitations will show much decline as its strength and encryption capacity wanes in time. Of course this won't happen before quantum computing. So the poignancy which many (including Bruce Schneier) have against its S-box ensemble is not far-fetched. Once quantum computing arrives it will appear as if the AES's scheme or rubik's cube puzzle as I call it will be completely solved. More so the result of AES in constrained environment is nothing to write home about.-They are buggy when implemented on a hardware. This decline will make way for a new scheme favoring OTP which is theoretically secure more than anything else. We believe that we have a possible hybrid scheme traversing many strengths of symmetric key cryptography and asymmetric cryptography. Our method is robust and scale-able with many concise and modified variants grandfathered by AES. The proposed system bears timely result in any constrained device to which most complex system are interconnected. There will be much implementation of this algorithm in any industry you can think of; say anywhere you have AES will be very fitting for this algorithm. I see it playing large roles in financial, education, banking, communication, health and IoTs. In this sens alone, we can contain our security in the internet for years to come.