IP Library Granted Patent US 12,367,282
Granted Patent B2
US 12,367,282 · App. 18/600,516 · Granted Jul 22, 2025

Bit-level data extraction and threat detection

Inventors: Garrett Thomas Oetken (Post Falls, ID); Henry Stoltenberg (Walnut Creek, CA)
Assignee: Quantum Star Technologies Inc.
G06F21/562G06N7/01G06N20/00G06F2221/033
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,367,282
App. No.
18/600,516
Filed
Mar 8, 2024
Granted
Jul 22, 2025
Kind
B2
Art Unit
2432
USPC
726/23
Abstract

Techniques and architectures include representing data with one or more n-dimensional representations and using one or more analysis models to identify target properties associated with the one or more n-dimensional representations. For example, data can be represented as a plurality of points in a coordinate system. A set of points in the plurality of points can be identified and an n-dimensional model can be generated for the set of points. The n-dimensional model can be compared to a plurality of n-dimensional models that are tagged as including a target property associated with malicious behavior, benign behavior, and/or a vulnerability. Based on the comparison, a likelihood can be determined that the data includes the target property.

Claims (71)

1. A system comprising:

control circuitry; and

memory communicatively coupled to the control circuitry and storing executable instructions that, when executed by the control circuitry, cause the control circuitry to perform operations comprising:

receiving network traffic data that includes a plurality of bits, the network traffic data being structured in a first format;

extracting a first set of bits from the plurality of bits;

determining a first coordinate for a first point based on the first set of bits;

extracting a second set of bits from the plurality of bits;

determining a second coordinate for the first point based on the second set of bits;

extracting a third set of bits from the plurality of bits;

determining a first coordinate for a second point based on the third set of bits;

extracting a fourth set of bits from the plurality of bits;

determining a second coordinate for the second point based on the fourth set of bits;

mapping the first point and the second point to an n-dimensional space;

using a pattern recognition algorithm to identify a set of points represented in the n-dimensional space;

generating an n-dimensional model for the set of points and storing n-dimension data for the n-dimensional model in a data structure;

processing the n-dimensional model with an Artificial Intelligence (AI) model that is configured to detect data security issues;

based on the processing, determining that the network traffic data includes a data security issue;

removing a portion of the network traffic data that is associated with the data security issue from the network traffic data; and

sending the network traffic data to a device.

2. The system of claim 1 , wherein the processing is based on at least one of a shape of the n-dimensional model, a size of the n-dimensional model, a volume of the n-dimensional model, an area of the n-dimensional model, a number of surfaces of the n-dimensional model, a location of the n-dimensional model within the n-dimensional space, a position of the n-dimensional model relative to another n-dimensional model within the n-dimensional space, or a number of n-dimensional models within the n-dimensional space.

3. The system of claim 1 , wherein the operations further comprise:

determining at least one of a type of the data security issue based on at least one of a shape of the n-dimensional model, a size of the n-dimensional model, a volume of the n-dimensional model, an area of the n-dimensional model, a number of surfaces of the n-dimensional model, a location of the n-dimensional model within the n-dimensional space, a position of the n-dimensional model relative to another n-dimensional model within the n-dimensional space, or a number of n-dimensional models within the n-dimensional space that are associated with the data security issue.

4. The system of claim 1 , wherein the second set of bits are separated from the first set of bits by a particular number of bits.

5. The system of claim 1 , wherein the third set of bits are separated from the second set of bits by a particular number of bits.

6. The system of claim 1 , wherein the first and second sets of bits are located within a beginning portion of the network traffic data and the third and fourth sets of bits are located within an end portion of the network traffic data.

7. The system of claim 1 , wherein the first, second, third, and fourth sets of bits each comprise a same number of bits.

8. A method comprising:

receiving, by control circuitry, network traffic data that includes a plurality of bits, the network traffic data being structured in a first format;

extracting, by the control circuitry, a first set of bits from the plurality of bits;

