(12) United States Patent (10) Patent No.: US …...US. Patent Jan. 31, 2012 Sheet 16 0120 US...

US008l07622B2

(12) United States Patent (10) Patent No.: US 8,107,622 B2 Gressel et al. (45) Date of Patent: Jan. 31, 2012

(54) SYSTEM AND METHOD TO PRECLUDE (52) US. Cl. ......................... .. 380/28; 713/181; 707/698 MESSAGE MODIFICATION IN DATA (58) Field of Classi?cation Search .................. .. 380/28; AUTHENTICATION SYSTEMS THROUGH 713/181; 707/698 EFFICENT USE OF FEEDBACK IN See application ?le for complete search history. CRYPTOGRAPHIC FUNCTIONS (56) References Cited

(75) Inventors: Carmi David Gressel, Mobile Post Negev (IL); Gregory Van Bard’ U.S. PATENT DOCUMENTS Hartsdale’ NY (Us); On. David 4,431,865 A : 2/1984 Bernede et al. ............... .. 380/44 Dunkelman Ramat Gan (IL) Avi 6,556,158 B2 4/2003 Steensgaard-Madsen 341/131

’ ’ 2002/0114452 Al * 8/2002 Hamilton .. 380/42

Hecht, Nesher (1L); Ran Gram", Yavne 2003/0223580 A1* 12/2003 Snell ............................. .. 380/28

(IL) * cited by examiner

(73) Assignee: Fortress GB Ltd., London Greater OTHER PUBLICATIONS London (GB) International Preliminary Report on Patentability for PCT/IL2007/

( * ) Notice: Subject to any disclaimer, the term of this 001101; mailed Apr‘ 7’ 2009*7 pages‘ patent is extended or adjusted under 35 Primary Examineri Aravind Moorthy U30 154(1)) by 261 days- (74) Attorney, Agent, or Firm 4 Roach Brown McCarthy &

Gruber P.C.; Kevin D. McCarthy (21) Appl. No.: 12/439,556

(57) ABSTRACT (22) PCT Filed: Sep. 6, 2007 A data hashing system operative to hash an incoming string of

message Words is an object of the present invention. The (86) PCT N04 PCT/IL2007/001101 system generates a hash value tag comprising a deterministic

§ 371 (6X1), random number string Which uniquely identi?es the incom (2)’ (4) Date, Jun 3, 2009 ing string. The system comprises at least ?rst and second

register arrays, at least one 1-Way functionality in at least (87) pCT pub NO; W02008/029406 pseudo-randomizing function; and a set of at least ?rst and

second orthogonal feedback Word stream generators opera PCT Pub- Date: Mar- 13’ 2008 tive to generate a set of at least ?rst and second orthogonal

_ _ _ feedback streams of message Words respectively, including (65) Pnor Pubhcatlon Data applying respective permutations to the incoming string.

Us 2009/0304179 A1 Dec_ 10, 2009 Wherein the ?rst and second feedback streams are combined into the ?rst and second register arrays respectively, the at

Related US. Application Data least pseudo-randomizing functionality accepts input from the register arrays and generates at least pseudo -random out put Which, in combination With a present Word in the incom ing string, is provided to the stream generators, and the ?rst feedback stream is a ?rst function of a present Word in the

(60) Provisional application No. 60/842,612, ?led on Sep. 7, 2006, provisional application No. 60/928,616, ?led on May 11, 2007.

(51) Int Cl incoming stream and the second feedback stream is a second

H04L 9/28 (200601) function of a present and prevrous Words, in the incoming H04L 9/32 (2006.01) 5 ream

G06F 17/10 (2006.01) 24 Claims, 20 Drawing Sheets

EATAEALTFEEWTWAETWITSYSTFETA i ‘ T T T _ n _ _ _ E if ?/igrg/EEEEA ‘ —‘

H’N AUTHEDIGTSATION m0 sun w SUPER Khblb I :K ARRAV

1 1

1 SYSTEM 1

1 1 1 LOWER REGISTER ARRAY "an FIGv 1A

no was my.

1-WAY RANDOMIZING

no VALUE cow CELLULAR

I 1915

FUNCTION

1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

MESSAGE 1N 532153911

2"" ORTHOGONAL FEEDBAC ‘

» GENERATOR s swans

1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

US. Patent Jan. 31, 2012 Sheet 1 0120 US 8,107,622 B2

SUPER REGISTER ARRAY <-S£Pl——-—

LOWER REGISTER ARRAY 4-LBFD

' I ' I | I ' I

: I I

' I I I I I ‘ I I I

: I I

I 140 | l RBCS RBCL I

g I , 1-WAY RANDOMIZING ' [ K2) 0 : l FUNCTION ‘ I I ran’ : : CIPHER MASK I ' 0800\ I

