Abstract: Methods and systems are described for creating irrefutable binding data for a data file. An input sequence of data elements is derived based on information from the data file. A graphical representation of input regions corresponding to the input sequence of data elements is output on a display, superimposed on captured image data including a visible feature of a user associated with the data file. User input of each data element of the input sequence is captured by tracking the visible feature through the corresponding input regions, and the binding data is created from the captured images as the visible feature is tracked through the input regions.

Abstract: An information storage system in which information is digitally encoded as a sequence of numbers or symbols periodically errors or adds erasures to some of these numbers or symbols. When the accumulated total number of errors or erasures exceeds a certain level, the information becomes irretrievable. Parity check symbols may be calculated and appended to the sequence of numbers or symbols so that the errors or erasures may be corrected and the information retrieved. At some point, the error correction system is overwhelmed, and the information cannot be retrieved. A public record of the positions of the errors or erasures may be maintained using a block chain or other publication to authenticate the progress of the encoded information towards the point where the contained information has been destroyed. The encoded information may be scrambled or encrypted to provide a clear threshold as to when the encoded information is irretrievably lost.

Abstract: Systems and methods are provided for direct packet communications and store and forward packet communications including packets which have attributes which determine the lifetime of the packet contents and these lifetimes are optionally a function of the recipient. Example methods are given featuring the transmission of packets with limited lifetime, the storing and retransmission of packets to one or more recipients and confirmation of deletion of packet contents. It is also shown that cryptography may be employed to ensure that timed presentation of packet contents to recipients takes place and is authenticated by the sender.

Abstract: Methods are described for constructing a secret key by multiple participants such that any quorum combination of participants can generate a fixed number of key components that can be combined by a recipient to generate the secret key. The methods permit an identical secret key to be generated by a different sized quorum from different participants if required. The keys may be used as private keys for encryption, decryption, digital signatures or authentication tokens and each key is generated from a key index. The circuits used by a quorum of participants for the generation of keys feature nested non-linear devices connected in series with outputs multiplied by stored secret values. Example applications are described including blinded cipher text generation, a multi-signature cryptocurrency system and an encrypted cloud storage system.

Abstract: A post-quantum, public key cryptosystem is described which is polynomial based and where the private key polynomial has coefficients from a sub-set of Galois field elements and plain text message polynomials have coefficients from a second sub-set of Galois field elements. The public key polynomial is constructed using the inverse of the private key polynomial and a randomly chosen polynomial having coefficients chosen from a third sub-set of Galois field elements. Cipher texts are constructed using the public key and randomly chosen session key polynomials. Other more complicated embodiments are described. For implementation a small prime base field such as 2, 3 or 5 will usually be used in constructing the prime power Galois field. The system has the advantage of relatively small public key sizes.

Abstract: The present disclosure includes systems and methods for providing instant messaging communication between users via a communication network. Instant messaging clients are executed at user devices of a first and second user. A data message is transmitted from the instant messaging client at the user device of the first user to the instant messaging client at the user device of the second user, the data message having a content portion and at least one associated attribute that is cryptographically generated. The cryptographic attribute plus any additional first user attributes irrefutably binds the ID of the first user to the message information content to form an irrevocable message. The availability of at least one user-selectable function by the instant messaging client at the user device of the second user is controllable, based on the at least one associated attribute.

Abstract: A method and system are described for authenticating one or more digital files in which a feature, characteristic or a portion of the contents of said files is implanted into one or more biometric information files, which are electronically recorded and transmitted and in which the identity of the originator or a trusted third party and all or part of the feature, characteristic or a portion of the contents of said files is determined from said biometric information files.

Abstract: Methods and systems are described for binding a data transaction to a person's identity using biometrics. The method comprises the generation of data which includes information associated with a transaction, or an encrypted transaction, between a server and a client device associated with a user, generating authentication data providing an irrevocable binding of the information to biometric characteristics of the user, by capturing biometric input by the user of said authentication data or information associated with the transaction, wherein this information is implanted into the captured data. A predetermined minimum number of quorum portions may be generated from a portion of the data generated or processed by the method, wherein at least a predetermined minimum number of received quorum data portions are required to reconstruct the data portion.

Abstract: The present disclosure includes systems and methods for quorum-based data recovery, in which data is recovered provided at least a minimum number of quorum data portions are presented. In exemplary embodiments, a predetermined minimum number of versions of original data is received, and the original data is reconstructed from the received versions, wherein the original data cannot be reconstructed without loss unless a predetermined minimum number of versions is received. In other embodiments, erroneous or corrupted quorum data portions are detected and associated participants presenting said erroneous or corrupted quorum data portions are identified.

Abstract: The present disclosure includes systems and methods for providing instant messaging communication between users via a communication network. Instant messaging clients are executed at user devices of a first and second user. A data message is transmitted from the instant messaging client at the user device of the first user to the instant messaging client at the user device of the second user, the data message having a content portion and at least one associated attribute that is cryptographically generated. The cryptographic attribute plus any additional first user attributes irrefutably binds the ID of the first user to the message information content to form an irrevocable message. The availability of at least one user-selectable function by the instant messaging client at the user device of the second user is controllable, based on the at least one associated attribute.

