IP Library › Granted Patent US 9,589,158
Granted Patent B2
US 9,589,158 · App. 14/828,752 · Granted Mar 7, 2017

Programmable intelligent search memory (PRISM) and cryptography engine enabled secure DRAM

Inventor: Ashish A. Pandya (El Dorado Hills, CA)
G06F21/79G06F3/0622G06F3/0638G06F3/0679G06F12/1408G06F17/30985H04L9/0825H04L9/22H04L63/145
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 9,589,158
App. No.
14/828,752
Granted
Mar 7, 2017
Kind
B2
Abstract

Systems comprising a processor and a dynamic random access memory (DRAM). The DRAM comprises a programmable intelligent search memory (PRISM).

Claims (4)

1. A system comprising a processor, a dram controller and a Dynamic Random Access Memory (DRAM) comprising a Programmable Intelligent Search Memory (PRISM) for regular expression search using non-deterministic finite state automaton and further comprising a cryptography processing engine for performing encryption and decryption, said PRISM and cryptography processing engines creating a secure DRAM for use in the said system, said PRISM comprising: a) a symbol memory circuit to store symbols or characters; b) a symbol evaluation circuit coupled to the symbol memory circuit to evaluate match of the symbols or characters with input symbols or characters in content to be searched; c) a current state vector (CSV) memory circuit to store a plurality of states; d) a state dependent vector (SDV) memory circuit to store state transition controls for said non-deterministic finite state automaton; and e) a state transition circuit coupled to said symbol evaluation circuit, a current state vector memory circuit and said state dependent vector memory circuit to perform state transition from one or more first states to one or more second states of said plurality of states of said finite state automation.

2. The system of claim 1 , further comprising a means to program the PRISM with regular expression rules.

3. A system comprising a processor, a dram controller and a Dynamic Random Access Memory (DRAM) comprising a Programmable Intelligent Search Memory (PRISM) for regular expression search using non-deterministic finite state automaton, said PRISM comprising: a) a symbol memory circuit to store symbols or characters; b) a symbol evaluation circuit coupled to the symbol memory circuit to evaluate match of the symbols or characters with input symbols or characters in content to be searched; c) a current state vector (CSV) memory circuit to store a plurality of states; d) a state dependent vector (SDV) memory circuit to store state transition controls for said non-deterministic finite state automaton; and e) a state transition circuit coupled to said symbol evaluation circuit, a current state vector memory circuit and said state dependent vector memory circuit to perform state transition from one or more first states to one or more second states of said plurality of states of said finite state automation.

4. A Dynamic Random Access Memory (DRAM) comprising a Programmable Intelligent Search Memory (PRISM) for regular expression search using non-deterministic finite state automaton distributed per bank of the DRAM, said PRISM comprising: a) a symbol memory circuit to store symbols or characters; b) a symbol evaluation circuit coupled to the symbol memory circuit to evaluate match of the symbols or characters with input symbols or characters in content to be searched; c) a current state vector (CSV) memory circuit to store a plurality of states; d) a state dependent vector (SDV) memory circuit to store state transition controls for said non-deterministic finite state automaton; and e) a state transition circuit coupled to said symbol evaluation circuit, a current state vector memory circuit and said state dependent vector memory circuit to perform state transition from one or more first states to one or more second states of said plurality of states of said finite state automation.

Assignments (2)
CHANGE OF NAME Recorded May 10, 2024
From: INFOSIL, INC.
To: IP PROGRAM INC
Reel/Frame 067380/0426 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 10, 2022
From: PANDYA, ASHISH
To: INFOSIL INC.
Reel/Frame 059553/0191 →
Continuity (16)
Continuation 14303254 · Jun 12, 2014
Continuation In Part 13472042 · May 15, 2012
Continuation 13172276 · Jun 29, 2011
Continuation 13029782 · Feb 17, 2011
Continuation 11952043 · Dec 6, 2007
Provisional Application 60965267 · Aug 17, 2007
Provisional Application 60965170 · Aug 17, 2007
Provisional Application 60963059 · Aug 1, 2007
Provisional Application 60961596 · Jul 23, 2007
Provisional Application 60933313 · Jun 6, 2007
Provisional Application 60933332 · Jun 6, 2007
Provisional Application 60930607 · May 17, 2007
Provisional Application 60928883 · May 10, 2007
Provisional Application 60873632 · Dec 8, 2006
Provisional Application 60873889 · Dec 8, 2006
Related Publication 20150356321A1 · Dec 10, 2015