- Page 2 and 3:
Syncrosoft MCFACT TM Secure Data Pr
- Page 4 and 5:
MCFACT and Re-trust Challenge of Re
- Page 6 and 7:
Agenda for today What is MCFACT? (
- Page 8 and 9:
What is MCFACT? MCFACT [em see fakt
- Page 10 and 11:
What is MCFACT? Demonstration of ex
- Page 12 and 13:
= x 2 12/108 Copyright 2008 Syncros
- Page 14 and 15:
= x 3 = / 3 14/108 Copyright 2008 S
- Page 16 and 17:
= 1/13 16/108 Copyright 2008 Syncro
- Page 18 and 19:
= 2 = + = - 2 2 = + = - = -
- Page 20 and 21:
= Encode(Decode1( ) & Decode2( )) C
- Page 22 and 23:
What is MCFACT? “Just as it is ha
- Page 24 and 25:
What is MCFACT? FAPKC - broken but
- Page 26 and 27:
Applying MCFACT 26/108 Copyright 20
- Page 28 and 29:
Applying MCFACT Example Easy to us
- Page 30 and 31:
Applying MCFACT unsigned int findIn
- Page 32 and 33:
Applying MCFACT void Or( const _cal
- Page 34 and 35:
Applying MCFACT Speed and size Spe
- Page 36 and 37:
Applying MCFACT MCFACT is used by:
- Page 38 and 39:
AES white-box implementation Attack
- Page 40 and 41:
AES white-box implementation Attack
- Page 42 and 43:
AES white-box implementation Random
- Page 44 and 45:
AES white-box implementation Data i
- Page 46 and 47:
Supplemental slides: Questions, ple
- Page 49 and 50:
Automata or polynomials? XOR of num
- Page 51 and 52:
MCFACT vs obfuscation encrypt 1. To
- Page 53 and 54:
Control flow integrity MCFACT relie
- Page 55: What else is Syncrosoft doing? Main
- Page 59 and 60: . . 0 0 0 0 0 1 1 1 1 1 . . 0 0 1 1
- Page 61 and 62: . . 0 0 0 0 0 1 1 1 1 1 . . 0 0 1 1
- Page 63 and 64: . . 0 0 0 0 0 1 1 1 1 1 . . 0 0 1 1
- Page 65 and 66: . . 0 0 0 0 0 1 1 1 1 1 . . 0 0 1 1
- Page 67 and 68: . . 0 0 0 0 0 1 1 1 1 1 . . 0 0 1 1
- Page 69 and 70: . . 0 0 0 0 0 1 1 1 1 1 . . 0 0 1 1
- Page 71 and 72: . . 0 0 0 0 0 1 1 1 1 1 . . 0 0 1 1
- Page 73 and 74: . . 0 0 0 0 0 1 1 1 1 1 . . 0 0 1 1
- Page 75 and 76: . . 0 0 0 0 0 1 1 1 1 1 . . 0 0 1 1
- Page 77 and 78: . . 0 0 0 0 0 1 1 1 1 1 . . 0 0 1 1
- Page 79 and 80: . . 0 0 0 0 0 1 1 1 1 1 . . 0 0 1 1
- Page 81 and 82: . . 0 0 0 0 0 1 1 1 1 1 . . 0 0 1 1
- Page 83 and 84: 2 7 6 = 3 1 + 2 4 5 9 3 = 3 * 3 1 .
- Page 85 and 86: . . 0 1 0 0 0 1 0 1 0 0 2 7 6 85/10
- Page 87 and 88: . . 0 1 0 0 0 1 0 1 0 0 2 7 6 87/10
- Page 89 and 90: . . 0 1 0 0 0 1 0 1 0 0 2 7 6 89/10
- Page 91 and 92: 1 0 0 . . 0 1 0 0 0 1 0 1 0 0 2 7 6
- Page 93 and 94: 1 1 0 0 . . 0 1 0 0 0 1 0 1 0 0 2 7
- Page 95 and 96: 1 1 1 0 0 . . 0 1 0 0 0 1 0 1 0 0 2
- Page 97 and 98: 0 1 1 1 0 0 . . 0 1 0 0 0 1 0 1 0 0
- Page 99 and 100: 1 0 1 1 1 0 0 . . 0 1 0 0 0 1 0 1 0
- Page 101 and 102: 0 1 0 1 1 1 0 0 . . 0 1 0 0 0 1 0 1
- Page 103 and 104: 0 0 1 0 1 1 1 0 0 . . 0 1 0 0 0 1 0
- Page 105: 0 0 0 1 0 1 1 1 0 0 . . 0 1 0 0 0 1