DETAILED ACTION
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 .
Claims 1 to 20 are presented for examination.
Priority
Receipt is acknowledged of papers submitted under 35 U.S.C. 119, which papers have been placed of record in the file.
Information Disclosure Statement
The references listed in the information disclosure statement submitted on 2-25-25 and 10-19-25 have been considered by the examiner (see attached PTO-1449).
Claim Rejections - 35 USC § 103
The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action:
A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made.
Claims 1, 6 to 9, 13 to 16, 19 and 20 are rejected under 35 U.S.C. 103 as being unpatentable over Dubrova et al. (USPAP 2018/0069706).
Claims 1 and 9:
Dubrova substantially teaches the claimed invention. Dubrova teaches a method and an apparatus for generating a cryptographic checksum for a message, the apparatus comprising: a receiver (102) receiving a message encoded by a sending device, wherein the message is acquired and is fed into an algorithm (301) that is configured to calculate a first checksum (see par. 0058). Dubrova teaches that at the receiver a forward error correction (FEC) codeword (216) is received and fed into a FEC decoding algorithm (312) (see par. 0060). Dubrova teaches that the message and its corresponding checksum are outputted from the FEC decoder and fed into a checksum algorithm (301) to verify the integrity of the message (see par. 0061).
Dubrova teaches that cyclic redundancy checks (CRCs) are known as cryptographic hash and a CRC with a generator polynomial (p(x)) of degree n is capable of detecting all burst errors of length less than or equal to n (see par. 0062). Dubrova teaches that computing the cryptographic checksum is based on selecting a primitive polynomial from a set of primitive polynomials over a Galois Field and then calculating a generator polynomial (see par. 0070). Dubrova teaches that the generator polynomial is calculated based on the selected primitive polynomial (see par. 0071).
Dubrova teaches steps for computing a second cryptographic checksum based on selecting a primitive polynomial and the computation of another generator polynomial (see par. 0098). Dubrova teaches that selecting the primitive polynomial and computing the generator polynomial are based on a Galois Field GF(2) (see par. 0098). Dubrova teaches that the checksum decoder recomputes the check bits for the received message elements and a comparator compares the recomputed check bits with the check bits received in the message thereby verifying the integrity of the message (see par. 0105).
Dubrova fails to specifically teach wherein the second generator polynomial follows [Equation 1]
PNG
media_image1.png
291
778
media_image1.png
Greyscale
However, this teaching is obvious to the teachings of Dubrova since Dubrova teaches that a method and an apparatus for providing data integrity in the user plane comprises selecting a primitive polynomial p1(x) that is a of degree n-1 over Galois Field GF(2) and that the generator polynomial p(x) of degree n is represented as
PNG
media_image2.png
31
265
media_image2.png
Greyscale
(see par. 0075). Dubrova also teaches that a first function g may comprise an addition with a pad s of length n, i.e., g(hp(M)) = hp(M)+5 wherein hp(M) is a hash function (see par. 0076).
Therefore, it would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to modify the claimed generator polynomial equations with the generator polynomial equations of Dubrova because Dubrova teaches that a method and an apparatus for effectively verifying the integrity of data comprises computing the generator polynomial using a selected primitive polynomial based on GF(2). This modification would have been obvious because a person of ordinary skill in the art would have been motivated to employ a method for effectively detecting data integrity using the computations based on primitive polynomial of GF(2) as taught by Dubrova (see par. 0025 et seq.).
As per claims 6 and 13, Dubrova teaches that the coefficients can be either 0 or 1 (see par. 0074).
As per claims 7 to 8, 14 and 15, Dubrova teaches that the primitive polynomial has a lowest multiplication complexity among the primitive polynomials (see par. 0080).
Claim 16:
Dubrova substantially teaches the claimed invention. Dubrova teaches a method and an apparatus for generating a cryptographic checksum for a message, the apparatus comprising: a receiver device (900) having a processor (901) coupled to a memory (902) storing a computer program for causing the receiver to implement the method (see par. 0119). Dubrova teaches that the receiver receives a message encoded by a sending device, wherein the message is acquired and is fed into an algorithm (301) configured to calculate a first checksum (see par. 0058). Dubrova teaches that at the receiver a forward error correction (FEC) codeword (216) is received and fed into a FEC decoding algorithm (312) (see par. 0060). Dubrova teaches that the message and its checksum are outputted from the FEC decoder and fed into a checksum algorithm (301) to verify the integrity of the message (see par. 0061).
Dubrova teaches that cyclic redundancy checks (CRCs) are known as cryptographic hash and a CRC with a generator polynomial (p(x)) of degree n is capable of detecting all burst errors of length less than or equal to n (see par. 0062). Dubrova teaches that computing the cryptographic checksum is based on selecting a primitive polynomial from a set of primitive polynomials over a Galois Field GF(2) and then calculating a generator polynomial (see par. 0070). Dubrova teaches that the generator polynomial is calculated based on the selected primitive polynomial (see par. 0071).
Dubrova teaches steps for computing a second cryptographic checksum based on selecting a primitive polynomial and the computation of another generator polynomial (see par. 0098). Dubrova teaches that selecting the primitive polynomial and computing the generator polynomial are based on a Galois Field (see par. 0098). Dubrova teaches that the checksum decoder recomputes the check bits for the received message elements and a comparator compares the recomputed check bits with the check bits received in the message thereby verifying the integrity of the message (see par. 0105).
Dubrova fails to specifically teach wherein the second generator polynomial follows [Equation 1]
PNG
media_image1.png
291
778
media_image1.png
Greyscale
However, this teaching is obvious to the teachings of Dubrova since Dubrova teaches that a method and an apparatus for providing data integrity in the user plane comprises selecting a primitive polynomial p1(x) that is a of degree n-1 over Galois Field GF(2) and that the generator polynomial p(x) of degree n is represented as
PNG
media_image2.png
31
265
media_image2.png
Greyscale
(see par. 0075). Dubrova also teaches that a first function g may comprise an addition with a pad s of length n, i.e., g(hp(M)) = hp(M)+5 wherein hp(M) is a hash function (see par. 0076).
Therefore, it would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to modify the claimed generator polynomial equations with the generator polynomial equations of Dubrova because Dubrova teaches that a method and an apparatus to effectively verify the integrity of data comprises computing the generator polynomial using a selective primitive polynomial based on GF(2). This modification would have been obvious because a person of ordinary skill in the art would have been motivated to employ a method for effectively detecting data integrity using the computations based on primitive polynomial of GF(2) as taught by Dubrova (see par. 0025 et seq.).
As per claim 19, Dubrova teaches that the coefficients can be either 0 or 1 (see par. 0074).
As per claim 20, Dubrova teaches that the primitive polynomial has a lowest multiplication complexity among the primitive polynomials (see par. 0080).
Allowable Subject Matter
Claims 2 to 5, 10 to 12, 17 and 18 are objected to as being dependent upon a rejected base claim but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims.
The prior art made of record and not relied upon is considered pertinent to applicant's disclosure.
Das Sharma et al. (USPAP 2021/0119730) discloses a system, method and an apparatus for forward error correction and cyclic redundancy check mechanisms.
Lee et al. (USPAP 2006/0236212) discloses a decoder for digital communication.
Any inquiry concerning this communication or earlier communications from the examiner should be directed to SHELLY A CHASE whose telephone number is (571)272-3816. The examiner can normally be reached Mon-Thu 8:00-5:30, 2nd Friday 8:00-4:30.
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, Albert Decady can be reached at 571-272 3819. 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.
/Shelly A Chase/Primary Examiner, Art Unit 2112
Prosecution Insights