Prosecution Insights
Last updated: November 21, 2026
Application No. 19/142,847

DATA ENCRYPTION AND DECRYPTION PROCESSING METHOD AND APPARATUS, ELECTRONIC DEVICE, AND STORAGE MEDIUM

Non-Final OA §101§103
Filed
Jun 24, 2025
Priority
Jan 18, 2023 — CN 202310067239.X +1 more
Examiner
REAGAN, JAMES A
Art Unit
3697
Tech Center
3600 — Transportation & Electronic Commerce
Assignee
Suzhou Metabrain Intelligent Technology Co., Ltd.
OA Round
1 (Non-Final)
72%
Grant Probability
Favorable
1-2
OA Rounds
2y 3m
Est. Remaining
91%
With Interview

Examiner Intelligence

Grants 72% — above average
72%
Career Allowance Rate
642 granted / 897 resolved
+19.6% vs TC avg
Strong +20% interview lift
Without
With
+19.8%
Interview Lift
resolved cases with interview
Typical timeline
3y 8m
Avg Prosecution
40 currently pending
Career history
937
Total Applications
across all art units

Statute-Specific Performance

§101
24.6%
-15.4% vs TC avg
§103
51.1%
+11.1% vs TC avg
§102
5.9%
-34.1% vs TC avg
§112
11.4%
-28.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 897 resolved cases

Office Action

