发明名称 METHOD FOR PROCESSING DATA
摘要 Method for processing data, in which a Petri net is encoded, written into a memory and read and executed by at least one instance, wherein transitions of the Petri net read from at least one tape and/or write on at least one tape symbols or symbol strings, with the aid of at least one head. In an alternative, data-processing, co-operating nets are composed, the composition result is encoded, written into a memory and read and executed from the memory by at least one instance. In doing this, components can have cryptological functions. The data-processing nets can receive and process second data from a cryptological function which is executed in a protected manner. The invention enables processing of data which prevents semantic analysis of laid-open, possibly few processing steps and which can produce a linkage of the processing steps with a hardware which is difficult to isolate.
申请公布号 US2017024550(A1) 申请公布日期 2017.01.26
申请号 US201615052711 申请日期 2016.02.24
申请人 Whitecryption Corporation 发明人 Harder Wulf
分类号 G06F21/14;G06N7/00;G06F21/16 主分类号 G06F21/14
代理机构 代理人
主权项 1. A computer-implemented method for obstructing analysis of a computer program, the method comprising: translating an operation of the computer program into a first data processing net; performing a composition of at least a second data processing net, the first data processing net, and a third data processing net to form a composite, and replacing, in the computer program, the operation with an implementation of the composite to yield a protected version of the computer program, wherein the first data processing net, the second data processing net, and the third data processing net comprise sequential machines MΩ with optionally plural input channels and optionally plural output channels, C is a finite set of channels, Δ is a finite set of finite alphabets, γ:C→Δ, Ω=(C, Δ, γ) is a communication rule, EΩ={e|e={(c,σ)|σ∈γ(c)((c,σ1)∈e(c,σ2)∈eσ1=σ2)}}∪{Ø}is a set of input/output events and S is a finite set of states and MΩ:={(S,EΩ,δ,β,s0)|δ:R→Sβ:R→EΩR⊂S×EΩ(∀[(s,x),y]∈β∀(cx,σx)∈x∀(cy,σy)∈y:cx≠cy)s0∈S}. B with B⊂C is a set of internal synchronization channels and the composition compB:MΩn→2MΩ of sequential machines is characterized by:compB:={((K1,…,Kn),K~)(K1,…,Kn)=((S1,EΩ,δ1,β1,s01),…,(Sn,EΩ,δn,βn,s0n))∃T={((x1,…,xn),(y1,…,yn),(s1′,…,sn′),x~,y~)([(s01,x1),s1′],…,[(s0n,xn),sn′])∈δ1×…×δn([(s01,x1),y1],…,[(s0n,xn),yn])∈β1×…×βn∃Hx=⋃i∈{1,…,n}xi∃Hy=⋃i∈{1,…,n}βi(xi):Hx∈EΩHy∈EΩ∀(c,σ):(c∈B⇔(c,σ)∈Hx⋂Hy)x~=Hx/Hyy~=Hy/Hx}∃MΩ′~={K′~∃((x1,…,xn),(y1,…,yn),(s1′,…,sn′),x~,y~)∈T:   K′~=compB([(S1,EΩ,δ1,β1,s1′),…,(Sn,EΩ,δn,βn,sn′)])}:K~=(S~,EΩ,δ~,β~,s0~)S~=(s01,…,s0n)⋃⋃(S′~,EΩ′,δ′~,β′~,s0′~)∈Mn′~S′~δ~={[((s01,…,s0n},x~),(s1′,…,sn′)]((x1,…,xn),(y1,…,yn),(s1′,…,sn′),x~,y~)∈T}⋃⋃(S′~,EΩ′,δ′~,β′~,s0′~)∈Mn′~δ′~β~={[((s01,…,s0n),x~),y~]((x1,…,xn),(y1,…,yn),(s1′,…,sn′),x~,y~)∈T}⋃⋃(S′~,EΩ′,δ′~,β′~,s0′~)∈Mn′~β′~s0~=(s01,…,s0n)}.
地址 Wilmington DE US