MESSAGE IN 3’ ORTHOGONAL FEEDBACK : Q _ “E5 I GENERATOR & STORE I

I NWR I

: RESULT PREVIOUS 2"d ORTHOGONAL FEEDBACK | ,. STORE RESULT- P5: GENERATOR & SToRE l

I ‘\PVR I (

I HASH-VAITUE TAG


I HASH-VALUE TAG STORE

DATA HASH-VALUE _) AUTHENTICATION BOOT

1900'] TAG VALUE ENGINE ->

PARAMETERS

1905J SYSTEM

TAG-VALU E

I I I I I I I I I

FIG. 1A I -> 19% TV DOWNLOAD

I I I I I I I I I I

1910/ TAG VALUE _}

CORP CELLULAR

1915J

TAG VALUE 7, CORP HOTLINE

|497c A326 I 497C-A326I |17E9 354E 1800 172:9 354FI

[267DAEF3LN 18lo/‘Ilis'w .AEFBI I 55BE_8391 I | I 3020 SEE :a391|

0000-00001 | | 0000 0000‘ l

0004 0000 l10000.0000 III/1520


_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __ __ ._, l

'- ONLY i‘th BIT OF MESj+1 MESSAGE | I EM I

I

: FALSE FEEDBACK WORD IS COMPL EI\7ITEDT I 510 I_W_QR_D‘lV/‘LTIL\LGL _T_ I _ f _ I _ _ _ _ 1%

I ALL BITS SHIFT RIGHT AT CLOCK

l

I I I I T T T T T T _ T T _ T T _ _ _ _ T _| I

I | SUPER TIER T T T T T | I I I i I TOP TIER E I T T T T T hkizo I‘ I MID TIER T T I: T T T I I I I

l: I BOT TIER T T F T T T : I I I_ _ _ _ _ _ _ __1_z__?_.i__li1__l+l__.l I ' _ T _ — _ _ — _ — -___-_-> _ — _ _ _ _ _ — _ I I

:I I REG BANKBNK5+2 NORMAL m0 I

I r _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __ __ I\/5\01

; I i'th BIT OF REGISTER BANK B “'5 i g E I RECONCIUNG nLFSRs ARE COMPLEMENTED NJ 1 II l_ __W2RI_)_W_AITING T T T F T T J I I I — — — — —-'_—-_—_-'_—_—_—_-—'_-*< ________ '_ — I I I

I | SUPER TIER T T F T T : I I I

i : TOP TIER T T 1-’ T T I 1 521 I

I | NIB TIER T T F T T W | l l I g I BOT TIER T T 1: T T : I I

I L ______ ._E2__1l_i__I+1__i+2__I I I ———————— -——-r — — — — — - — — —I I I

T | REG BANK ABNoRIvIAL FOR 1 CLOCK (X5521 ; I ONLY I'th BIT OF COMPLEMENTED J g

I_-Illilililili:Ii:::____I ‘nil-III“; ‘I: 11-11:“: 1:: 1:: __W:'__““.\/\ I I RECONCILING FB i+1‘th AND COMPLEMENTED 1 I 502 IF i'th BIT OF BNK’S nLFSRs’ BITS WERE XOReD ; 12 g I INTO THE i+1'th BITs OF ALL nLFSRs M I L _ _ _ _ __T___7_J____7_J__7.’__I I I I ---------------- —-. I I l SUPER TIER T T T T T | I l I

i : TOP TIER T T T T T l I l ' 522

i l MID TIER T T T T T W I I I

l f | BOT TIER T T T T T I I l

I I I-2 l-1 I I+1 I+2 J I I I

I

I

I I REG BANK & FEEDBACK ARE ORIGINAL VALID “2 I I REG BANK'S OUTPUT IS ALso ORIGINAL VALID


1111111111922Z2222s‘2’223w U1234557B9U1|2345678 0123jj5 76901 S 350 coNTRIvED FALSE IIIIESSAGE - 4 FAULT BITS - F G SAME FAULT BITS IN REG BANK

A B c D E’F G H J K’ L M N P Q R s T UV’ WX Y z a b c‘ d e f g h

8000 CORRUPTED PREVIOUS RESULT- SAME FAULT BITS

CORRUPTED BITS IN RECONCILING MESSAGE —-TO BE FAULT BITS IN RESULT STORE

III 0 0 0 I'I’Z’o 0 OH’K’O 0 0 0 0 0 0 on‘ V0 0 0 0 0 11’ c 0 0 0 0

FB WORD FAULT BITS = FS SUM OF MESSAGE FAULT & PREVIOUS RESULT FAULT

0A 1; c Df’jFQIHJK’LI?I/IN? Q 215 T11] V’WxyIz a 6 a] de f g 4 FAULT BITS FS RECONCILE S-IIFTED FAULT BITS IN TMB nLFSRS

