Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
Information Disclosure Statement
The information disclosure statement (IDS) submitted on 09/27/2022 is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statements mentioned above are being considered by the examiner.
Specification
The abstract of the disclosure is objected to because the abstract is over the maximum word count of 150 words, see MPEP 608.01(b). A corrected abstract of the disclosure is required and must be presented on a separate sheet, apart from any other text. See MPEP § 608.01(b).
The disclosure is objected to because of the following informalities:
The applicant’s specification, [0019] seemingly contains a typographical error: “Vewad wherein shifting”
Appropriate correction is required.
Claim Rejections - 35 USC § 101
35 U.S.C. 101 reads as follows:
Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title.
Claims 1-19 are rejected under 35 U.S.C. 101 because the claimed invention is directed to a judicial exception (i.e., a law of nature, a natural phenomenon, or an abstract idea) without significantly more.
Regarding claim 1, under the Alice Framework Step 1, claim 1 falls within the four statutory categories of patentable subject matter identified by 35 USC 101: a process, machine, manufacture, or a composition of matter.
Under the Alice Framework Step 2A prong 1, claim 1 recites an abstract idea, including both a mental process and mathematical concept. Specifically, claim 1 recites the following mathematical formulas:
“using masked compressing of coefficients of a polynomial having ns arithmetic shares, comprising: shifting a first arithmetic share of the ns arithmetic shares by an input mask [Symbol font/0x6C]1; scaling the shifted first arithmetic share by a value based on a first compression factor δ and a masking scaling factor [Symbol font/0x59]1; shifting the scaled first arithmetic share by a value based on the masking scaling factor [Symbol font/0x59]1; scaling a second to ns shares of the ns arithmetic shares by a value based on the first compression factor δ and the masking scaling factor [Symbol font/0x59]1; converting the ns scaled arithmetic shares to ns Boolean shares; right shifting the ns Boolean shares based upon the masking scaling factor [Symbol font/0x59]1 and a second compression factor [Symbol font/0x59]2; XORing an output mask [Symbol font/0x6C]2 with the shifted first Boolean share to produce ns compressed Boolean shares; and carrying out using the ns arithmetic shares when the ns compressed Boolean shares indicates that the coefficients of the polynomial are within boundary values.”
Under the Alice Framework Step 2A prong 2, and Step 2B analysis, claim 1 recites additional elements of, “data processing system comprising instructions”, “non-transitory computer readable medium”, “cryptographic operation”, “lattice-based cryptography”, “instructions”, and “processor”. The recited additional elements are describing merely a generic computing device upon which the abstract idea is applied, see MPEP 2106.04(d)(I), and 2106.05(f). Furthermore, the recited additional elements are merely a generic computing device performing generic functions, see MPEP 2106.05(A)(ii), and MPEP 2106.05(A)(i) regarding mere instructions to implement an abstract idea on a computer. Furthermore, the recited additional elements of “cryptographic operation”, and “lattice-based cryptography”, are merely generally linking to a particular field of use, see MPEP 2106.04(d), 2106.05(h), 2106.05(A)(iv). For these reasons, claim 1 is neither integrated into a practical application nor amounting to significantly more than the abstract idea.
Claim 2 is rejected for at least the reasons set forth with respect to claim 1. Claim 2 merely further limits the mental process and mathematical concept set forth in claim 1. Under the Alice Framework Step 2A prong 1, claim 2 recites an abstract idea, mathematical formulas. Specifically, claim 2 recites the following mathematical formulas:
“further comprising performing a masked comparison function on the ns compressed Boolean shares configured to indicate that the coefficients of the polynomial are within boundary values.”
Claim 2 recites no further additional elements that would require further analysis under Step 2A prong 2 and Step 2B.
Claim 3 is rejected for at least the reasons set forth with respect to claim 2. Claim 3 merely further limits the mental process and mathematical concept set forth in claim 2. Under the Alice Framework Step 2A prong 1, claim 3 recites an abstract idea, mathematical formulas. Specifically, claim 3 recites the following mathematical formulas:
“wherein the compressed polynomial coefficients corresponding to the ns compressed Boolean shares having a value in a valid range of values have a value of 0, and the masked comparison function compares the ns compressed Boolean shares to 0.”
Claim 3 recites no further additional elements that would require further analysis under Step 2A prong 2 and Step 2B.
Claim 4 is rejected for at least the reasons set forth with respect to claim 1. Claim 4 merely further limits the mental process and mathematical concept set forth in claim 1. Under the Alice Framework Step 2A prong 1, claim 4 recites an abstract idea, mathematical formulas. Specifically, claim 4 recites the following mathematical formulas:
“wherein shifting a first arithmetic share of the ns arithmetic shares by an input mask [Symbol font/0x6C]1 includes calculating a(0)A = a(0)A + [Symbol font/0x6C]1 mod q, where a(0)A is the first arithmetic share of the ns arithmetic shares and q is a prime modulus.”
Claim 4 recites no further additional elements that would require further analysis under Step 2A prong 2 and Step 2B.
Claim 5 is rejected for at least the reasons set forth with respect to claim 4. Claim 5 merely further limits the mental process and mathematical concept set forth in claim 4. Under the Alice Framework Step 2A prong 1, claim 5 recites an abstract idea, mathematical formulas. Specifically, claim 5 recites the following mathematical formulas:
“wherein scaling the shifted first arithmetic share by a value based on a first compression factor δ and a masking scaling factor [Symbol font/0x59]1 and shifting the scaled first arithmetic share by a value based on a masking scaling factor [Symbol font/0x59]1 includes calculating
a
(
0
)
A
(
2
1
*
δ
q
*
a
(
0
)
A
+
2
1
-
1
)
m
o
d
2
1
δ
.
”
Claim 5 recites no further additional elements that would require further analysis under Step 2A prong 2 and Step 2B.
Claim 6 is rejected for at least the reasons set forth with respect to claim 5. Claim 6 merely further limits the mental process and mathematical concept set forth in claim 5. Under the Alice Framework Step 2A prong 1, claim 6 recites an abstract idea, mathematical formulas. Specifically, claim 6 recites the following mathematical formulas:
“wherein scaling second to ns shares of the ns shares by a value based on the first compression factor δ and the masking scaling factor [Symbol font/0x59]1 includes calculating
a
(
i
)
A
(
2
1
*
δ
q
*
a
(
i
)
A
)
m
o
d
2
1
δ
where
a
(
i
)
A
is the ith arithmetic share of the ns arithmetic shares.”
Claim 6 recites no further additional elements that would require further analysis under Step 2A prong 2 and Step 2B.
Claim 7 is rejected for at least the reasons set forth with respect to claim 6. Claim 7 merely further limits the mental process and mathematical concept set forth in claim 6. Under the Alice Framework Step 2A prong 1, claim 7 recites an abstract idea, mathematical formulas. Specifically, claim 7 recites the following mathematical formulas:
“wherein right shifting the ns Boolean shares based upon the masking scaling factor [Symbol font/0x59]1 and a second compression factor [Symbol font/0x59]2 includes calculating:
a
-
(
*
)
B
=
a
-
(
*
)
B
≫
(
1
+
2
)
, where
a
-
(
*
)
B
is the ns Boolean shares.”
Claim 7 recites no further additional elements that would require further analysis under Step 2A prong 2 and Step 2B.
Claim 8 is rejected for at least the reasons set forth with respect to claim 7. Claim 8 merely further limits the mental process and mathematical concept set forth in claim 7. Under the Alice Framework Step 2A prong 1, claim 8 recites an abstract idea, mathematical formulas. Specifically, claim 8 recites the following mathematical formulas:
“wherein XORing an output mask [Symbol font/0x6C]2 to the shifted first Boolean share to produce ns compressed Boolean shares includes calculating:
a
-
(
*
)
B
=
a
-
(
*
)
B
2
.”
Claim 8 recites no further additional elements that would require further analysis under Step 2A prong 2 and Step 2B.
Regarding claim 9, under the Alice Framework Step 1, claim 9 falls within the four statutory categories of patentable subject matter identified by 35 USC 101: a process, machine, manufacture, or a composition of matter.
Under the Alice Framework Step 2A prong 1, claim 9 recites an abstract idea, including both a mental process and mathematical concept. Specifically, claim 9 recites the following mathematical formulas:
“using a masked rejection of a polynomial with coefficients having ns arithmetic shares for lattice-based cryptography, comprising: generating a ns arithmetic shares for each coefficient of the polynomial; performing a masked compression of each coefficient of the polynomial using the ns arithmetic shares for each coefficient of the polynomial, including: shifting a first arithmetic share of the ns arithmetic shares by an input mask [Symbol font/0x6C]1; scaling the shifted first arithmetic share by a value based on a first compression factor δ and a masking scaling factor [Symbol font/0x59]1; shifting the scaled first arithmetic share by a value based on the masking scaling factor [Symbol font/0x59]1; scaling the second to ns shares of the ns arithmetic shares by a value based on the first compression factor δ and the masking scaling factor [Symbol font/0x59]1; converting the ns scaled arithmetic shares to Boolean shares; right shifting the ns Boolean shares based upon the masking scaling factor [Symbol font/0x59]1 and a second compression factor [Symbol font/0x59]2; and XORing an output mask [Symbol font/0x6C]2 to the shifted first Boolean share to produce ns compressed Boolean shares, wherein the compressed ns Boolean shares indicate compressed polynomial coefficients having a predetermined value when the polynomial coefficients are within boundary values; comparing the polynomial coefficients represented by the ns compressed Boolean shares to the predetermined value; and carrying out using the ns arithmetic shares when the polynomial coefficients represented by the ns compressed shares are equal to the predetermined value.”
Under the Alice Framework Step 2A prong 2, and Step 2B analysis, claim 9 recites additional elements of, “data processing system comprising instructions”, “non-transitory computer readable medium”, “cryptographic operation”, “instructions”, and “processor”. The recited additional elements are describing merely a generic computing device upon which the abstract idea is applied, see MPEP 2106.04(d)(I), and 2106.05(f). Furthermore, the recited additional elements are merely a generic computing device performing generic functions, see MPEP 2106.05(A)(ii), and MPEP 2106.05(A)(i) regarding mere instructions to implement an abstract idea on a computer. Furthermore, the recited additional element of “cryptographic operation”, is merely generally linking to a particular field of use, see MPEP 2106.04(d), 2106.05(h), 2106.05(A)(iv). For these reasons, claim 9 is neither integrated into a practical application nor amounting to significantly more than the abstract idea.
Claim 10 is rejected for at least the reasons set forth with respect to claim 9. Claim 10 merely further limits the mental process and mathematical concept set forth in claim 9. Under the Alice Framework Step 2A prong 1, claim 10 recites an abstract idea, mathematical formulas. Specifically, claim 10 recites the following mathematical formulas:
“wherein the predetermined value is 0.”
Claim 10 recites no further additional elements that would require further analysis under Step 2A prong 2 and Step 2B.
Claim 11 is rejected for at least the reasons set forth with respect to claim 10. Claim 11 merely further limits the mental process and mathematical concept set forth in claim 10. Under the Alice Framework Step 2A prong 1, claim 11 recites an abstract idea, mathematical formulas. Specifically, claim 11 recites the following mathematical formulas:
“wherein shifting a first arithmetic share of the ns arithmetic shares by an input mask A includes calculating a(0)A = a(0)A + [Symbol font/0x6C]1 mod q, wherein a(0)A is the first arithmetic share of the ns shares and q is a prime modulus, scaling the shifted first arithmetic share by a value based on a first compression factor δ and a masking scaling factor [Symbol font/0x59]1 and shifting the scaled first arithmetic share by a value based on the masking scaling factor [Symbol font/0x59]1 includes calculating
a
(
0
)
A
(
2
1
*
δ
q
*
a
(
0
)
A
+
2
1
-
1
)
m
o
d
2
1
δ
, scaling second to ns shares of the ns arithmetic shares by a value based on the first compression factor δ and the masking scaling factor [Symbol font/0x59]1 includes calculating
a
(
i
)
A
2
1
*
δ
q
*
a
(
i
)
A
m
o
d
2
1
δ
where
a
(
i
)
A
is the ith arithmetic share of the ns arithmetic shares, right shifting the ns Boolean shares based upon the masking scaling factor [Symbol font/0x59]1 and a second compression factor [Symbol font/0x59]2 includes calculating: :
a
-
(
*
)
B
=
a
-
(
*
)
B
≫
(
1
+
2
)
, where
a
-
(
*
)
B
is the ns Boolean shares, and XOring an output mask [Symbol font/0x6C]2 to the shifted first Boolean share to produce ns compressed Boolean shares includes calculating:
a
-
(
0
)
B
=
a
-
(
0
)
B
2
”
Claim 11 recites no further additional elements that would require further analysis under Step 2A prong 2 and Step 2B.
Regarding claim 12, under the Alice Framework Step 1, claim 12 falls within the four statutory categories of patentable subject matter identified by 35 USC 101: a process, machine, manufacture, or a composition of matter.
Under the Alice Framework Step 2A prong 1, claim 12 recites an abstract idea, including both a mental process and mathematical concept. Specifically, claim 12 recites the following mathematical formulas:
“A method using masked compressing of coefficients of a polynomial having ns arithmetic shares, comprising: shifting a first arithmetic share of the ns arithmetic shares by an input mask [Symbol font/0x6C]1; scaling the shifted first arithmetic share by a value based on a first compression factor δ and a masking scaling factor [Symbol font/0x59]1; shifting the scaled first arithmetic share by a value based on the masking scaling factor [Symbol font/0x59]1; scaling a second to ns shares of the ns arithmetic shares by a value based on the first compression factor δ and the masking scaling factor [Symbol font/0x59]1; converting the ns scaled arithmetic shares to ns Boolean shares; right shifting the ns Boolean shares based upon the masking scaling factor [Symbol font/0x59]1 and a second compression factor [Symbol font/0x59]2; XORing an output mask [Symbol font/0x6C]2 to the shifted first Boolean share to produce ns compressed Boolean shares; and carrying out using the ns arithmetic shares when the ns compressed Boolean shares indicates that the coefficients of the polynomial are within boundary values.”
Under the Alice Framework Step 2A prong 2, and Step 2B analysis, claim 12 recites additional elements of, “cryptographic operation”, and “lattice-based cryptography”. The recited additional elements of “cryptographic operation”, and “lattice-based cryptography” are merely generally linking to a particular field of use, see MPEP 2106.04(d), 2106.05(h), 2106.05(A)(iv). For these reasons, claim 12 is neither integrated into a practical application nor amounting to significantly more than the abstract idea.
Claim 13 is rejected for at least the reasons set forth with respect to claim 12. Claim 13 merely further limits the mental process and mathematical concept set forth in claim 12. Under the Alice Framework Step 2A prong 1, claim 13 recites an abstract idea, mathematical formulas. Specifically, claim 13 recites the following mathematical formulas:
“further comprising performing a masked comparison function on the ns compressed Boolean shares configured to indicate that the coefficients of the polynomial are within boundary values.”
Claim 13 recites no additional elements that would require analysis under Step 2A prong 2 and Step 2B.
Claim 14 is rejected for at least the reasons set forth with respect to claim 13. Claim 14 merely further limits the mental process and mathematical concept set forth in claim 13. Under the Alice Framework Step 2A prong 1, claim 14 recites an abstract idea, mathematical formulas. Specifically, claim 14 recites the following mathematical formulas:
“wherein the compressed polynomial coefficients corresponding to the ns compressed Boolean shares having a value in a valid range of values have a value of 0, and the masked comparison function compares the ns compressed Boolean shares to 0.”
Claim 14 recites no additional elements that would require analysis under Step 2A prong 2 and Step 2B.
Claim 15 is rejected for at least the reasons set forth with respect to claim 12. Claim 15 merely further limits the mental process and mathematical concept set forth in claim 12. Under the Alice Framework Step 2A prong 1, claim 15 recites an abstract idea, mathematical formulas. Specifically, claim 15 recites the following mathematical formulas:
“wherein shifting a first arithmetic share of the ns arithmetic shares by an input mask [Symbol font/0x6C]1 includes calculating a(0)A = a(0)A + [Symbol font/0x6C]1 mod q, where a(0)A is the first arithmetic share of the ns arithmetic shares and q is a prime modulus.”
Claim 15 recites no additional elements that would require analysis under Step 2A prong 2 and Step 2B.
Claim 16 is rejected for at least the reasons set forth with respect to claim 15. Claim 16 merely further limits the mental process and mathematical concept set forth in claim 15. Under the Alice Framework Step 2A prong 1, claim 16 recites an abstract idea, mathematical formulas. Specifically, claim 16 recites the following mathematical formulas:
“wherein scaling the shifted first arithmetic share by a value based on a first compression factor δ and a masking scaling factor [Symbol font/0x59]1 and shifting the scaled first arithmetic share by a value based on the masking scaling factor [Symbol font/0x59]1 includes calculating
a
(
0
)
A
(
2
1
*
δ
q
*
a
(
0
)
A
+
2
1
-
1
)
m
o
d
2
1
δ
.”
Claim 16 recites no additional elements that would require analysis under Step 2A prong 2 and Step 2B.
Claim 17 is rejected for at least the reasons set forth with respect to claim 16. Claim 17 merely further limits the mental process and mathematical concept set forth in claim 16. Under the Alice Framework Step 2A prong 1, claim 17 recites an abstract idea, mathematical formulas. Specifically, claim 17 recites the following mathematical formulas:
“wherein scaling second to ns shares of the ns shares by a value based on the first compression factor δ and the masking scaling factor [Symbol font/0x59]1 includes calculating
a
(
i
)
A
2
1
*
δ
q
*
a
(
i
)
A
m
o
d
2
1
δ
where
a
(
i
)
A
is the ith arithmetic share of the ns arithmetic shares.”
Claim 17 recites no additional elements that would require analysis under Step 2A prong 2 and Step 2B.
Claim 18 is rejected for at least the reasons set forth with respect to claim 17. Claim 18 merely further limits the mental process and mathematical concept set forth in claim 17. Under the Alice Framework Step 2A prong 1, claim 18 recites an abstract idea, mathematical formulas. Specifically, claim 18 recites the following mathematical formulas:
“wherein right shifting the ns Boolean shares based upon the masking scaling factor [Symbol font/0x59]1 and a second compression factor [Symbol font/0x59]2 includes calculating:
a
-
(
*
)
B
=
a
-
(
*
)
B
≫
(
1
+
2
)
, where
a
-
(
*
)
B
is the ns Boolean shares.”
Claim 18 recites no additional elements that would require analysis under Step 2A prong 2 and Step 2B.
Claim 19 is rejected for at least the reasons set forth with respect to claim 18. Claim 19 merely further limits the mental process and mathematical concept set forth in claim 18. Under the Alice Framework Step 2A prong 1, claim 19 recites an abstract idea, mathematical formulas. Specifically, claim 19 recites the following mathematical formulas:
“wherein XORing an output mask [Symbol font/0x6C]2 to the shifted first Boolean share to produce ns compressed Boolean shares includes calculating:
a
-
(
0
)
B
=
a
-
(
0
)
B
2
”
Claim 19 recites no additional elements that would require analysis under Step 2A prong 2 and Step 2B.
Allowable Subject Matter
Claims 1-19 would be allowable if rewritten to overcome the rejection(s) under 35 U.S.C. 101 rejections, set forth in this Office action and to include all of the limitations of the base claim and any intervening claims.
The following is a statement of reasons for the indication of allowable subject matter:
Regarding claim 1 the applicant claims a data processing system for lattice-based cryptography, the data processing system of claim 1 comprises:
“A data processing system comprising instructions embodied in a non-transitory computer readable medium, the instructions for a cryptographic operations using masked compressing of coefficients of a polynomial having ns arithmetic shares for lattice-based cryptography in a processor, the instructions, comprising: shifting a first arithmetic share of the ns arithmetic shares by an input mask [Symbol font/0x6C]1; scaling the shifted first arithmetic share by a value based on a first compression factor δ and a masking scaling factor [Symbol font/0x59]1; shifting the scaled first arithmetic share by a value based on the masking scaling factor [Symbol font/0x59]1; scaling a second to ns shares of the ns arithmetic shares by a value based on the first compression factor δ and the masking scaling factor [Symbol font/0x59]1; converting the ns scaled arithmetic shares to ns Boolean shares; right shifting the ns Boolean shares based upon the masking scaling factor [Symbol font/0x59]1 and a second compression factor [Symbol font/0x59]2; XORing an output mask [Symbol font/0x6C]2 with the shifted first Boolean share to produce ns compressed Boolean shares; and carrying out a cryptographic operation using the ns arithmetic shares when the ns compressed Boolean shares indicates that the coefficients of the polynomial are within boundary values.”
The primary reason for indication of allowable subject matter is the above italicized claim limitations in combination with the remaining claim limitations including intervening claims.
Regarding claim 9 the applicant claims a data processing system for a cryptographic operation, the data processing system of claim 9 comprises:
“A data processing system comprising instructions embodied in a non-transitory computer readable medium, the instructions for a cryptographic operation using a masked rejection of a polynomial with coefficients having ns arithmetic shares for lattice-based cryptography in a processor, the instructions, comprising: generating a ns arithmetic shares for each coefficient of the polynomial; performing a masked compression of each coefficient of the polynomial using the ns arithmetic shares for each coefficient of the polynomial, including: shifting a first arithmetic share of the ns arithmetic shares by an input mask [Symbol font/0x6C]1; scaling the shifted first arithmetic share by a value based on a first compression factor δ and a masking scaling factor [Symbol font/0x59]1; shifting the scaled first arithmetic share by a value based on the masking scaling factor [Symbol font/0x59]1; scaling the second to ns shares of the ns arithmetic shares by a value based on the first compression factor δ and the masking scaling factor [Symbol font/0x59]1; converting the ns scaled arithmetic shares to Boolean shares; right shifting the ns Boolean shares based upon the masking scaling factor [Symbol font/0x59]1 and a second compression factor [Symbol font/0x59]2; and XORing an output mask [Symbol font/0x6C]2 to the shifted first Boolean share to produce ns compressed Boolean shares, wherein the compressed ns Boolean shares indicate compressed polynomial coefficients having a predetermined value when the polynomial coefficients are within boundary values; comparing the polynomial coefficients represented by the ns compressed Boolean shares to the predetermined value; and carrying out a cryptographic operation using the ns arithmetic shares when the polynomial coefficients represented by the ns compressed shares are equal to the predetermined value.”
The primary reason for indication of allowable subject matter is the above italicized claim limitations in combination with the remaining claim limitations including intervening claims.
Regarding claim 12 the applicant claims a data processing method for a lattice-based cryptographic operation, the data processing method of claim 12 comprises:
“A method for a cryptographic operation using masked compressing of coefficients of a polynomial having ns arithmetic shares for lattice-based cryptography, comprising: shifting a first arithmetic share of the ns arithmetic shares by an input mask [Symbol font/0x6C]1; scaling the shifted first arithmetic share by a value based on a first compression factor δ and a masking scaling factor [Symbol font/0x59]1; shifting the scaled first arithmetic share by a value based on the masking scaling factor [Symbol font/0x59]1; scaling a second to ns shares of the ns arithmetic shares by a value based on the first compression factor δ and the masking scaling factor [Symbol font/0x59]1; converting the ns scaled arithmetic shares to ns Boolean shares; right shifting the ns Boolean shares based upon the masking scaling factor [Symbol font/0x59]1 and a second compression factor [Symbol font/0x59]2; XORing an output mask [Symbol font/0x6C]2 to the shifted first Boolean share to produce ns compressed Boolean shares; and carrying out a cryptographic operation using the ns arithmetic shares when the ns compressed Boolean shares indicates that the coefficients of the polynomial are within boundary values.”
The primary reason for indication of allowable subject matter is the above italicized claim limitations in combination with the remaining claim limitations including intervening claims.
Kundu et al. (Kundu, Higher-order Masked Saber - cryptology ePrint Archive. (2022, May). https://eprint.iacr.org/2022/389.pdf), hereinafter “Kundu” discusses High-order masked lattice based cryptography schemes for post quantum cryptography. Furthermore Kundu discloses Algorithms includes masking, compression, shift operation on Boolean shares. However, Kundu fails to teach or suggest the italicized claim limitations in combination with the remaining claim limitations as referenced above.
Bhasin et al. (Bhashin, S., D’Anvers, J.-P., Heinz, D., Poppelmann, T., & Beirendonck, M. (2021, May). Attacking and Defending Masked Polynomial Comparison for Lattice-Based Cryptography. https://eprint.iacr.org/2021/104.pdf), hereinafter “Bhasin”, discloses lattice-based cryptography. Bhasin further discloses cryptography algorithms including masking, and compression. However, Bhasin fails to teach or suggest the italicized claim limitations in combination with the remaining claim limitations as referenced above.
Barthe et al. (Gilles Barthe, Sonia Belaïd, Thomas Espitau, Pierre-Alain Fouque, Benjamin Grégoire, Mélissa Rossi, and Mehdi Tibouchi, Masking the GLP lattice-based signature scheme at any order, Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part II (Jesper Buus Nielsen and Vincent Rijmen, eds.), Lecture Notes in Computer Science, vol. 10821, Springer, 2018, pp. 354–384.), hereinafter “Barthe” discloses post quantum cryptography scheme, lattice-based cryptography. Barthe further discloses algorithms including Boolean masking, and compression. However, Bhasin fails to teach or suggest the italicized claim limitations in combination with the remaining claim limitations as referenced above.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to JEROME ANTHONY KLOSTERMAN II whose telephone number is (571)272-0541. The examiner can normally be reached Monday - Friday 8:30am - 3:30pm.
Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Andrew Caldwell can be reached at (571)-272-3702. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/J.A.K./ Examiner, Art Unit 2182
/EMILY E LAROCQUE/ Primary Examiner, Art Unit 2182
Prosecution Insights