Abstract: The present disclosure relates to use of a lectin receptor-like kinase LecRK-IX.1 as a protein for regulating insect resistance of Arabidopsis thaliana. A. thaliana with high resistance to Bemisia tabaci can be cultivated by reducing the expression of, or knocking out, an encoding gene of the protein. Therefore, Arabidopsis thaliana with the high-level resistance to Bemisia tabaci can be cultivated. The gene and its encoded protein can be applied to plant genetic improvement.

Abstract: The present disclosure provides a rice planthopper-sensitivity gene BGIOSGA015651 and the use thereof. The applicant found a gene BGIOSGA015651 for regulating rice planthopper-resistance by studying on rice varieties BG1222 and TN1. The gene expression level of BGIOSGA015651 in the insect-resistant variety is hundreds of times or more different from that of the insect-susceptible variety. The expression of this gene can be reduced or knocked out by molecular breeding methods or genetic engineering methods, resulting in that the insect-susceptible plant can obtain high insect-resistance. The resistance level of the insect-susceptible rice variety TN1 is of level 9 before knock-out, and the resistance level thereof is significantly increased to level 0-1 after the rice planthopper-sensitivity gene BGIOSGA015651 is knocked out.

Abstract: The present disclosure relates to use of a lectin receptor-like kinase LecRK-IX.1 as a protein for regulating insect resistance of Arabidopsis thaliana. A. thaliana with high resistance to Bemisia tabaci can be cultivated by reducing the expression of, or knocking out, an encoding gene of the protein. Therefore, Arabidopsis thaliana with the high-level resistance to Bemisia tabaci can be cultivated. The gene and its encoded protein can be applied to plant genetic improvement.

Abstract: A method is set forth for signing and subsequently verifying a plurality of digital messages, including 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 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 the Gaussian function parameter; and performing a batch verification procedure utilizing the plurality of digital signatures and the public

Abstract: The present disclosure provides a rice planthopper-sensitivity gene BGIOSGA015651 and the use thereof. The applicant found a gene BGIOSGA015651 for regulating rice planthopper-resistance by studying on rice varieties BG1222 and TN1. The gene expression level of BGIOSGA015651 in the insect-resistant variety is hundreds of times or more different from that of the insect-susceptible variety. The expression of this gene can be reduced or knocked out by molecular breeding methods or genetic engineering methods, resulting in that the insect-susceptible plant can obtain high insect-resistance. The resistance level of the insect-susceptible rice variety TN1 is of level 9 before knock-out, and the resistance level thereof is significantly increased to level 0-1 after the rice planthopper-sensitivity gene BGIOSGA015651 is knocked out.

Abstract: A method for signing and subsequently verifying a digital message, including the following steps: generating an irreducible monic polynomial f(x) of degree n in a ring Fq[x]; generating an irreducible monic polynomial F(y) of degree n in a ring Fq[y]; producing first and second finite fields as Fq[x]/(f(x)) and Fq[y]/(F(y)), respectively; producing a secret isomorphism from the first finite field to the second finite field; producing and publishing a public key that depends on F(y); producing a private key that depends on the secret isomorphism; producing a message digest by applying a hash function to the digital message and the public key; producing a digital signature using the message digest and the private key; and performing a verification procedure utilizing the digital signature and the public key.

Abstract: A method is set forth for signing and subsequently verifying a plurality of digital messages, including 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 off 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 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 the Gaussian function parameter; and performing a batch verification procedure utilizing the plurality of digital signatures and the public k

Abstract: A method for signing and subsequently verifying a digital message, including the following steps: generating an irreducible monic polynomial f(x) of degree n in a ring Fq[x]; generating an irreducible monic polynomial F(y) of degree n in a ring Fq[y]; producing first and second finite fields as Fq[x]/(f(x)) and Fq[y]/(F(y)), respectively; producing a secret isomorphism from the first finite field to the second finite field; producing and publishing a public key that depends on F(y); producing a private key that depends on the secret isomorphism; producing a message digest by applying a hash function to the digital message and the public key; producing a digital signature using the message digest and the private key; and performing a verification procedure utilizing the digital signature and the public key.