determining a set of coordinates for a first point based on the first set of bits;

extracting, by the control circuitry, a second set of bits from the plurality of bits;

determining a set of coordinates for a second point based on the second set of bits;

mapping, by the control circuitry, the first point and the second point to an n-dimensional space;

generating an n-dimensional model based on the first point and the second point;

processing the n-dimensional model with an Artificial Intelligence (AI) model that is configured to detect data security issues;

based on the processing, determining that the network traffic data includes a data security issue; and

removing a portion of the network traffic data that is associated with the data security issue from the network traffic data.

9. The method of claim 8 , wherein the second set of bits are separated from the first set of bits by a particular number of bits within the plurality of bits.

10. The method of claim 8 , wherein the first set of bits are located within a beginning portion of the network traffic data and the second set of bits are located within an end portion of the network traffic data.

11. The method of claim 8 , wherein the first and second sets of bits each comprise a same number of bits.

12. The method of claim 8 , further comprising:

generating a first confidence value from the processing, the first confidence value indicating a first likelihood that the network traffic data includes the data security issue;

processing the n-dimensional model with another AI model;

generating a second confidence value indicating a second likelihood that the network traffic data includes the data security issue; and

determining a composite confidence value for the network traffic data based on the first confidence value and the second confidence value;

wherein determining that the network traffic data includes the data security issue is based on the composite confidence value.

13. The method of claim 12 , wherein the first likelihood indicates a likelihood that the network traffic data includes malware.

14. A network device comprising:

one or more network interfaces configured to receive, via a network connection, network traffic data that includes a plurality of bits;

memory storing executable instructions; and

control circuitry communicatively coupled to the memory and configured to execute the executable instructions to:

extract a first set of bits from the plurality of bits;

determine a set of coordinates for a first point based on the first set of bits;

extract a second set of bits from the plurality of bits;

determine a set of coordinates for a second point based on the second set of bits;

map the first point and the second point to an n-dimensional space;

generate an n-dimensional model based on the first point and the second point;

process the n-dimensional model with an Artificial Intelligence (AI) model that is configured to detect data security issues;

based on the processing, determine that the network traffic data includes a data security issue; and

remove a portion of the network traffic data that is associated with the data security issue from the network traffic data.

15. The network device of claim 14 , wherein the second set of bits are separated from the first set of bits by a particular number of bits within the plurality of bits.

16. The network device of claim 14 , wherein the first set of bits are located within a beginning portion of the network traffic data and the second set of bits are located within an end portion of the network traffic data.

17. The network device of claim 14 , wherein the first and second sets of bits each comprise a same number of bits.

18. The network device of claim 14 , wherein the control circuitry is further configured to:

generate a first confidence value from the processing, the first confidence value indicating a first likelihood that the network traffic data includes the data security issue;

process the n-dimensional model with another AI model;

generate a second confidence value indicating a second likelihood that the network traffic data includes the data security issue; and

determine a composite confidence value for the network traffic data based on the first confidence value and the second confidence value;

wherein the control circuitry is configured to determine that the network traffic data includes the data security issue is based on the composite confidence value.

19. The network device of claim 18 , wherein the first likelihood indicates a likelihood that the network traffic data includes malware.