§101 §103
DETAILED ACTION Acknowledgments The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . This action is in reply to the application and the preliminary amendment each filed on 06/24/2025. Claims 1-10, 12-16, 18, 20, 22, and 23 have been amended. Claims 11, 19, and 21 have been canceled. Claims 1-10, 12-18-20, 22, and 23 are currently pending and have been examined. Information Disclosure Statement The Information Disclosure Statement filed on 06/24/2025 has been considered. An initialed copy of the Form 1449 is enclosed herewith. 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-10, 12-18-20, 22, and 23 are rejected under 35 U.S.C. 101 because the claimed invention is directed to non-patent eligible subject matter because the claim(s) as a whole, considering all claim elements both individually and in combination, do not amount to significantly more than an abstract idea. Step 1: The claims recite a process, system, apparatus, article of manufacture, and/or a nontransitory storage medium with instructions, each of which are proper statutory categories. Step 2A (prong 1): Claim 1 (representative of claims 22 and 23): The claim limitations are grouped as shown immediately following: A data encryption and decryption processing method, applied to a host end that communicates with both a e first processor and a second processor, the first processor and the second processor being located in different hardware computing devices, the method comprising: (Certain Methods Of Organizing Human Activity - managing personal behavior or relationships or interactions between people including following rules or instructions) in response to receiving a write instruction for target data, writing, by the first processor, the target data in the host end into a first buffer, and encrypting the target data in the first buffer; (Certain Methods Of Organizing Human Activity - managing personal behavior or relationships or interactions between people including following rules or instructions) writing, by the second processor, the target data that has been encrypted in the first buffer into a non-transient storage medium; (Certain Methods Of Organizing Human Activity - managing personal behavior or relationships or interactions between people including following rules or instructions) in response to receiving a read instruction for the target data, reading, by the second processor, the encrypted target data in the non-transient storage medium into a second buffer; (Certain Methods Of Organizing Human Activity - managing personal behavior or relationships or interactions between people including following rules or instructions) decrypting, by the first processor, the encrypted target data, and returning the target data that has been decrypted in the second buffer to the host end. (Certain Methods Of Organizing Human Activity - managing personal behavior or relationships or interactions between people including following rules or instructions) Additional dependent claims 10, 12-18, 19, and 20 do not appear remedy the deficiency. Step 2A (prong 2): Claim 1 (representative of claims 22 and 23): …a first processor …a second processor …a first buffer …a second buffer … non-transient storage medium …an electronic device …a communication interface …a memory …a communication bus … non-transient computer readable storage medium These remaining claim limitations are delineated as shown immediately preceding. The abstract idea is not integrated into a practical application. There are no improvements to the functioning of a computer, other technology or technical field, a particular machine is not cited, nothing is transformed to a different state or thing, the abstract idea is not more than a drafting effort designed to monopolize the abstract idea. The claim merely uses a computer as a tool to perform the abstract idea, which is generally linked to a particular field of use, in this case, marketing and advertising. Thus, these limitations are recited at a high-level of generality (i.e., as a generic processor and memory performing a generic computer function of processing and storing data) such that it amounts no more than mere instructions to apply the exception using a generic computer component – MPEP 2106.05(f). Further, receiving data, evaluating data and distributing data are data gathering and data outputting, which has no effect on technology and does no more than generally link the use of the judicial exception to a particular technological environment or field of use – see MPEP 2106.05(h). Step 2B: The claim limitations do not provide an Inventive Concept. The claim limitations do not recite additional elements that amount to significantly more that the abstract idea because the additional elements of the system comprising a computer processor, computer readable storage medium with instructions, and a memory configured to store information, each recited at a high level of generality in a computer network which only perform the universal computer functions of accessing, receiving, storing, and processing data, transmitting and presenting information. Taking the elements both individually and as an ordered combination, the function performed by the computer at each step of the process is purely orthodox. Using a computer to obtain and display data are some of the most basic functions of a computer. As shown, the individual limitations claimed are some of the most rudimentary functions of a computer. The technical solution described in this invention does not alter hardware structure or its routine, does not transform the character of the information being processed, does not identify a novel source or type of data, does not advance the functionality of a computer as a tool, and does not incorporate specific rules enabling the computer to accomplish innovative utilities. In summary, the individual step and/or component does no more than require a general computer to perform standard computer functions. As discussed above with respect to integration of the abstract idea into a practical application, the additional element of a computer devices amounts to no more than mere instructions to apply the exception using a generic computer component - requiring the use of software to tailor information and provide it to the user on a generic computer, Intellectual Ventures I LLC v. Capital One Bank (USA), 792 F.3d 1363, 1370-71, 115 USPQ2d 1636, 1642 (Fed. Cir. 2015); 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 of this title, 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-3, 6, 7, 12, 13, 16, 22, and 23 are rejected under U.S.C. 103 as being unpatentable over Miller et al. (USPGP 2021/0216478 A1), hereinafter MILLER. Claims 1, 22, 23: MILLER as shown below discloses the following limitations: A data encryption and decryption processing method, applied to a host end that communicates with both a first processor and a second processor, the first processor and the second processor being located in different hardware computing devices, the method comprising: (see at least Figure 1A as well as associated and related text) in response to receiving a write instruction for target data, writing, by the first processor, the target data in the host end into a first buffer, and encrypting the target data in the first buffer; (see at least paragraphs 0028, 0030, 0125, 0131, 0114) writing, by the second processor, the target data that has been encrypted in the first buffer into a non-transient storage medium; (see at least paragraphs 0028, 0030, 0125, 0131, 0114) in response to receiving a read instruction for the target data, reading, by the second processor, the encrypted target data in the non-transient storage medium into a second buffer; (see at least paragraphs 0028, 0030, 0125, 0131, 0114, 0360) decrypting, by the first processor, the encrypted target data, and returning the target data that has been decrypted in the second buffer to the host end. (see at least paragraphs 0028, 0030, 0125, 0131, 0114, 0402-0405) MILLER does not specifically disclose each of the above limitations within a single embodiment. In this case, each of the elements claimed are all shown by the prior art of record but not combined as claimed. However, the technical ability exists to combine the elements as claimed and the results of the combination are predictable. Therefore, when combined, the elements perform the same function as they did separately. (KSR v. Teleflex, 127 S. Ct. 1727 (2007)). Consequently, it would have been obvious to one of ordinary skill in the art at the effective filing date to modify the method of MILLER “…for detecting a possible security threat against a storage system, performing one or more remedial actions in response to detecting the possible security threat.” (MILLER: paragraph 0024). Additionally, there is a recognized problem or need in the art including market pressure, design need, etc., and there are a finite number of identified predictable solutions. Accordingly, those in the art could have pursued known solutions with reasonable expectation of success. (KSR v. Teleflex, 127 S. Ct. 1727 (2007)). Fundamentally, in the competitive business climate, there is a profit-driven motive to maximize the profitability of goods and services that are provided or marketed to customers. Enterprises typically use business planning to make decisions in order to maximize profits. Claim 2: MILLER discloses the limitations as shown in the rejections above. MILLER further discloses the following limitations: wherein before writing, by the first processor, the target data into a first buffer, the method further comprises: determining whether the target data needs to be encrypted by analyzing the write instruction via the first processor; in response to determining that the target data needs to be encrypted, performing the writing, by the first processor, the target data into a first buffer, and encrypting the target data in the first buffer. See at least paragraphs 0028, 0030, 0125, 0131, and 0114. Claim 3: MILLER discloses the limitations as shown in the rejections above. MILLER further discloses the following limitations: wherein after determining whether the target data needs to be encrypted, the method further comprises: in response to determining that the target data does not need to be encrypted, writing, by the first processor, the target data into the first buffer; writing, by the second processor, the target data in the first buffer into the non-transient storage medium. See at least paragraphs 0028, 0030, 0125, 0131, and 0114. Claims 6, 7: MILLER discloses the limitations as shown in the rejections above. MILLER further discloses the following limitations: wherein the writing, by the first processor, the target data into the first buffer comprises: applying, by the first processor, for the first buffer, and writing the target data into the first buffer. wherein after writing, by the first processor, the target data into the first buffer, the method further comprises: transmitting, by the first processor, a preliminary data write completion instruction to the host end, the preliminary data write completion instruction being used for releasing the host end See at least paragraphs 0028, 0030, 0125, 0131, and 0114. Claims 12, 13: MILLER discloses the limitations as shown in the rejections above. MILLER further discloses the following limitations: wherein before the reading, by the second processor, the encrypted target data in the non-transient storage medium into the second buffer, the method further comprises: determining whether the target data needs to be decrypted by analyzing the write instruction via the first processor; in response to determining that the target data needs to be decrypted, performing the reading, by the second processor, the encrypted target data in the non-transient storage medium into the second buffer; decrypting, by the first processor, the encrypted target data. wherein after determining whether the target data needs to be decrypted, the method further comprises: in response to determining that the target data does not need to be decrypted, reading, by the second processor, the target data in the non-transient storage medium into the second buffer; returning, by the e first processor, the target data in the second buffer to the host end. See at least paragraphs 0402-0405. Claim 16: MILLER discloses the limitations as shown in the rejections above. MILLER further discloses the following limitations: wherein the reading, by the second processor, the encrypted target data in the non-transient storage medium into the second buffer comprises: applying, by the second processor, for the second buffer, and writing the encrypted target data in the non-transient storage medium into the second buffer. See at least paragraphs 0028, 0030, 0125, 0131, and 0114. Claims 4, 5, 8-10, 14, 15, 17, 18, and 20 are rejected under U.S.C. 103 as being unpatentable over MILLER and further in view of Examiner’s OFFICIAL NOTICE. Claims 4, 14: MILLER discloses the limitations as shown in the rejections above. MILLER further discloses NV Me and database tables. See at least paragraphs 0030 and 0376. MILLER does not specifically disclose: wherein the determining whether the target data needs to be encrypted by analyzing the write instruction via the first processor comprises: parsing, by the first processor, slab field and nlb field from the write instruction, and determining whether the target data corresponding to the slba field and the nlb field needs to be encrypted by looking up a table. However, the Examiner takes OFFICIAL NOTICE that it is old and well known in the NVMe arts that SLBA (Starting Logical Block Address) and NLB (Number of Logical Blocks) are core command fields used in storage protocols like NVMe to specify the disk location and amount of data to read or write. Therefore, it would have been obvious to one of ordinary skill in the art at the effective filing date to combine/modify the method of MILLER with the technique of NVMe because there is a recognized problem or need in the art including market pressure, design need, etc., and there are a finite number of identified predictable solutions. Consequently, those in the art could have pursued known solutions with reasonable expectation of success. (KSR v. Teleflex, 127 S. Ct. 1727 (2007)). In the competitive business climate, there is a profit-driven motive to maximize the profitability of goods and services that are provided or marketed to customers. Enterprises typically use business planning to make decisions in order to maximize profits. Claims 5, 15: MILLER discloses the limitations as shown in the rejections above. MILLER further discloses flagging data. See at least paragraph 0396. MILLER does not specifically disclose: wherein after determining whether the target data needs to be encrypted, the method further comprises: establishing a flag bit in context of the write instruction by the first processor; in response to determining that the target data needs to be encrypted, setting the flag bit to 1; in response to determining that the target data does not need to be encrypted, setting the flag bit to 0. However, the Examiner takes OFFICIAL NOTICE that it is old and well known in the programming arts to bit flag a data array. Therefore, it would have been obvious to one of ordinary skill in the art at the effective filing date to combine/modify the method of MILLER with the technique of flagging data because there is a recognized problem or need in the art including market pressure, design need, etc., and there are a finite number of identified predictable solutions. Consequently, those in the art could have pursued known solutions with reasonable expectation of success. (KSR v. Teleflex, 127 S. Ct. 1727 (2007)). In the competitive business climate, there is a profit-driven motive to maximize the profitability of goods and services that are provided or marketed to customers. Enterprises typically use business planning to make decisions in order to maximize profits. Claim 8-10: MILLER discloses the limitations as shown in the rejections above. MILLER further discloses granularity with low time. See at least paragraphs 0485-0486. MILLER does not specifically disclose: wherein the encrypting the target data in the first buffer comprises: encrypting the target data of a LBA granularity in the first buffer; wherein a source address of the target data of the LBA granularity before encryption and a destination address of the target data of the LBA granularity after encryption are the same. wherein the encrypting the target data of the LBA granularity in the first buffer comprises: traversing the first buffer, and extracting the target data of the LBA granularity from the first buffer; transmitting the target data of the LBA granularity to a third processor for encryption. wherein the transmitting the target data of the LBA granularity to the third processor for encryption further comprises: in response to failing in transmitting the target data of the LBA granularity to the third processor, recording a position of the target data of the LBA granularity that has been encrypted; in response to determining that a transmission link between the first buffer and the third processor is restored, transmitting the target data of the LBA granularity located next to the position to the third processor for encryption. However, the Examiner takes OFFICIAL NOTICE that it is old and well known in the computing arts that LBA (Logical Block Addressing) granularity refers to the size of the individual data blocks or sectors that a storage device presents and manages as distinct addressable units to a host operating system. Therefore, it would have been obvious to one of ordinary skill in the art at the effective filing date to combine/modify the method of MILLER with the technique of determining the granularity of storage of data because there is a recognized problem or need in the art including market pressure, design need, etc., and there are a finite number of identified predictable solutions. Consequently, those in the art could have pursued known solutions with reasonable expectation of success. (KSR v. Teleflex, 127 S. Ct. 1727 (2007)). In the competitive business climate, there is a profit-driven motive to maximize the profitability of goods and services that are provided or marketed to customers. Enterprises typically use business planning to make decisions in order to maximize profits. Claims 17, 18, 20: MILLER discloses the limitations as shown in the rejections above. MILLER further discloses granularity with low time. See at least paragraphs 0485-0486. MILLER does not specifically disclose: wherein the decrypting the encrypted target data comprises: decrypting the target data of the LBA granularity in the second buffer. wherein the decrypting the target data of the LBA granularity in the second buffer comprises: traversing the second buffer, and determining the target data of the LBA granularity in the second buffer; decrypting the target data of the LBA granularity wherein a source address of the target data of the LBA granularity before decryption and a destination address of the target data of the LBA granularity after decryption are the same. wherein after returning the decrypted target data in the second buffer to the host end, the method further comprises: in response to receiving a rewrite instruction for the decrypted target data, encrypting, by the data management module first processor, the decrypted target data in the second buffer; writing, by the data write processing module second processor, the target data that has been encrypted in the second buffer into the non-transient storage medium. However, the Examiner takes OFFICIAL NOTICE that it is old and well known in the computing arts that LBA (Logical Block Addressing) granularity refers to the size of the individual data blocks or sectors that a storage device presents and manages as distinct addressable units to a host operating system. Therefore, it would have been obvious to one of ordinary skill in the art at the effective filing date to combine/modify the method of MILLER with the technique of determining the granularity of storage of data because there is a recognized problem or need in the art including market pressure, design need, etc., and there are a finite number of identified predictable solutions. Consequently, those in the art could have pursued known solutions with reasonable expectation of success. (KSR v. Teleflex, 127 S. Ct. 1727 (2007)). In the competitive business climate, there is a profit-driven motive to maximize the profitability of goods and services that are provided or marketed to customers. Enterprises typically use business planning to make decisions in order to maximize profits. CONCLUSION The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Non-Patent Literature: IBM. “NVMe concepts.” (Apr. 22, 2021). Retrieved online 09/27/2026. NVMe concepts - IBM Documentation. Relevancy: “NVMe (non-volatile memory express) is a host controller interface and storage protocol created to accelerate the transfer of data between enterprise and client systems and solid-state drives (SSD) over a computer's high-speed Peripheral Component Interconnect Express (PCIe) bus.” (Abstract/Introduction) NVm Express. FAQ. (Feb. 05, 2020). Retrieved online 09/27/2026. Frequently Asked Questions - NVM Express Foreign Art: ISHIKAWA et al. “Storage Controller, Has Command Processor That Migrate Data Stored In Migration-targeted Second Real Storage Area To Migration-destination First Real Storage Area Stored By Migration-destination Storage Unit During Command Processing.” (WO 2011/042940 A1) Relevancy: “The controller (1) has a migration destination determination unit that selects a migration-targeted second real storage area from among the respective second real storage areas associated with the virtual volume. A migration-destination storage unit associates the migration-targeted second real storage area with the migration-destination first real storage area. A command processor migrate the data stored in the migration-targeted second real storage area to migration-destination first real storage area stored by the migration-destination storage unit during command processing.” (Abstract/Introduction) KHIN et al. “Method Of Accessing Data Storage Device, By Reading Data From Data Storage Device Or Writing Data To Data Storage Device Using Second Key Which Is Obtained From First Key And Assigned To Logical Unit Of Stored Data.” (WO 2010/085211 A1) Relevancy: “The method involves: transforming a first key to obtain a second key; assigning the second key to a logical unit of data stored in the data storage device (238); and using the second key to read data from the data storage device or to write data to the data storage device.” (Abstract/Introduction) HAMADA et al. “Data Storage Apparatus For Storing Information Has Key Management Block.” (WO 02073872 A1). Relevancy: “In an encryption storage apparatus (data storage apparatus) (1), when an allocation request signal (a1) is input, a key management block (7) outputs a generation request signal (b) to a random number generation block (3). Upon reception of the generation request signal, the random number generation block generates a pseudo-random number as an encryption key (c).” (Abstract/Introduction) Any inquiry of a general nature or relating to the status of this application or concerning this communication or earlier communications from the Examiner should be directed to James A. Reagan (james.reagan@uspto.gov) whose telephone number is 571.272.6710. The Examiner can normally be reached Monday through Friday from 9 AM to 5 PM. If attempts to reach the examiner by telephone are unsuccessful, the Examiner’s supervisor, John Hayes, can be reached at 571.272.6708. Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://portal.uspto.gov/external/portal/pair . Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866.217.9197 (toll-free). Any response to this action should be mailed to: Commissioner for Patents PO Box 1450 Alexandria, Virginia 22313-1450 or faxed to 571-273-8300. Hand delivered responses should be brought to the United States Patent and Trademark Office Customer Service Window: Randolph Building 401 Dulany Street Alexandria, VA 22314. /JAMES A REAGAN/Primary Examiner, Art Unit 3697 james.reagan@uspto.gov 571.272.6710 (Office) 571.273.6710 (Desktop Fax)
Read full office action

