Prosecution Insights
Last updated: November 04, 2026
Application No. 18/478,068

CIRCUITRY AND METHODS FOR MATCHING PAIR ASYMMETRICAL ENCRYPTION PROVIDING A BIRTHDAY MODE OF OPERATION

Non-Final OA §103§112
Filed
Sep 29, 2023
Examiner
OKEKE, IZUNNA
Art Unit
2497
Tech Center
2400 — Computer Networks
Assignee
Inte Corporation
OA Round
1 (Non-Final)
82%
Grant Probability
Favorable
1-2
OA Rounds
0m
Est. Remaining
97%
With Interview

Examiner Intelligence

Grants 82% — above average
82%
Career Allowance Rate
618 granted / 756 resolved
+23.7% vs TC avg
Strong +15% interview lift
Without
With
+15.2%
Interview Lift
resolved cases with interview
Typical timeline
2y 11m
Avg Prosecution
17 currently pending
Career history
774
Total Applications
across all art units

Statute-Specific Performance

§101
5.3%
-34.7% vs TC avg
§103
34.5%
-5.5% vs TC avg
§102
42.3%
+2.3% vs TC avg
§112
9.1%
-30.9% vs TC avg
Black line = Tech Center average estimate • Based on career data from 756 resolved cases

Office Action

§103 §112
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 . Claim Rejections - 35 USC § 112 The following is a quotation of 35 U.S.C. 112(b): (b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention. The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph: The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention. Claims 5, 7, 12, 14 and 19 are rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor (or for applications subject to pre-AIA 35 U.S.C. 112, the applicant), regards as the invention. Claims 5, 7, 12, 14 and 19 recites the limitation "another locator bit". There is insufficient antecedent basis for this limitation in the claim. Claim Rejections - 35 USC § 103 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. 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. Claim(s) 1-20 are rejected under 35 U.S.C. 103 as being unpatentable over Alameldeen et al. (US-12,093,573), and further in view of Tkacik et al. (US-11,567,676). a. Referring to claims 1, 8 and 15: Regarding claims 1, 8 and 15, Alameldeen teaches an apparatus comprising: an execution circuitry to execute an instruction to generate a memory request to read a data line from memory (Col 4, Lines 42-47 and Col 13, Lines 37-40…. CPU/execution unit; memory requestors send read requests for cache lines); and a memory controller circuit to: determine that a field of the decrypted data line is set to a locator value for a repeated value (Fig. 5 and Col 8, Lines 24-25…. compressed flag C=7 with index fields IS, I1, I2), identify a first location of a first instance of the repeated value in the decrypted data line based on the locator value, read the repeated value from the first location in the decrypted data line (Col 8, Lines 43-55…. IS points to the selected base word; a removed word with delta of zero is the same value as the base word)), identify a second location in the decrypted data line for a second instance of the repeated value based on the locator value (Col 8, Lines 16-21 and 43-55…. I1, I2 point to where the removed words were), shift the decrypted data line to remove the locator value from the decrypted data line and to generate space for the repeated value to be inserted into the second location, and insert the repeated value into the space within the decrypted data line to generate a resultant data line (Fig. 4-5 and Col 7, Lines 5-34…. metadata occupies the space of the removed words ahead of remaining words; on a read the block is reconstructed with the removed words restored in their positions). Alameldeen is silent with respect to decrypting the data line into a decrypted line. However, decrypting a data line read from a memory in a memory controller is well known in the art and disclosed by Tkacik in Col 7, lines 4-13 (read IEE of the memory controller decrypts data read from the DRAM in response to a read command from the core) and Col 6, Line 60 thru Col 7, Line 2 (write IEE encrypts data before it is written to the DRAM). Therefore it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of Alameldeen by encrypting the compressed block before it is written and decrypting it on a read before it is reconstructed as taught by Tkacik for the purpose of protecting the data stored in external memory from an attacker who snoops the path between the processor and memory. a. Referring to claims 2, 9 and 16: Regarding claims 2, 9 and 16, the combination of Alameldeen and Tkacik teaches the apparatus of claim 1, wherein the memory controller circuit is to shift bits in the decrypted data line to the left of the second location by a width of the repeated value to remove the locator value and generate the space for the repeated value to be inserted into the second location, and not shift bits in the decrypted data line to the right of the second location (See Alameldeen, Fig. 5 and Col 8, Lines 24-55…. metadata sits at the left end in the space of the removed 16-bit words; restoring a removed word moves the words to its left back over the metadata while the words to the right of the removed position keep their place). a. Referring to claims 3, 10 and 17: Regarding claims 3, 10 and 17, the combination of Alameldeen and Tkacik teaches the apparatus of claim 1, wherein the memory controller circuit is to determine that the field of the decrypted data line is not set to a conflict indicator value, and perform the identify the first location, the read, the identify the second location, the shift, and the insert in response to the determination that the field of the decrypted data line is not set to the conflict indicator value (See Alameldeen, Col 7, lines 5-28, Col 9, Lines 10-15 and Col 13, Lines 26-35…. compressed flag C=0 marks an unsuccessful compression with overflow data stored separately; compressed block with C=7 is decompressed). a. Referring to claims 4, 11 and 18: Regarding claims 4, 11 and 18, the combination of Alameldeen and Tkacik teaches the apparatus of claim 1, wherein the locator value comprises a first value to indicate the first location of the first instance of the repeated value within a first proper subset of the decrypted data line, and a second value to indicate an offset within a second proper subset of the decrypted data line (See Alameldeen, Fig. 5 and 6, Col 9, Lines 16-35 and Col 10, Lines 29-37…. IS or IA locates the base word, and the 4-bit I1/I2 give the position of the removed word, within a 32B chunk of a 64B line). a. Referring to claims 5, 12 and 19: Regarding claims 5, 12 and 19, the combination of Alameldeen and Tkacik teaches The apparatus of claim 1, wherein the memory controller circuit is further to check another locator bit of the decrypted data line, wherein the bit being set to a first value indicates to the memory controller circuit that the first location and the second location of the repeated value are in a first half of the decrypted data line, and the bit being set to a second value indicates to the memory controller circuit that the first location and the second location of the repeated value are in a second half of the decrypted data line (See Alameldeen, Col 10, Lines 29-45…. for a 64B line, compression is performed in either the top or bottom 32B chunk, and the compressed flag of the chunk indicates which half holds the base and removed words). a. Referring to claims 6, 13 and 20: Regarding claims 6, 13 and 20, the combination of Alameldeen and Tkacik teaches the apparatus of claim 1, wherein the memory controller circuit is further to: receive a second data line for writing to the memory; search the second data line for a repeated value; determine that the repeated value in the second data line is identifiable using a second locator value for a repeated value in the second data line; in response to the determination, generate the second locator value for the repeated value in the second data line, remove a second instance of the repeated value from the second data line, and insert the second locator value into the second data line (See Alameldeen, Col 7 Lines 5-19 and Col 8, Lines 57 thru Col 9, Line 10…. on a write, words matching the base are found, I1/i2 are set, the words are removed and the metadata is placed in their space); encrypt the second data line that includes the second locator value into an encrypted data line; and cause a write of the encrypted data line to the memory (See Tkacik, Col 6, Line 60 thru Col 7, Line 2…. write IEE encrypts data before it is written to the DRAM). a. Referring to claims 7 and 14: Regarding claims 7 and 14, the combination of Alameldeen and Tkacik teaches the apparatus of claim 6, wherein the memory controller circuit is further to, before the encrypt, set another locator bit of the second data line to a first value in response to a first instance and a second instance of the repeated value in the second data line being in a first half of the second data line, and to a second value in response to the first instance and the second instance of the repeated value in the second data line being in a second half of the second data line (See the rejection in claims 5 and 6; Alameldeen, Col 10, Lines 29-45…. Flag set for the top or bottom 32B chunk that is compressed on the write). Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to IZUNNA OKEKE whose telephone number is (571)270-3854. The examiner can normally be reached Mon - Fri 8 - 4 EST. 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, ELENI SHIFERAW can be reached at (571) 272-3867. 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. /IZUNNA OKEKE/Primary Examiner, Art Unit 2497
Read full office action

