Digital signature technique

1. A method for signing and subsequently verifying a plurality of digital messages, comprising the following steps implemented using at least one processor-based subsystem:

selecting parameters including an integer q, a relatively smaller integer p that is coprime with q, and a Gaussian function parameter;

generating random polynomial f relating to p and random polynomial g relating to q;

producing a public key that includes h, where h is equal to a product that can be derived using g and the inverse of f mod q;

producing a private key from which f and g can be derived;

storing the private key and publishing the public key;

producing a plurality of message digests by hashing each of the plurality of digital messages with the public key;

for each message digest, producing a digital signature using the message digest, the private key, and a Gaussian noise polynomial related to said Gaussian function parameter; and

performing a batch verification procedure utilizing the plurality of digital signatures and the public key to determine whether the digital signatures are valid,

wherein said step of performing a batch verification procedure includes implementing a verification on a modulo p summation of a component of all of said digital signatures.

2. The method as defined by claim 1 , wherein said step of producing a digital signature further includes implementing an iterative rejection sampling procedure comprising employing successive randomly generated Gaussian noise polynomials, in conjunction with a message digest and the private key, to obtain candidate digital signatures until a particular candidate digital signature is obtained that meets predetermined criteria, and selecting said particular candidate digital signature.

3. The method as defined by claim 1 , wherein said step of producing a digital signature further includes implementing an iterative rejection sampling procedure comprising employing successive randomly generated Gaussian noise polynomials, in conjunction with a message digest and the private key, to obtain candidate digital signatures until a particular candidate digital signature is obtained that meets predetermined criteria, and selecting said particular candidate digital signature.

4. The method as defined by claim 1 , further comprising transmitting the digital signatures, and wherein said step of performing a batch verification procedure includes receiving the transmitted digital signatures and performing the batch verification procedure on the received digital signatures.

5. The method as defined by claim 2 , further comprising transmitting the digital signatures, and wherein said step of performing a batch verification procedure includes receiving the transmitted digital signatures and performing the batch verification procedure on the received digital signatures.

6. The method as defined by claim 1 , wherein said plurality of digital messages comprises a multiplicity of digital messages.

7. The method as defined by claim 1 , wherein said plurality of digital messages comprises a multiplicity of digital messages.

8. A method for signing and subsequently verifying a digital message, comprising the following steps implemented using at least one processor-based subsystem:

selecting parameters including an integer q, a relatively smaller integer p that is coprime with q, and a Gaussian function parameter;

generating random polynomial f relating to p and random polynomial g relating to q;

producing a public key that includes h, where h is equal to a product that can be derived using g and the inverse of f mod q;

producing a private key from which f and g can be derived;

storing the private key and publishing the public key;

producing a message digest by hashing the digital message with the public key;

producing a digital signature using the message digest, the private key, and Gaussian noise polynomials related to said Gaussian function parameter, including implementing an iterative rejection sampling procedure comprising employing successive randomly generated Gaussian noise polynomials, in conjunction with the message digest and the private key, to obtain candidate digital signatures until a particular candidate digital signature is obtained that meets predetermined criteria, and selecting said particular candidate digital signature; and

performing a batch verification procedure utilizing the digital signature, among a plurality of digital signatures, and the public key to determine whether the digital signature is valid,

wherein said step of performing a batch verification procedure includes implementing a verification on a modulo p summation of a component of all of said digital signatures.

9. The method as defined by claim 8 , further comprising transmitting the digital signature, and wherein said step of performing a batch verification procedure includes receiving the transmitted digital signature and performing the batch verification procedure on the plurality of digital signatures including the received digital signature.

10. A method for signing a plurality of digital messages for subsequent verification, comprising the following steps implemented using at least one processor-based subsystem:

selecting parameters including an integer q, a relatively smaller integer p that is coprime with q, and a Gaussian function parameter;

generating random polynomial f relating to p and random polynomial g relating to q;

producing a public key that includes h, where h is equal to a product that can be derived using g and the inverse of f mod q;

producing a private key from which f and g can be derived;

storing the private key and publishing the public key;

producing a plurality of message digests by hashing each of the plurality of digital messages with the public key;

for each message digest, producing a digital signature using the message digest, the private key, and Gaussian noise polynomials related to said Gaussian function parameter, including implementing an iterative rejection sampling procedure comprising employing successive randomly generated Gaussian noise polynomials, in conjunction with the message digest and the private key, to obtain candidate digital signatures until a particular candidate digital signature is obtained that meets predetermined criteria, and selecting said particular candidate digital signature; and

performing a batch verification procedure utilizing the plurality of digital signatures and the public key to determine whether the digital signatures are valid,

wherein said step of performing a batch verification procedure includes implementing a verification on a modulo p summation of a component of all of said digital signatures.

11. The method as defined by claim 10 , further comprising transmitting the digital signatures and receiving the transmitted digital signatures, and wherein the batch verification procedure is performed on the received digital signatures and the public key.

12. The method as defined by claim 10 , where said plurality of digital messages comprises a multiplicity of digital messages.

13. The method as defined by claim 11 , where said plurality of digital messages comprises a multiplicity of digital messages.