STRATEGIC ENCRYPTION
www.crypto-logica.com
2. SECURITY
•
•
•
•
•
•
•
•
•
Future proof – available today
Absolute technical security
Secure against computing developments
Any crypto-analysis security
Linear cryptoanalysis security
Differential cryptoanalysis security
Brutal force security (up to 4096-bit key)
No backdoor for decryption without a key
No reverse engineering at all
3. SEVEN ENCRYPTION METHODS
T
Y
P
E
SHORT
B
B
B
B
SBC
LBC
UBC
UBE
H
H
S
SHC
HES
STE
ENCRYPTION
METHOD
LONG
Short Block Cipher
Long Block Cipher
Ultimate Block Cipher
UBC Extended
KEY LENGTH
BLOCK
[bits]
[bits]
MIN
MAX
256
512
384
768
2048
4096
2048
4096
128
256
256
256
Short Hybrid Cipher
256
Hybrid Encryption Solution 384
Stream Extended Cipher 2048
2048
2048
∞
128
256
2048
• B = BLOCK CIPHER
• H = HYBRID CIPHER
• S = STREAM CIPHER
4. ALGORITHM CUSTOMIZATION
•
•
•
•
•
•
•
•
Family of customized algorithms
Algorithms have adjustable parameters
User can change algorithm parameters
Additional customized algorithm security
Unknown algorithm for unauthorized
Private algorithm provides open solution
No extraction of customized parameters
Even Crypto Logica Team cannot extract
customized parameters
6. TOTALCRYPT
•
•
•
•
•
Standard security level
Personal use
Working groups
Social networks
Small and medium size business
7. TOTALCRYPT+
•
•
•
•
•
•
Advanced security level
Bank systems
Stock exchange
Hi-tech business
Municipality
Police
8. TOTALCRYPT UE
•
•
•
•
•
•
Ultimate security level
Government systems
Security agencies
Intelligence agencies
Special users
Defense
9. KEY GENERATION
• User password with at least 16-characters
• 1-bit difference in two passwords provides
two completely different uncorrelated keys
• Key is not stored in any peripheral memory
media in any form
• Lost password prevents decryption
• Any secure public key cryptography can be
used for key exchange
• Crypto Logica Team is developing its own
fast public key cryptography
10. SPEED, LATENCY, POWER, COST
•
•
•
•
•
•
•
•
•
Faster encryption than AES
Smaller encrypter latency
Encrypter power savings
Smaller encrypter cost
Faster decryption than AES
Smaller decrypter latency
Decrypter power savings
Smaller decrypter cost
Maximum processor efficiency
11. SPEED @ Core2Duo 2.66GHz
T
Y
P
E
KEY
BLOCK
ALGORITHM LENGTH SIZE
[bits] [bits]
ENC/DEC
SPEED
[Mbit/s]
ALG SPEED
AES SPEED
B
B
B
B
AES (Ref)
AES CTR
SBC
LBC
256
256
2048
4096
128
128
128
256
73
70
178
205
1
0.96
2.44
2.81
B
B
H
UBC
UBE
SHC
2048
4096
2048
256
256
128
213
142
152
2.92
1.95
2.09
H
HES 1024
1024
256
341
4.68
H
HES 2048
2048
256
179
2.45
S
STE
4096
4096
569
7.79
12. ENCRYPTION/DECRYPTION SPEED
Speed Non-Optimized [Mbit/s]
600
500
400
300
200
100
0
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES
1024
HES
2048
STE
13. SPEED / AES SPEED
Speed / AES Speed Non-Optimized
9.00
8.00
7.00
6.00
5.00
4.00
3.00
2.00
1.00
0.00
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES
1024
HES
2048
STE
14. ALGORITHM FEATURES
•
•
•
•
•
•
•
•
•
Non-polynomial (NP) key finding problem
Key lengths chosen for NP problem
No matrix operations
No vector operations
Simple non-linear arithmetic operations
Huge bit diffusion
Huge bit confusion
Perfect randomness
Entropy close to theoretical maximum
15. NIST STS 2.1 RANDOMNESS TESTS
• Frequency (Monobit) Test determines
whether the numbers of ones and zeros in
a sequence are approximately the same.
Frequency
1.000
0.995
0.990
0.985
0.980
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES HES
1024 2048
STE
16. NIST STS 2.1 RANDOMNESS TESTS
• Frequency Test within a Block determines
whether the frequency of ones in an M-bit
block is approximately M/2.
Block Frequency
1.000
0.995
0.990
0.985
0.980
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES HES
1024 2048
STE
17. NIST STS 2.1 RANDOMNESS TESTS
• Cumulative Sums (Cusum-Forward) Test
determines whether the cumulative sum of
the partial sequences occurring in the
tested sequence is too large or too small.
Cumulative Sums - Forward
1.000
0.995
0.990
0.985
0.980
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES HES
1024 2048
STE
18. NIST STS 2.1 RANDOMNESS TESTS
• Cumulative Sums (Cusum-Reverse) Test
determines whether the cumulative sum of
the partial sequences occurring in the
tested sequence is too large or too small.
Cumulative Sums - Reverse
1.000
0.995
0.990
0.985
0.980
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES HES
1024 2048
STE
19. NIST STS 2.1 RANDOMNESS TESTS
• Runs Test determines whether the number
of runs (uninterrupted sequence of
identical bits) of ones and zeros of various
lengths is as expected for a random seq.
Runs
1.000
0.995
0.990
0.985
0.980
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES HES
1024 2048
STE
20. NIST STS 2.1 RANDOMNESS TESTS
• Test for the Longest Run of Ones in a
Block determines whether the length of the
longest run of ones is consistent with the
expected length.
Longest Run
1.000
0.995
0.990
0.985
0.980
0.975
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES HES
1024 2048
STE
21. NIST STS 2.1 RANDOMNESS TESTS
• Binary Matrix Rank Test determines the
linear dependence among fixed length
substrings of the original sequence.
Rank
1.000
0.995
0.990
0.985
0.980
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES HES
1024 2048
STE
22. NIST STS 2.1 RANDOMNESS TESTS
• Discrete Fourier Transform (Spectral) Test
detects periodic features (i.e. repetitive
patterns that are near each other).
FFT
1.000
0.995
0.990
0.985
0.980
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES HES
1024 2048
STE
23. NIST STS 2.1 RANDOMNESS TESTS
• Non-overlapping Template Matching Test
detects too many occurences of a given
non-periodic (aperiodic) pattern.
Non-overlapping Template (min)
1.000
0.995
0.990
0.985
0.980
0.975
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES HES
1024 2048
STE
24. NIST STS 2.1 RANDOMNESS TESTS
• Overlapping Template Matching Test
determines the number of occurrences of
pre-specified target strings.
Overlapping Template
1.000
0.995
0.990
0.985
0.980
0.975
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES HES
1024 2048
STE
25. NIST STS 2.1 RANDOMNESS TESTS
• Mauer’s “Universal Statistical” Test detects
whether or not the sequence can be
significantly compressed without loss of
information.
Universal
1.000
0.995
0.990
0.985
0.980
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES HES
1024 2048
STE
26. NIST STS 2.1 RANDOMNESS TESTS
• Approximate Entropy Test compares the
frequency of all possible overlapping m-bit
patterns across the entire sequence.
Approximate Entropy
1.000
0.995
0.990
0.985
0.980
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES HES
1024 2048
STE
27. NIST STS 2.1 RANDOMNESS TESTS
• Random Excursions Test determines if the
number of visits to a particular state within
a cycle deviates from expected.
Random Excursions (min)
1.000
0.995
0.990
0.985
0.980
0.975
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES HES
1024 2048
STE
28. NIST STS 2.1 RANDOMNESS TESTS
• Random Excursions Variant Test detects
deviations from the expected number of
visits to various states in the random walk.
Random Excursions Variant (min)
1.000
0.995
0.990
0.985
0.980
0.975
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES HES
1024 2048
STE
29. NIST STS 2.1 RANDOMNESS TESTS
• Serial Test 1 determines whether the
number of occurrences of the 2^m m-bit
overlapping patterns is approximately the
same.
Serial 1
1.000
0.995
0.990
0.985
0.980
0.975
0.970
0.965
0.960
0.955
0.950
0.945
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES HES
1024 2048
STE
30. NIST STS 2.1 RANDOMNESS TESTS
• Serial Test 2 determines whether the
number of occurrences of the 2^m m-bit
overlapping patterns is approximately the
same.
Serial 2
1.000
0.995
0.990
0.985
0.980
0.975
0.970
0.965
0.960
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES HES
1024 2048
STE
31. NIST STS 2.1 RANDOMNESS TESTS
• Linear Complexity Test determines
whether or not the sequence is complex
enough to be considered random.
Linear Complexity
1.000
0.995
0.990
0.985
0.980
AES
AES
CTR
SBC
LBC
UBC
UBE
SHC
HES HES
1024 2048
STE
32. COMPUTER APPLICATIONS
•
•
•
•
•
•
•
File encryption
Protocol encryption
Folder encryption
USB flash encryption
Hard drive encryption
Optical drive encryption
Encryption processors
33. VIDEO APPLICATIONS
•
•
•
•
•
•
•
•
•
Video editing / postprocessing
Movie edit master & archive
Mobile TV (4G, 3G)
IPTV
Cable TV
Satellite TV
Digital terrestrial TV
Video encoder
Set-top box
34. HARDWARE ENCRYPTION
•
•
•
•
•
•
•
•
•
Lowest cost
No dividers
No multipliers
Ultralow power
Integer arithmetic
Very low complexity
Small integrated memory
Ultrafast encryption and decryption
Easy radiation hardening
35. FINANCIAL APPLICATIONS
•
•
•
•
•
•
•
•
Database
Remote personnal banking
Remote corporative banking
Interbank communication
Automatic teller machines (ATM)
Credit card reader (POS-EFT)
Stock – broker communication
Broker – investor communication
36. MEDICAL APPLICATIONS
•
•
•
•
•
•
MAMMOGRAPHY
Mammography
COMPUTERIZED
TOMOGRAPHY
Computerized tomography
MAGNETIC
RESONANCE
Magnetic resonance
imagingIMAGING
ULTRASONOGRAPHY
Ultrasonography
X-RADIOGRAPHY
X-Radiography
TELEMEDICINE
Telemedicine
37. DEFENSE APPLICATIONS
•
•
•
•
•
•
•
•
•
Unmanned & manned vehicles
Warfighters
Satellites
Surveillance
Telemedicine
Smart weapons
Loitering weapons
Face recognition for laser-guided bullets
EO, IR, SAR & Hyperspectral sensors
WORLDWIDE REPRESENTATIVE
•
Prof. dr. Milan Prokin
• +381-11-3016-595, +381-11-3016-596
• +1-310-880-9030, +381-64-4557-702
•
[email protected], [email protected]
U.S. REPRESENTATIVE
•
Michael Collins
• +1-410-326-3001
• +1-410-320-7906
•
[email protected]