Prosecution Timeline

Sep 29, 2023
Application Filed
Dec 04, 2023
Response after Non-Final Action
Oct 30, 2026
Non-Final Rejection mailed — §103, §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12786698
METHOD FOR CHANGING THE VALUE OF ONE OR MORE PRIVACY PARAMETERS OF STATIONS WITHIN A BASIC SERVICE SET
2y 4m to grant Granted Nov 03, 2026
Patent 12772057
STORE AND FORWARD SATELLITE ACCESS WITH DISCONTINUOUS FEEDER LINKS AND IMPROVED SECURITY
3y 0m to grant Granted Oct 20, 2026
Patent 12771692
RULE-BASED APPLICATION ACCESS MANAGEMENT
2y 1m to grant Granted Oct 20, 2026
Patent 12755060
MEMORY SYSTEMS AND DEVICES INCLUDING EXAMPLES OF GENERATING ACCESS CODES FOR MEMORY REGIONS USING AUTHENTICATION LOGIC
2y 8m to grant Granted Oct 06, 2026
Patent 12750226
PERSISTENT LOGIN
1y 9m to grant Granted Sep 29, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
82%
Grant Probability
97%
With Interview (+15.2%)
2y 11m (~0m remaining)
Median Time to Grant
Low
PTA Risk
Based on 756 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month