1. STRATEGIC ENCRYPTION www.crypto-logica.com

2. 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 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. 3. SEVEN ENCRYPTION METHODS TYPETYPE ENCRYPTION METHOD KEY LENGTH [bits] BLOCK [bits] SHORTLONGMINMAX BSBCShort Block Cipher2562048128 BLBCLong Block Cipher5124096256 BUBCUltimate Block Cipher3842048256 BUBEUBC Extended7684096256 HSHCShort Hybrid Cipher2562048128 HHESHybrid Encryption Solution3842048256 SSTEStream Extended Cipher2048∞ B = BLOCK CIPHER H = HYBRID CIPHER S = STREAM CIPHER B = BLOCK CIPHER H = HYBRID CIPHER S = STREAM CIPHER

4. 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 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 4. ALGORITHM CUSTOMIZATION

6. 6. TOTALCRYPT Standard security level Personal use Working groups Social networks Small and medium size business Standard security level Personal use Working groups Social networks Small and medium size business

7. 7. TOTALCRYPT+ Advanced security level Bank systems Stock exchange Hi-tech business Municipality Police Advanced security level Bank systems Stock exchange Hi-tech business Municipality Police

8. 8. TOTALCRYPT UE Ultimate security level Government systems Security agencies Intelligence agencies Special users Defense Ultimate security level Government systems Security agencies Intelligence agencies Special users Defense

9. 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 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. 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 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. 11. SPEED @ Core2Duo 2.66GHz TYPETYPE ALGORITHM KEY LENGTH [bits] BLOCK SIZE [bits] ENC/DEC SPEED [Mbit/s] ALG SPEED AES SPEED BAES (Ref)256128731 BAES CTR256128700.96 BSBC20481281782.44 BLBC40962562052.81 BUBC20482562132.92 BUBE40962561421.95 HSHC20481281522.09 HHES 102410242563414.68 HHES 204820482561792.45 SSTE4096 5697.79

12. 12. ENCRYPTION/DECRYPTION SPEED

13. 13. SPEED / AES SPEED

14. 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 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. 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.

16. 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.

17. 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.

18. 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.

19. 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.

20. 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.

21. 21. NIST STS 2.1 RANDOMNESS TESTS Binary Matrix Rank Test determines the linear dependence among fixed length substrings of the original sequence.

22. 22. NIST STS 2.1 RANDOMNESS TESTS Discrete Fourier Transform (Spectral) Test detects periodic features (i.e. repetitive patterns that are near each other).

23. 23. NIST STS 2.1 RANDOMNESS TESTS Non-overlapping Template Matching Test detects too many occurences of a given non-periodic (aperiodic) pattern.

24. 24. NIST STS 2.1 RANDOMNESS TESTS Overlapping Template Matching Test determines the number of occurrences of pre-specified target strings.

25. 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.

26. 26. NIST STS 2.1 RANDOMNESS TESTS Approximate Entropy Test compares the frequency of all possible overlapping m-bit patterns across the entire sequence.

27. 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.

28. 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.

29. 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.

30. 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.

31. 31. NIST STS 2.1 RANDOMNESS TESTS Linear Complexity Test determines whether or not the sequence is complex enough to be considered random.

32. 32. COMPUTER APPLICATIONS File encryption Protocol encryption Folder encryption USB flash encryption Hard drive encryption Optical drive encryption Encryption processors File encryption Protocol encryption Folder encryption USB flash encryption Hard drive encryption Optical drive encryption Encryption processors

33. 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 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. 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 Lowest cost No dividers No multipliers Ultralow power Integer arithmetic Very low complexity Small integrated memory Ultrafast encryption and decryption Easy radiation hardening

35. 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 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. MAMMOGRAPHY COMPUTERIZED TOMOGRAPHY MAGNETIC RESONANCE IMAGING ULTRASONOGRAPHY X-RADIOGRAPHY TELEMEDICINE Mammography Computerized tomography Magnetic resonance imaging Ultrasonography X-Radiography Telemedicine Mammography Computerized tomography Magnetic resonance imaging Ultrasonography X-Radiography Telemedicine 36. MEDICAL APPLICATIONS

37. Unmanned & manned vehicles Warfighters Satellites Surveillance Telemedicine Smart weapons Loitering weapons Face recognition for laser-guided bullets EO, IR, SAR & Hyperspectral sensors Unmanned & manned vehicles Warfighters Satellites Surveillance Telemedicine Smart weapons Loitering weapons Face recognition for laser-guided bullets EO, IR, SAR & Hyperspectral sensors 37. DEFENSE APPLICATIONS

38. WORLDWIDE REPRESENTATIVE Prof. dr. Milan Prokin +381-11-3016-595, +381-11-3016-596 +1-310-880-9030, +381-64-4557-702 proka@el.etf.rs, milan.prokin@gmail.com Prof. dr. Milan Prokin +381-11-3016-595, +381-11-3016-596 +1-310-880-9030, +381-64-4557-702 proka@el.etf.rs, milan.prokin@gmail.com Michael Collins +1-410-326-3001 +1-410-320-7906 mc@ciffbe.com Michael Collins +1-410-326-3001 +1-410-320-7906 mc@ciffbe.com U.S. REPRESENTATIVE