20. The network device of claim 18 , wherein the control circuitry is configured to determine that the network traffic data includes the data security issue by comparing the composite confidence value to a threshold.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 11, 2025
From: OETKEN, GARRETT THOMAS; STOLTENBERG, HENRY
To: QUANTUM STAR TECHNOLOGIES INC.
Reel/Frame 070186/0128 →
Continuity (2)
Continuation 17185884 · Feb 25, 2021
Related Publication 20240330453A1 · Oct 3, 2024
References Cited (243)
US 7209221B2 · Breed et al. · 2007 [cited by applicant]
US 7593013B2 · Agutter et al. · 2009 [cited by applicant]
US 7836504B2 · Ray et al. · 2010 [cited by applicant]
US 8042184B1 · Batenin · 2011 [cited by examiner]
US 8131565B2 · Dicks et al. · 2012 [cited by applicant]
US 8131566B2 · Dicks et al. · 2012 [cited by applicant]
US 8151352B1 · Novitchi · 2012 [cited by applicant]
US 8364136B2 · Hoffberg et al. · 2013 [cited by applicant]
US 8392996B2 · Oliver et al. · 2013 [cited by applicant]
US 8468244B2 · Redlich et al. · 2013 [cited by applicant]
US 8516266B2 · Hoffberg et al. · 2013 [cited by applicant]
US 8533581B2 · Krall et al. · 2013 [cited by applicant]
US 8584241B1 · Jenks et al. · 2013 [cited by applicant]
US 8701192B1 · Glick et al. · 2014 [cited by applicant]
US 8949233B2 · Hsiao et al. · 2015 [cited by applicant]
US 9104870B1 · Qu et al. · 2015 [cited by applicant]
US 9164679B2 · Smith · 2015 [cited by applicant]
US 9182914B1 · Smith · 2015 [cited by applicant]
US 9332028B2 · Xaypanya et al. · 2016 [cited by applicant]
US 9432298B1 · Smith · 2016 [cited by applicant]
US 9525696B2 · Kapoor et al. · 2016 [cited by applicant]
US 9588872B2 · Revanna et al. · 2017 [cited by applicant]
US 9684775B2 · Gupta et al. · 2017 [cited by applicant]
US 9690938B1 · Saxe et al. · 2017 [cited by applicant]
US 9712532B2 · Krall et al. · 2017 [cited by applicant]
US 9910986B1 · Saxe et al. · 2018 [cited by applicant]
US 9922190B2 · Antonakakis et al. · 2018 [cited by applicant]
US 9998483B2 · Sukhomlinov et al. · 2018 [cited by applicant]
US 10073972B2 · Saxena et al. · 2018 [cited by applicant]
US 10193902B1 · Caspi et al. · 2019 [cited by applicant]
US 10218718B2 · Kopp et al. · 2019 [cited by applicant]
US 10235519B2 · Guy et al. · 2019 [cited by applicant]
US 10248533B1 · Shah · 2019 [cited by examiner]
US 10303875B1 · Saxe et al. · 2019 [cited by applicant]
US 10333965B2 · Gathala et al. · 2019 [cited by applicant]
US 10339593B2 · Beckham · 2019 [cited by applicant]
US 10346465B2 · Gao et al. · 2019 [cited by applicant]
US 10395032B2 · Keller et al. · 2019 [cited by applicant]
US 10552292B2 · Olshanetsky et al. · 2020 [cited by applicant]
US 10552727B2 · Caspi et al. · 2020 [cited by applicant]
US 10601783B2 · Ickes et al. · 2020 [cited by applicant]
US 10609050B2 · Caspi et al. · 2020 [cited by applicant]
US 10656724B2 · Kramer et al. · 2020 [cited by applicant]
US 10664602B2 · Grafi · 2020 [cited by applicant]
US 10692004B1 · Segev · 2020 [cited by applicant]
US 10703381B2 · Bender et al. · 2020 [cited by applicant]
US 10789526B2 · Wilson et al. · 2020 [cited by applicant]
US 10803174B2 · Oetken · 2020 [cited by applicant]
US 10817602B2 · Ladnai et al. · 2020 [cited by applicant]
US 10819718B2 · David et al. · 2020 [cited by applicant]
US 10824722B1 · Tevet et al. · 2020 [cited by applicant]
US 10839955B2 · Accomazzi et al. · 2020 [cited by applicant]
US 10877752B2 · Chen et al. · 2020 [cited by applicant]
US 11042631B2 · Ghosh et al. · 2021 [cited by applicant]
US 11074497B2 · Ascari et al. · 2021 [cited by applicant]
US 11086311B2 · Cella et al. · 2021 [cited by applicant]
US 11106598B2 · Zhang et al. · 2021 [cited by applicant]
US 11144047B2 · Cella et al. · 2021 [cited by applicant]
US 11166012B2 · Sugio · 2021 [cited by applicant]
US 11175653B2 · Cella et al. · 2021 [cited by applicant]
US 11176691B2 · Ghadyali et al. · 2021 [cited by applicant]
US 11210392B2 · Salem et al. · 2021 [cited by applicant]
US 11210569B2 · Qian et al. · 2021 [cited by applicant]
US 11243528B2 · Cella et al. · 2022 [cited by applicant]
US 11321210B2 · Huang et al. · 2022 [cited by applicant]
US 11363043B2 · Murphy et al. · 2022 [cited by applicant]
US 11397579B2 · Zhang et al. · 2022 [cited by applicant]
US 11429701B2 · Fukuda · 2022 [cited by examiner]
US 11449668B2 · Mann et al. · 2022 [cited by applicant]
US 11463457B2 · Bazalgette et al. · 2022 [cited by applicant]
US 11475351B2 · Luo et al. · 2022 [cited by applicant]
US 11481918B1 · Ebrahimi Afrouzi et al. · 2022 [cited by applicant]
US 11483599B2 · Yang et al. · 2022 [cited by applicant]
US 11500788B2 · Miller et al. · 2022 [cited by applicant]
US 11575936B2 · Wang et al. · 2023 [cited by applicant]
US 11580218B2 · Salem et al. · 2023 [cited by applicant]
US 11593658B2 · Liu et al. · 2023 [cited by applicant]
US 11615288B2 · Ceulemans et al. · 2023 [cited by applicant]
US 11630666B2 · Zhang et al. · 2023 [cited by applicant]
US 11677981B2 · Han et al. · 2023 [cited by applicant]
US 11698967B2 · Jennings et al. · 2023 [cited by applicant]
US 11714908B2 · Oetken · 2023 [cited by applicant]
US 11775634B2 · Saxena et al. · 2023 [cited by applicant]
US 11783571B2 · Hoshino et al. · 2023 [cited by applicant]
US 11843575B2 · Saxena · 2023 [cited by applicant]
US 11847550B2 · Dally et al. · 2023 [cited by applicant]
US 11882317B2 · Sugio et al. · 2024 [cited by applicant]
US 11899463B1 · Ebrahimi Afrouzi et al. · 2024 [cited by applicant]
US 11909952B2 · Sugio · 2024 [cited by applicant]
US 11915146B2 · Tokui et al. · 2024 [cited by applicant]
US 11983534B2 · Chen et al. · 2024 [cited by applicant]
US 12001935B2 · Sjögren et al. · 2024 [cited by applicant]
US 12069086B2 · Marshall · 2024 [cited by applicant]
US 12073215B2 · Zhang et al. · 2024 [cited by applicant]
US 20020191842A1 · Kajitani et al. · 2002 [cited by applicant]
US 20030023864A1 · Muttik et al. · 2003 [cited by applicant]
US 20030112254A1 · Ishihara · 2003 [cited by applicant]
US 20050132206A1 · Palliyil et al. · 2005 [cited by applicant]
US 20050210056A1 · Pomerantz et al. · 2005 [cited by applicant]
US 20060095732A1 · Tran et al. · 2006 [cited by applicant]
US 20060123244A1 · Gheorghescu et al. · 2006 [cited by applicant]
US 20070188494A1 · Agutter et al. · 2007 [cited by applicant]
US 20090267946A1 · Agutter et al. · 2009 [cited by applicant]
US 20110041179A1 · Ståhlberg · 2011 [cited by applicant]
US 20110063403A1 · Zhang et al. · 2011 [cited by applicant]
US 20110283174A1 · M'Raihi et al. · 2011 [cited by applicant]
US 20120017262A1 · Kapoor et al. · 2012 [cited by applicant]
US 20120246171A1 · Teerlink · 2012 [cited by applicant]
US 20120255018A1 · Sallam · 2012 [cited by applicant]
US 20130269042A1 · Krall et al. · 2013 [cited by applicant]
US 20130275384A1 · Sivasubramanian et al. · 2013 [cited by applicant]
US 20130290565A1 · Kamakura · 2013 [cited by examiner]
US 20140047544A1 · Jakobsson · 2014 [cited by examiner]
US 20140215621A1 · Xaypanya et al. · 2014 [cited by applicant]
US 20150101053A1 · Sipple · 2015 [cited by examiner]
US 20150309813A1 · Patel · 2015 [cited by examiner]
US 20150319182A1 · Natarajan et al. · 2015 [cited by applicant]
US 20150365423A1 · Prokopi et al. · 2015 [cited by applicant]
US 20160021174A1 · Vilchez et al. · 2016 [cited by applicant]
US 20160224787A1 · Guy et al. · 2016 [cited by applicant]
US 20160246701A1 · Revanna et al. · 2016 [cited by applicant]
US 20160328562A1 · Saxena et al. · 2016 [cited by applicant]
US 20160350532A1 · Davis et al. · 2016 [cited by applicant]
US 20160359701A1 · Pang et al. · 2016 [cited by applicant]
US 20160371532A1 · Shi et al. · 2016 [cited by applicant]
US 20170169208A1 · Jantz et al. · 2017 [cited by applicant]
US 20170264619A1 · Narayanaswamy et al. · 2017 [cited by applicant]
US 20180063168A1 · Sofka · 2018 [cited by applicant]
US 20180082193A1 · Cormier et al. · 2018 [cited by applicant]
US 20180096230A1 · Luan et al. · 2018 [cited by applicant]
US 20180107591A1 · Smith · 2018 [cited by applicant]
US 20180197089A1 · Krasser · 2018 [cited by examiner]
US 20180219891A1 · Jain · 2018 [cited by examiner]
US 20180247682A1 · Gajapathy · 2018 [cited by applicant]
US 20180300484A1 · Sethumadhavan et al. · 2018 [cited by applicant]
US 20190014153A1 · Lang et al. · 2019 [cited by applicant]
US 20190042743A1 · Chen · 2019 [cited by applicant]
US 20190054347A1 · Saigh et al. · 2019 [cited by applicant]
US 20190065563A1 · Petculescu et al. · 2019 [cited by applicant]
US 20190129404A1 · Cella et al. · 2019 [cited by applicant]
US 20190130073A1 · Sun et al. · 2019 [cited by applicant]
US 20190199736A1 · Howard et al. · 2019 [cited by applicant]
US 20190205244A1 · Smith · 2019 [cited by applicant]
US 20190260795A1 · Araiza et al. · 2019 [cited by applicant]
US 20190272375A1 · Chen · 2019 [cited by applicant]
US 20190273509A1 · Elkind et al. · 2019 [cited by applicant]
US 20190273510A1 · Elkind et al. · 2019 [cited by applicant]
US 20190339685A1 · Cella et al. · 2019 [cited by applicant]
US 20190339686A1 · Cella et al. · 2019 [cited by applicant]
US 20190339688A1 · Cella et al. · 2019 [cited by applicant]
US 20190342324A1 · Nawy et al. · 2019 [cited by applicant]
US 20200004938A1 · Brannon et al. · 2020 [cited by applicant]
US 20200045063A1 · Zhang · 2020 [cited by applicant]
US 20200089212A1 · Cella et al. · 2020 [cited by applicant]
US 20200089886A1 · Oetken · 2020 [cited by applicant]
US 20200103894A1 · Cella et al. · 2020 [cited by applicant]
US 20200150643A1 · Cella et al. · 2020 [cited by applicant]
US 20200167258A1 · Chattopadhyay et al. · 2020 [cited by applicant]
US 20200210575A1 · Huang et al. · 2020 [cited by applicant]
US 20200351519A1 · Sugio et al. · 2020 [cited by applicant]
US 20200364088A1 · Ashwathnarayan et al. · 2020 [cited by applicant]
US 20200366941A1 · Sugio et al. · 2020 [cited by applicant]
US 20210012538A1 · Wang et al. · 2021 [cited by applicant]
US 20210021869A1 · Wang et al. · 2021 [cited by applicant]
US 20210034813A1 · Wu et al. · 2021 [cited by applicant]
US 20210042413A1 · Oetken · 2021 [cited by applicant]
US 20210117768A1 · Liu et al. · 2021 [cited by applicant]
US 20210150263A1 · Corwin et al. · 2021 [cited by applicant]
US 20210173916A1 · Ortiz · 2021 [cited by examiner]
US 20210212694A1 · Shelton, IV et al. · 2021 [cited by applicant]
US 20210216630A1 · Karr · 2021 [cited by applicant]
US 20210216633A1 · Lee et al. · 2021 [cited by applicant]
US 20210216648A1 · Child et al. · 2021 [cited by applicant]
US 20210216666A1 · Miller et al. · 2021 [cited by applicant]
US 20210248027A1 · Alonso et al. · 2021 [cited by applicant]
US 20220057519A1 · Goldstein et al. · 2022 [cited by applicant]
US 20220114262A1 · Bhatia et al. · 2022 [cited by applicant]
US 20220147629A1 · Vasilenko et al. · 2022 [cited by applicant]
US 20220159261A1 · Oh · 2022 [cited by applicant]
US 20220188425A1 · Wyatt et al. · 2022 [cited by applicant]
US 20220269784A1 · Oetken et al. · 2022 [cited by applicant]
US 20220383082A1 · Zhang et al. · 2022 [cited by applicant]
US 20220391415A1 · Singh et al. · 2022 [cited by applicant]
US 20230009127A1 · Boyer · 2023 [cited by applicant]
US 20230084574A1 · Hicks et al. · 2023 [cited by applicant]
US 20230111071A1 · Cella et al. · 2023 [cited by applicant]
US 20230114719A1 · Thomas et al. · 2023 [cited by applicant]
US 20230186201A1 · Cella et al. · 2023 [cited by applicant]
US 20230196230A1 · Cella et al. · 2023 [cited by applicant]
US 20230196626A1 · Wang et al. · 2023 [cited by applicant]
US 20230228577A1 · Belt et al. · 2023 [cited by applicant]
US 20230252145A1 · Kim · 2023 [cited by applicant]
US 20230254340A1 · Kim · 2023 [cited by applicant]
US 20230306113A1 · Kim · 2023 [cited by applicant]
US 20240045659A1 · Siebel et al. · 2024 [cited by applicant]
US 20240062871A1 · Hull et al. · 2024 [cited by applicant]
US 20240126220A1 · Drees et al. · 2024 [cited by applicant]
US 20240155142A1 · Sugio et al. · 2024 [cited by applicant]
US 20240184886A1 · Kutner et al. · 2024 [cited by applicant]
US 20240281726A1 · Paturi et al. · 2024 [cited by applicant]
WO 2016179438A1 · 2016 [cited by applicant]
WO 2018031940A1 · 2018 [cited by applicant]
WO 2018103736A1 · 2018 [cited by applicant]
WO 2019156141A1 · 2019 [cited by applicant]
WO 2019198636A1 · 2019 [cited by applicant]
WO 2019203297A1 · 2019 [cited by applicant]
WO 2021036905A1 · 2021 [cited by applicant]
WO 2021046567A1 · 2021 [cited by applicant]
WO 2021057746A1 · 2021 [cited by applicant]
WO 2021155971A1 · 2021 [cited by applicant]
NPL Search Terms (Year: 2024). [cited by examiner]
Non-final office action dated Apr. 23, 2021 for U.S. Appl. No. 17/185,884, 33 pages. [cited by applicant]
EP Search Report for Appl. No. 19860921.6, dated May 2, 2022, 11 pages. [cited by applicant]
Final Office Action for U.S. Appl. No. 17/185,884, dated Aug. 11, 2021, 33 pages. [cited by applicant]
Final Office Action for U.S. Appl. No. 17/185,884, dated May 3, 2022, 16 pages. [cited by applicant]
Final Office Action in U.S. Appl. No. 17/185,884, dated Aug. 11, 2021, 16 pages. [cited by applicant]
Final Rejection for U.S. Appl. No. 17/185,884, dated Dec. 8, 2023, 17 pages. [cited by applicant]
Final Rejection for U.S. Appl. No. 17/185,884, dated Feb. 14, 2023, 27 pages. [cited by applicant]
Han, KyoungSoo, BooJoong Kang, and Eul Gyu Im, Malware analysis using visualized image matrices, The Scientific World Journal, 2014, 15 pages. [cited by applicant]
International Preliminary Report on Patentability and Written Opinion for Appl. No. PCT/US2022/017510, dated Aug. 29, 2023, 6 pages. [cited by applicant]
International Search Report dated Nov. 15, 2019 for PCT/US2019/051196, 2 pages. [cited by applicant]
Li Chen et al., STAMINA: Scalable Deep Learning Approach for Malware Classification, Apr. 2020 [online], 11 pages, [retrieved on May 15, 2020]. Retrieved from the Internet: URL: https://www.intel.com/content/www/us/en/a… [cited by applicant]
Moser et al., “Limits of Static Analysis for Malware Detections”, The Twenty-Third Annual Computer Security Applications Conference (ACSAC 2007), Dec. 14, 2007, 11 pages. [cited by applicant]
Nikolopoulos, Stavros D., and Iosif Polenakis, “A graph-based model for malware detection and classification using system-call groups,” Journal of Computer Virology and Hacking Techniques 13.1 (2017): 29-46, 2017, 18 pa… [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 17/185,884, dated Apr. 23, 2021, 24 pages. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 17/185,884, dated Jan. 14, 2022, 16 pages. [cited by applicant]
Non-Final Rejection for U.S. Appl. No. 17/185,884, dated Aug. 23, 2023, 27 pages. [cited by applicant]
Non-Final Rejection for U.S. Appl. No. 17/185,884, dated Sep. 26, 2022, 17 pages. [cited by applicant]
Non-Final Rejection for U.S. Appl. No. 18/324,957, dated Dec. 21, 2023, 89 pages. [cited by applicant]
Notice Of Allowance for U.S. Appl. No. 17/068,280, dated Jan. 26, 2022, 33 pages. [cited by applicant]
Notice of Allowance for Appl. No. 1656978, dated Jun. 8, 2020 12 pages. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 17/068,280 dated Jul. 20, 2022, 13 pages. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 17/068,280, dated Feb. 23, 2023, 12 pages. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 17/068,280 dated May 13, 2022, 13 pages. [cited by applicant]
Notice of Allowance for Israeli Appl. No. 281410, dated Jun. 22, 2022, 3 pages. [cited by applicant]
Notice of Allowance for Israeli Pat. Appl. No. 281410, dated Jun. 6, 2022, 3 pages. [cited by applicant]
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority for PCT/US2019/051196, Nov. 15, 2019, 1 page. [cited by applicant]
NPL Search Terms, 2021, 1 page. [cited by applicant]
NPL Search Terms, 2022, 1 page. [cited by applicant]
Search Report for appl. No. PCT/US2022/017510, dated Mar. 16, 2022, 2 pages. [cited by applicant]
Written Opinion for appl. No. PCT/US2022/017510, dated Mar. 16, 2022, 5 pages. [cited by applicant]
Written Opinion of ISA dated Nov. 15, 2019 for PCT/US2019/051196, 6 pages. [cited by applicant]
Z3rotrust, “Digital Steganography as an Advanced Malware Detection Evasion Technique”, Aug. 30, 2018, 49 pages. [cited by applicant]