Abstract: The present invention is a digital signatures scheme method and system that permits the generation of a digital signature in a manner whereby the generator is kept secret. The inclusion of a secret generator in the digital signatures scheme may reduce the potential for an attack upon the scheme to be successful. The present invention may incorporate a signing procedure and a verification procedure. The signing procedure may facilitate the determination of a group, and the identification of the generator from the group. The signing procedure may also keep the generator secret and may generate a digital signature of a message. The generator may be kept secret by one or more conditions, and one or more public keys may be utilized by the digital signatures scheme. The verification procedure may be a verification procedure operable to obtain the message and the digital signature and to verify the digital signature.

Abstract: The present invention introduces the Orange family of stream ciphers. The cipher may involve several elements including splitting with jumping, iterated transformations and padding. The construction of the cipher also involves constantly updated bit strings that may be used as multiple keystreams in transformations of various degrees. The cipher permits parameterizing speed, security and consumed memory. A customization of the cipher allows generating practically unlimited number of stream ciphers with different inner structures and IV parameters. The present invention also presents a transformation of the ERINDALE-PLUS hashing function. The transformed ERINDALE-PLUS hashing is capable simultaneously generate a ciphertext and a secure hash value of a message.

Abstract: The present invention is a polynomial-based hash function involving an ERINDALE-PLUS hashing algorithm. The function may involve several elements, including splitting with jumping, masking and bit string generation which generally involves representing an initial sequence of bits as a specially constructed set of polynomials. The means of achieving the function may involve methods that achieve improved speeds, such as requirements related to the size of the bit strings to cause the bit strings to be compatible with splitting and jumping and to involve iterated masking of a degree greater than 0. Additionally the function may involve recursive padding methods and a construction of MAC for considered hash function. The sum of the elements of the present invention is the provision of enhanced security as well as improved speed of processing for messages. Thus, messages processed by way of the present invention may be less prone to attack.

Abstract: The present invention introduces the Orange family of stream ciphers. The cipher may involve several elements including splitting with jumping, iterated transformations and padding. The construction of the cipher also involves constantly updated bit strings that may be used as multiple keystreams in transformations of various degrees. The cipher permits parameterizing speed, security and consumed memory. A customization of the cipher allows generating practically unlimited number of stream ciphers with different inner structures and IV parameters. The present invention also presents a transformation of the ERINDALE-PLUS hashing function. The transformed ERINDALE-PLUS hashing is capable simultaneously generate a ciphertext and a secure hash value of a message.

Abstract: The present invention is a polynomial-based hash function involving an ERINDALE-PLUS hashing algorithm. The function may involve several elements, including splitting with jumping, masking and bit string generation which generally involves representing an initial sequence of bits as a specially constructed set of polynomials. The means of achieving the function may involve methods that achieve improved speeds, such as requirements related to the size of the bit strings to cause the bit strings to be compatible with splitting and jumping and to involve iterated masking of a degree greater than 0. Additionally the function may involve recursive padding methods and a construction of MAC for considered hash function. The sum of the elements of the present invention is the provision of enhanced security as well as improved speed of processing for messages. Thus, messages processed by way of the present invention may be less prone to attack.

Abstract: The present invention is a digital signatures scheme method and system that permits the generation of a digital signature in a manner whereby the generator is kept secret. The inclusion of a secret generator in the digital signatures scheme may reduce the potential for an attack upon the scheme to be successful. The present invention may incorporate a signing procedure and a verification procedure. The signing procedure may facilitate the determination of a group, and the identification of the generator from the group. The signing procedure may also keep the generator secret and may generate a digital signature of a message. The generator may be kept secret by one or more conditions, and one or more public keys may be utilized by the digital signatures scheme. The verification procedure may be a verification procedure operable to obtain the message and the digital signature and to verify the digital signature.

Abstract: The present invention relates specifically to a modified digital signature algorithm together with a polynomial-based hash function, in which the last step of the calculation of the final hash value, the exponentiation, is omitted. Such a modification eliminates some of the potential attacks to which a basic hash function algorithm is susceptible. It further introduces several flexibilities to a digital signature scheme. For example, hashing and MAC-ing procedures omit an exponentiations step, whereby the security of data is increased as the possibility of successful attack is diminished. Furthermore, the present invention may be implemented either by way of hardware or software. It may also be capable of generating a digital signature for any set of parameters extracted from a message. Generation of a digital signature may occur without the step of a hashing or MAC-ing procedure.

Abstract: Computer software or integrated circuit for performing a secure hashing method including one or more of the following: representing an initial sequence of bits as a specially constructed set of polynomials; transformation of this set by masking; partitioning the transformed set of polynomials into a plurality of classes; forming the bit string during the (separated) partitioning; for each of the plurality of classes, factoring each of the polynomials and so as to define a set of irreducible polynomials and collecting these factors in registers defined for each of the plurality of classes; wrapping the values of the registers from the plurality of classes by means of an enumeration; organizing the enumerations and the bit strings into a knapsack; and performing an exponentiation in a group to obtain the hash value or the MAC value.

Abstract: A method of creating a secure digital signature, including one or more of the following: a sender, based on a private key K and message x, calculates a unique pair of integers q and r such that int(K)=int(h)q+r, then chooses a cyclic group G with generator g, for which the discrete logarithm problem is a hard problem and computes the public key gint(K), and calculates a pair (gq, gr), which is the digital signature of x, a receiver, who knows a public key gint(K), obtains a message y and a digital signature in a form of pair (gq, gr) and calculates the following two expressions gint(K)(gr)?1 and (gq)int(y), the algorithm generates “TRUE”, if the two expressions match, and “FALSE”, if they do not.

Abstract: Computer software or integrated circuit for performing a secure hashing method including one or more of the following: representing an initial sequence of bits as a specially constructed set of polynomials; transformation of this set by masking; partitioning the transformed set of polynomials into a plurality of classes; forming the bit string during the (separated) partitioning; for each of the plurality of classes, factoring each of the polynomials and so as to define a set of irreducible polynomials and collecting these factors in registers defined for each of the plurality of classes; wrapping the values of the registers from the plurality of classes by means of an enumeration; organizing the enumerations and the bit strings into a knapsack; and performing an exponentiation in a group to obtain the hash value or the MAC value.

Abstract: A system and method of improving the resistance of MAC functions to attack makes use of the output MAC value to perform a one-way operation such as exponentiation in a cyclic group such as a Galois Field. Further enhancements are provided by an optional keyed function that can provide another barrier through which an attacker must break. The application of a keyed function can also be applied to hashing functions so that they have the qualities of a MAC function and additionally benefit from the application of the one way operations to improve security.