ENCRYPTION FORMULAE

The present invention relates to a method of encrypting data through randomly generated encryption formulae

BACKGOUND

When transferring information and conducting digital transactions, it is of great benefit to verify the identities of the parties involved. In particular, it is desirable to ensure the person transmitting information is indeed who is being portrayed and the recipient of the information is the intended recipient.

By extension, it is similarly important that the content of the data being transmitted as genuine and verifiable. In particular, that both the sender transmitted such data and that the receiver did in fact receive the data.

Verification is typically achieved using encryption of data. Prior art encryption is typically achieved using a logarithm to generate a data key for encrypting the data. Software encryption platforms use the same data key for multiple acts of encryption and often use the same data key for all data encryption. The data key is applied to encrypted data to decrypt the data. Accordingly, were an unauthorised third party able to discover the data key - all data encrypted using the data key would be decryptable. Of particular relevance to the invention is the use of individually generated data keys which are applicable to a single act of data encryption and decryption. Where such data keys are generated randomly, the ability to timeously hack the encrypted data and determine the data key becomes further diminished.

Of further relevance to the invention is the use of audio sequences generated by random noise generators to generate encryption formulae. These sequences typically repeat every 150 million years. As will be appreciated, the sequence length will affect the frequency of sequence repetition.

Due to the amount of time required for sequence repetition - the sequences are effectively unique. By example, a 32 bit extract of a randomly generated white or pink noise sequence combined with data - will effectively provide the data with a unique noise sequence. Where the data and unique noise sequence combination are associated with an author of the combination - the identity of the author and details associated with its creation become verifiable. The description of the invention will more fully explain the verification method.

The invention seeks to provide method of generating encryption codes that at least partially ameliorates the abovementioned disadvantages associated with the prior art.

SUMMARY OF INVENTION

Accordingly to the invention there is provided a binary code shuffle encryption formula applied to a string of data comprises which data string comprises a plurality of characters, the sequential position of the characters being shuffled in accordance with the shuffle formula along the data string wherein the shuffle sequence is required to decrypt and determine the sequential position of the characters. Conveniently the shuffle formula is randomly generated and may apply to a single data encoding event. The random nature of generating the shuffle formula enables regular generation of new shuffle formulae, which is preferably generated per act of encryption.

Conveniently the shuffle formula is determined by incorporating at least one of mathematical computation, predetermined formula, user determined alpha-numeric pin numbers, biometric data, a computing device unique identifier such as the wifi BSSID associated with the device, or analogue input having an allocated binary value including a sound sequence randomly generated from a white or pink noise generator

Conveniently decryption of the shuffle formula occurs by transmission of the code used to a designated device, whereafter said device applies the formula to data encrypted by the shuffle formula.

Conveniently the shuffle formula may be incorporated into an audio visual transmission, a copy of which is sent to the intended recipient independently of the encrypted data.

According to another aspect of the invention, the method of encryption requires the sequential position of the characters of at least two sets of data to be shuffled and encrypted, wherein each set of encrypted data is sent to a different recipient and the recipients thereafter transmit all encrypted data to a verification device such as a remote server. By example, a bank shuffle formula generator applies a randomly generated shuffle formula and applies said formula to a payment request from a payer and to the intended recipient; and transmits a One Time Pin (OTP) to the payer, whereafter the payer's payment device incorporates unique identifiers in conjunction with the OTP sent. Conveniently the shuffle formula comprises a binary shuffle, wherein the shuffling occurs at bit, alternatively nibble level resulting in the binary byte level characters being shuffled. Shuffle encryption at pre-byte level results in unintelligible data string characters in the absence of the shuffle formula.

Conveniently, the shuffle formula may be embedded into an audio transmission and or visual image. The shuffle formula data so embedded, is decoded by a suitably enabled receiver to reveal the encrypted data contained within the visual signature configuration.

Further features, variants and/or advantages of the invention will emerge from the following non-limiting description of an example of the invention.

DETAILED DESCRIPTION OF THE INVENTION

The invention provides a method of generating a binary code shuffle encryption formula which is applied to a string of data comprises which data string comprises a plurality of characters, the sequential position of the characters being shuffled in accordance with the shuffle formula along the data string wherein the shuffle sequence is required to decrypt and determine the sequential position of the characters.

For purposes of illustration, a data string comprising 52 bytes has 52 character positions. The sequential positions of the characters are shuffled resulting in non sequential positioning of the characters along the data string. By example, sequential character 1 is located in position 11; sequential character 2 is located in position 34; and sequential character 3 is located in position 17 after shuffling. The sequential positions of characters are allocated instructional meaning for confirming transactional data. By example, sequential position 1 applies to account balance, position 2 applies to account number, position 5 applies to beneficiary details, position 7 applies to amount to be paid and position 8 applies to account holder details.

The shuffle formula is randomly generated and applies to a single data encoding event. The random nature of generating the shuffle formula enables regular generation of new shuffle formulae, which results in a new shuffle formula generated per act of encryption. Accordingly, interception and decoding of the shuffle formula would be meaningless for use in future decryption events.

The shuffle formula is determined by incorporating at least one of mathematical computation, predetermined formula, user determined alpha-numeric pin numbers, biometric data, a computing device unique identifier such as the wifi BSSID associated with the device, or analogue input having an allocated binary value including a sound sequence randomly generated from a white or pink noise generator. Of particular relevance to cellular phone SIM card fraud - the incorporation of a unique wifi BSSID of the user's device as part of the encryption formula and transaction authorisation request - would prevent the generation of a suitable shuffle formula to authorise a payment transaction. As wifi engines are created with a unique BSSID, utilising another device during the generation of the shuffle formula and transaction authorisation process - would result in the unauthorised attempt to authorise the transaction being detected and consequently declined.

Decryption of the shuffle formula occurs by transmission of the code used to a designated device such as a server or intended data recipient personal device, whereafter said device applies the formula to data encrypted by the shuffle formula.

The shuffle formula may be incorporated into an audio visual transmission, a copy of which is sent to the intended recipient independently of the encrypted data. By example, a financial transaction shuffle formula is transmitted to the recipient and the payer's bank. The bank would apply the shuffle formula to the transaction request to determine the transaction details. In the event that the transaction data is intercepted - the data intercepted would be in a shuffled, encrypted format. Were the shuffle formula to be decrypted - no benefit would occur due a once-off shuffle code having been used for the transaction.

In another embodiment of the invention, the method of encryption requires the sequential position of the characters of at least two sets of data to be shuffled and encrypted, wherein each set of encrypted data is sent to a different recipient and the recipients thereafter transmit all encrypted data to a verification device such as a remote server. By example, a bank shuffle formula generator applies a randomly generated shuffle formula and applies said formula to a payment request from a payer and to the intended recipient; and transmits a One Time Pin (OTP) to the payer, whereafter the payer's payment device incorporates unique identifiers in conjunction with the OTP sent as part of the transaction authorisation process.

According to a further embodiment of the invention, the shuffle formula comprises a binary shuffle, wherein the shuffling occurs at bit, alternatively nibble level resulting in the binary byte level characters being shuffled. Shuffle encryption at pre-byte level results in unintelligible data string characters in the absence of the shuffle formula.

Still further, the shuffle formula may be embedded into an audio transmission and or visual image. The shuffle formula data so embedded, is decoded by a suitably enabled receiver to reveal the encrypted data contained within the visual signature configuration.

The invention is not limited to the precise details described above. Modifications may be made and other embodiments developed without departing from the spirit of the invention.

The summary of invention and claims form an integral aspect of the description of the invention.