STRATEGIC ENCRYPTION www.crypto-logica.com

2. SECURITY PROBLEMS & SOLUTION Features of CryptoLogica Encryption and Hash Future proof due to both ultimate security and ultimate speed Unlimited key length (chosen by hardware/software embodiment) Unlimited hash length (chosen by hardware/software embodiment) Secure against faster computers due to longer keys Brutal force security due to longer keys Linear cryptanalysis security due to non-polynomial key finding Differential cryptanalysis security without weak keys Easily provable security due to simple algorithms Security beyond just key length due to user adjustable parameters Side-channel attack security due to lack of S-boxes, etc.

3. METHOD PROBLEMS & SOLUTION Features of CryptoLogica Encryption and Hash Non-polynomial key finding problem against cryptanalysis No matrix operations for simple hardware/software embodiments No vector operations for simple hardware/software embodiments No substitution (S) boxes for preventing side-channel attack Simple non-linear arithmetic for simple embodiments Simple design without a “trap door” preventing key finding Family of algorithms for further development and customization Unpublished algorithms for maximum top security Customizable algorithms for government security User adjustable parameters for mission-critical security

4. TECHNICAL PROBLEMS & SOLUTION Features of Cryptologica Encryption and Hash Highest encryption speed (several Gbit/s) on a single CPU thread Highest hashing speed (several Gbit/s) on a single CPU thread Ultralow latency for easy plug-in into current and new designs Small processing complexity for any hardware platform Small memory size for immediate applications anywhere Small memory bandwidth preventing memory bus bottleneck Low power consumption for portable and unattended devices Low heat dissipation for stealth and undercover operations Small weight of platform hardware for portable and aerial devices Small size of platform hardware for small devices

5. PRACTICAL PROBLEMS & SOLUTION Features of CryptoLogica Encryption and Hash Low cost of platform hardware for massive deployment Low cost of platform software for massive deployment Runs on any platform for installation on already deployed assets Simple and fast interfacing with top level applications Huge bit confusion by stream and block ciphers Huge bit diffusion by block ciphers Almost perfect randomness by stream and block ciphers Integer arithmetic running on any platform No multiplication for fast execution on general purpose processors No division for fast execution on general purpose processors

6. CRYPTOLOGICA SOLUTIONS CryptoLogica Team is developing its own public key encryption besides already developed symmetric key encryption and hash

7. CRYPTOLOGICA METHODS ∞ TYPE ENCRYPTION METHOD KEY LENGTH [bits] BLOCK [bits] SHORT LONG MIN MAX Stream CLIS Ideal Stream (4) 256 4096 ∞ CLOS Occult Stream 128 CLAS Advanced Stream 512 CLUS Ultimate Stream 384 CLES Extreme Stream 768 Block CLOB Occult Block CLAB Advanced Block CLUB Ultimate Block CLEB Extreme Block

8. SPEED @ SINGLE THREAD i7 2.2GHz Y P E NATIVE CL ALGORITHM VS AES CTR OPTIMIZED KEY LENGTH [bits] BLOCK SIZE ENC/DEC SPEED [Gbit/s] CL SPEED AES SPEED B AES CTR 256 128 1,401 1 S CLIS 4096 ∞ 6,752 4,819 CLOS 5,308 3,789 CLAS 6,663 4,756 CLUS 6,834 4,878 CLES 4,544 3,243 CLOB 5,263 3,757 CLAB 6,799 4,853 CLUB 6,594 4,707 CLEB 4,640 3,312

9. USER ADJUSTABLE PARAMETERS CryptoLogica solutions User parameters Size [bits] Hybrid stream ciphers Key length 256..4,294,967,296 Hybrid block ciphers Hash signature 4 simple stream methods Hash length 256..65,536 4 hybrid stream methods Stream offset 8, 16, 32 or 64 4 hybrid block methods Stream sum 8 hybrid hash methods Stream counter Zero encryption overhead Stream increment Identical ciphertext and plaintext bitrate Block offset Identical ciphertext and plaintext file size Block rounds Encryption speed almost independent on key length Block counter Hash speed almost independent on signature Block Increment

10. NIST STS 2.1 RANDOMNESS TESTS CRYPTOLOGICA methods passed all NIST STS 2.1 tests, determining whether or not the sequence can be considered random, while being many times faster than AES. For example: CRYPTOLOGICA methods solved all security, method, technical and practical problems in symmetric key encryption and hash authentication and verification, both now and in the future!

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 U.S. REPRESENTATIVE Michael Collins +1-410-326-3001 +1-410-320-7906 mc@ciffbe.com