FAULT BITS IN TMB R'EGISTER-SHIFTED oNE CELL To' THE RIGHT- BEFORE FB S

0/1 BC D E'F 6H JK'LIMNPQ I2 sTUv'wxy Z0 bc'd e f g

00 00

O

0-7 N O O

8040 4 FAULTY BITS, E’, K’,'V' & 0' IN TI'-IE TMB REGISTERS ARE REc0Nc'ILED

/\¢0 00 0130 0|00K0I0 00 0 00 00|V00 0‘0 0 01300 0 0 8050 NO TRACE IN THE TMB nLFSRS WHEN 4 AUSPICIOUS MESSAGE BITS WERE MODIFIED

FIG. 14A § 8 O

820

012345678931Ziléélé?iiiij??iii? 850 CONTRIVED FALSE MESSAGE - 4 FAULT BITS - FS SAME FAULT BITS IN RE? BANK

A B C D E’F G H J K’ L M N P Q R S T UV’ WX Y Z a b c' d e f g h 8000

FAULT BITS VIA PRESENT RESULT TRANSFORMED BY MAC MIX INTO SUPER TIER

D C B A H G F E M L K’ J R Q P N V’ U T 8 Z Y X W d c' b a h g f

RECONCILING MESSAGE BITS — TO BE MAC MIXED THEN NEXT FB TO SUPER TIER

/\ 0 0 0 0 H’E’o 0 0 II’IK’O 0 0 0 0 0 0 0 H ’V’0 0 0 0 0 II’c 0 0 0 0

SUPER TIER "ALLEGED RECONCILING" FB IS MAC MIXED RECONCILING MESSAGE

f 0 0 0 0 0 0 $111 OJC’II‘O 0 0 0 0 H0 0 0 0 0 0V’ c'11’ 0 0 0 0 0 0 8 70

SHIFTED SUPER TIER - BEFORE RECEIVING “ALLEGED RECONCILING" FEEDBACK

f‘WBCSAHGFE'II/ILK'JRQPNv'uTszvxwdc'bahgf 12 CORRUPTED BITS-IN THE SUPER TIER — CAUSED BY 4 RECONCILED TMB BITS

[*0 0 0 0 I0 0 E’ P'IE' K‘ P' K'} 0 0 0 oIP' v' 0 0 0 0 0 v1 c' P'c' 0|0 0 0 THE ORTHOGONAL SUPER TIER FEEDBACK DIFFLISED 4'912?SE BITS

FIG. 14B

C)


SEARCH FOR MODIFIED MESSAGES THAT CAN BE RECONCILED BOTH IN THE SUPER AND THE TMB TIERS O

I L BADFALSWRDCNT=O | |

l I FOR I=2TO [(20324)] STEPZ I @510

I I

1101 0100 0110

NWR'I = I

MAPPING OF FALSEBITS IN MESGl J

GENERIC OR FIG. 4B EMBODIMENT

[NWR1 AND (000/14o09)1,1> @312 _ _ _ _ _ __ I

0 ‘ fMMX(NWRX)

NO I‘ ' | ERFORM THE MAC MIX - fMMX(NWRx LFB, : NWR111“ “1” “11° TRANSFORM ON A 32 BIT vvoRD

MAPPING OF FALSE BITS IN TMB F8 8540 EACESIIZBgI-ESEVSZSED V 0110 1010 001

I l

LFB2 = [(LFB1)/2] w I MAPPING OF RECONCILING PB 8550

L 1011 1110 0101 l NvvRz = LFB2(-B LFB1 /\

MAPPING OF RECONCILING NwRz 8560 I V £1101 0100 011: I

I I I I

5UP1 = fMMx(NWR1)1011 0010 011 1ST suPER TIER FB FALSE BITS 3565

V £1011 1110 010 SUPZ = fMMX(NWR2)1101 0111 101

2”“ SUPER TIER FB FALSE BITS 8570 L 0101 1001 :01

SUPCLKZ = (SUP1)! 2 f 2"5 CLK SUPER TIER FALSE BITS 8575

NwR1 WAS RECONCILED IN __ _ _ _

ITNDREMENT I BADFALSWRDCN l

V

I

I I I I I

I INPUT NWRx (32 BIT WORD) I I I I I I I

0101 1001 0011 ‘ RECORD NWR1 IN

BAD WORD FILE 1101 0111 101a

1000 11-10 10o1>0

E8580

SO THAT -

e000 WORD COUNT=ffff ffff rm fffe k/§590 BAD WORD COUNT = 0

@ FIG. 15

(12) United States Patent (10) Patent No.: US …...US. Patent Jan. 31, 2012 Sheet 16 0120 US...

Documents

Transcript of (12) United States Patent (10) Patent No.: US …...US. Patent Jan. 31, 2012 Sheet 16 0120 US...