Abstract: The present disclosure includes systems and methods for direct packet communications and store and forward packet communications including packets which have attributes which determine the lifetime of the packet contents and these lifetimes are optionally a function of the recipient. Example methods are given featuring the transmission of packets with limited lifetime, the storing and retransmission of packets to one or more recipients and confirmation of deletion of packet contents. It is also shown that cryptography may be employed to ensure that timed presentation of packet contents to recipients takes place and is authenticated by the sender.

Abstract: This invention provides a means of authenticating digital files without the need for a central trusted authority. A message digest of one or more digital files is calculated, preferably using a cryptographic hash function and all or part of the digest value is implanted into one or more biometric information files produced by the originator of the digital files or a trusted third party. The recipient of the digital files and biometric information files is able to determine all or part of the digest value from the biometric information files, check that this corresponds to the calculated message digest of one or more digital files as well as check the identity of the originator or trusted third party. In further embodiments the biometric information files contain all or part of a digital signature generated by the originator of the digital files or a trusted third party. The invention may be used in many applications including the distribution of public encryption keys.

Abstract: A method and system are described for authenticating one or more digital files in which a feature, characteristic or a portion of the contents of said files is implanted into one or more biometric information files, which are electronically recorded and transmitted and in which the identity of the originator or a trusted third party and all or part of the feature, characteristic or a portion of the contents of said files is determined from said biometric information files.

Abstract: This invention provides improved security of the McEliece Public Key encryption system adding features which make full use of random number generation for given message and cryptogram parameters. Different embodiments of the invention are described which enable the level of security to be traded-off against cryptogram size and complexity. Message vectors are encoded with a scrambled generator matrix, using matrix multiplication to form codeword vectors. Shortened corrupted codewords are generated by corrupting each codeword vector and omitting a predefined number of bits, whereby a cryptogram is formed from the shortened corrupted codewords. Measures are included to defeat attacks based on information set decoding. A number of different applications are given.

Abstract: This invention provides improved security of the McEliece Public Key encryption system adding features which make full use of random number generation for given message and cryptogram parameters, using this invention the encrypted message (i.e. the cryptogram) is a truly random function, not a pseudo random function of the message so that even with the same message and the same public key, a different, unpredictable cryptogram is produced each time. With the knowledge of the private key, the random function may be determined from the cryptogram and the message decrypted. Different embodiments of the invention are described which enable the level of security to be traded-off against cryptogram size and complexity. A number of different applications are given.

Abstract: This invention provides improved security and improved throughput of the McEliece public key encryption system and reduces the public key size. Even though the public key is reduced, in some embodiments of the invention the ensemble of cryptograms produced is identical to the ensemble of cryptograms produced by the original system for a given Goppa code, and the same private key. It is possible using this invention that the encrypted message, the cryptogram is a truly random function, not a pseudo random function of the message so that even with the same message and the same public key, a different, unpredictable cryptogram is produced each time. Other embodiments of the invention use a shortened error correcting code allowing the length of the generated cryptogram to match exactly the available transmission or storage media such as is the case of RFID and packet based radio applications.

Abstract: This invention provides a means of authenticating digital files without the need for a central trusted authority. A message digest of one or more digital files is calculated, preferably using a cryptographic hash function and all or part of the digest value is implanted into one or more biometric information files produced by the originator of the digital files or a trusted third party. The recipient of the digital files and biometric information files is able to determine all or part of the digest value from the biometric information files, check that this corresponds to the calculated message digest of one or more digital files as well as check the identity of the originator or trusted third party. In further embodiments the biometric information files contain all or part of a digital signature generated by the originator of the digital files or a trusted third party. The invention may be used in many applications including the distribution of public encryption keys.

Abstract: This invention provides improved security of the McEliece Public Key encryption system adding features which make full use of random number generation for given message and cryptogram parameters, using this invention the encrypted message (i.e. the cryptogram) is a truly random function, not a pseudo random function of the message so that even with the same message and the same public key, a different, unpredictable cryptogram is produced each time. With the knowledge of the private key, the random function may be determined from the cryptogram and the message decrypted. Different embodiments of the invention are described which enable the level of security to be traded-off against cryptogram size and complexity. A number of different applications are given.

Abstract: This invention provides improved security and improved throughput of the McEliece public key encryption system and reduces the public key size. Even though the public key is reduced, in some embodiments of the invention the ensemble of cryptograms produced is identical to the ensemble of cryptograms produced by the original system for a given Goppa code, and the same private key. It is possible using this invention that the encrypted message, the cryptogram is a truly random function, not a pseudo random function of the message so that even with the same message and the same public key, a different, unpredictable cryptogram is produced each time. Other embodiments of the invention use a shortened error correcting code allowing the length of the generated cryptogram to match exactly the available transmission or storage media such as is the case of RFID and packet based radio applications.

Abstract: The invention is concerned with providing a wireless transmitting and receiving system such that an information stream may be exchanged in both directions over a relatively short range and with a high level of robustness and tolerance to propagation conditions. Several applications are envisaged, such as a hand-off internet radio system in which the user equipment may resemble a traditional domestic analogue radio set combining features of robustness and high audio quality but able to play audio streams from internet radio stations, talking books and encoded music together with a transmitting command system. Other envisaged applications include robust tracking and location systems, range extension of wireless systems such as WiFi, Bluetooth and a robust video streaming system. The unlicensed low power Instrument Scientific Medical (ISM) and Short Range Devices (SRD) frequency bands are well suited to be used by the invention.