1 / 38

STRATEGIC ENCRYPTION

Crypto.Logica offers strategic encryption solutions with absolute technical security, protecting against computing developments and providing advanced encryption methods. Customize algorithms, generate secure keys, and experience high-speed encryption with maximum efficiency.

pstephen
Télécharger la présentation

STRATEGIC ENCRYPTION

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  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

  3. 3. SEVEN ENCRYPTION METHODS • B = BLOCK CIPHER • H = HYBRID CIPHER • S = STREAM CIPHER

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

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

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

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

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

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

  10. 11. SPEED @ Core2Duo 2.66GHz

  11. 12. ENCRYPTION/DECRYPTION SPEED

  12. 13. SPEED / AES SPEED

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  35. 36. MEDICAL APPLICATIONS • MAMMOGRAPHY • COMPUTERIZED TOMOGRAPHY • MAGNETIC RESONANCE IMAGING • ULTRASONOGRAPHY • X-RADIOGRAPHY • TELEMEDICINE • Mammography • Computerized tomography • Magnetic resonance imaging • Ultrasonography • X-Radiography • Telemedicine

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

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

More Related