Prosecution Timeline

Jun 24, 2025
Application Filed
Sep 30, 2026
Non-Final Rejection mailed — §101, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12792400
METHODS AND APPARATUS TO GENERATE AND MANAGE LOGICAL WORKLOAD DOMAIN CLUSTERS IN A COMPUTING ENVIRONMENT
3y 1m to grant Granted Nov 10, 2026
Patent 12792402
CONVERSATION RESOURCE DEALLOCATION SYSTEM
2y 12m to grant Granted Nov 10, 2026
Patent 12775936
ELECTRONIC PAYMENT PROCESSING USING ADJUSTED INTERCHANGE RATE
1y 5m to grant Granted Oct 27, 2026
Patent 12762536
SYSTEMS AND METHODS FOR PROVISIONING TRANSACTION CARDS TO MULTIPLE MERCHANTS
3y 5m to grant Granted Oct 13, 2026
Patent 12762585
SYSTEM OF DEMAND MODELING AND PRICE CALCULATION BASED ON INTERPOLATED MARKET PRICE ELASTICITY FUNCTIONS
2y 9m to grant Granted Oct 13, 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
72%
Grant Probability
91%
With Interview (+19.8%)
3y 8m (~2y 3m remaining)
Median Time to Grant
Low
PTA Risk
Based on 897 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