It is a well-known fact that almost all currently existing messengers depend on either groups of individuals or States, which implies inevitable control. This primarily violates the human understanding that you are constantly monitored by. As for antivirus software, in most cases, it is a virus that proceeds and refers all your actions to the development server.
Imagine a picture. You are a resident of China and you need to send a data letter with crucial information (a photo of a girl or a bank document, etc.) to your friend who lives in the US. If you use a regular operator, you will be charged at least $ 0.5. You can use a free messenger, while taking into consideration that it has nothing to do with anonymity and privacy during the data transfer. The one who controls the server has access to all the data.
The SISHUB project totally breaks the system (where services have public servers had ip-adress when they can know your geo-position and watch what you are doing) which we have been using for a long time already, suggesting a decentralized block diagram combined with a triple encryption code and block chain technologies.
And now a resident of China will spend only $ 0.001 for a regular text-message, while the developers of this project have no control over the data. The system is decentralized (each user of the system becomes an independent server), using a triple encryption code and block chain technology. This system is also able to protect your network from attacks and interception, providing an additional shield of the transmitted data by third parties.
As for anti-virus software, imagine a powerful anti-virus software with a decentralized system not only for one computer, but for the entire network which costs only $ 5 per year. How is this possible? Thanks to the SISHUB project, this would be a reality.
The SISHUB project is developing an anonymous messenger and a decentralized system for sharing data through the utilization block chain technologies. For public mass all over the world that will significantly reduce the cost of using such solutions, and primarily will make you anonymous and protect the personal data transfer.
While users will use messenger he will be pay minimal paying in tokens STEEL(STL) in middle of 5$ - it 5,000 encrypted messages, witch you can spend any time what you want.
1. The messengerThe transfer of encrypted messages in a decentralized system (each user of the system keeps a part of the encrypted messages of all users), the key of the encryption will be the token itself, which will be burned and transferred in percentage terms of the holders of the purse of STEEL coins when data transfer. We have decentralized system by triple encryption and block chain technologies. They have no ip-address and have covered identificators and tunnels. They will transfer information and change every 10 minutes. It's made SISHUB project absolutely anonymous.
2. System of personal data protection.We install special software that encrypts the network and allows the data to be transmitted between all users. The token is also used by the key to decrypt the data. It allows us to transfer files without fear of hacking or interception during the transfer of information. An intruder who might even manage to intercept files from the network, would never be able to open them or use them in any way. The key is the Token that is passed from the first user to the second one. We have developed a flexible adaptive security system which is not only able to identify viruses from non-public databases, but also searches for and fixes the security system and correct all the shortcomings of it.
How the messenger worksWe develop a messenger in which is based on 3 encryption methods and hashing protocol:
1. AES CBC - Ehrsam, Meyer, Smith and Tuchman invented the Cipher Block Chaining (CBC) mode of operation in 1976. In CBC mode, each block of plaintext is XORed with the previous ciphertext block before being encrypted. This way, each ciphertext block depends on all plaintext blocks processed up to that point. To make each message unique, an initialization vector must be used in the first block.
CBC has been the most commonly used mode of operation. Its main drawbacks are that encryption is sequential (i.e., it cannot be parallelized), and that the message must be padded to a multiple of the cipher block size. One way to handle this last issue is through the method known as ciphertext stealing. Note that a one-bit change in a plaintext or IV affects all following ciphertext blocks.
Decrypting with the incorrect IV causes the first block of plaintext to be corrupt but subsequent plaintext blocks will be correct. This is because each block is XORed with the ciphertext of the previous block, not the plaintext, so one does not need to decrypt the previous block before using it as the IV for the decryption of the current one. This means that a plaintext block can be recovered from two adjacent blocks of ciphertext. As a consequence, decryption can be parallelized. Note that a one-bit change to the ciphertext causes complete corruption of the corresponding block of plaintext, and inverts the corresponding bit in the following block of plaintext, but the rest of the blocks remain intact. This peculiarity is exploited in different padding oracle attacks, such as POODLE.
2. DSA - The Digital Signature Algorithm is a Federal Information Processing Standard for digital signatures. In August 1991 the National Institute of Standards and Technology (NIST) proposed DSA for use in their Digital Signature Standard (DSS) and adopted it as FIPS 186 in 1993.[not in citation given] Four revisions to the initial specification have been released: FIPS 186-1 in 1996, FIPS 186-2 in 2000, FIPS 186-3 in 2009, and FIPS 186-4 in 2013.
DSA is covered by U.S. Patent 5,231,668, filed July 26, 1991 and attributed to David W. Kravitz, a former NSA employee. This patent was given to "The United States of America as represented by the Secretary of Commerce, Washington, D.C.", and NIST has made this patent available worldwide royalty-free. Claus P. Schnorr claims that his U.S. Patent 4,995,082 (expired) covered DSA; this claim is disputed. DSA is a variant of the ElGamal signature scheme.
Key generation has two phases. The first phase is a choice of algorithm parameters which may be shared between different users of the system, while the second phase computes public and private keys for a single user.
3. HMAC In cryptography, a keyed-hash message authentication code (HMAC) is a specific type of message authentication code (MAC) involving a cryptographic hash function and a secret cryptographic key. It may be used to simultaneously verify both the data integrity and the authentication of a message, as with any MAC. Any cryptographic hash function, such as MD5 or SHA-1, may be used in the calculation of an HMAC; the resulting MAC algorithm is termed HMAC-X, where X is the hash function used (e.g. HMAC-MD5 or HMAC-SHA1). The cryptographic strength of the HMAC depends upon the cryptographic strength of the underlying hash function, the size of its hash output, and the size and quality of the key.
HMAC generation uses two passes of hash computation. The secret key is first used to derive two keys – inner and outer. The first pass of the algorithm produces an internal hash derived from the message and the inner key. The second pass produces the final HMAC code derived from the inner hash result and the outer key. Thus the algorithm provides better immunity against length extension attacks.
An iterative hash function breaks up a message into blocks of a fixed size and iterates over them with a compression function. For example, MD5 and SHA-1 operate on 512-bit blocks. The size of the output of HMAC is the same as that of the underlying hash function (e.g., 128 or 160 bits in the case of MD5 or SHA-1, respectively), although it can be truncated if desired.
HMAC does not encrypt the message. Instead, the message (encrypted or not) must be sent alongside the HMAC hash. Parties with the secret key will hash the message again themselves, and if it is authentic, the received and computed hashes will match.
4. SHA-2 is a set of cryptographic hash functions designed by the United States National Security Agency (NSA). Cryptographic hash functions are mathematical operations run on digital data; by comparing the computed "hash" (the output from execution of the algorithm) to a known and expected hash value, a person can determine the data's integrity. For example, computing the hash of a downloaded file and comparing the result to a previously published hash result can show whether the download has been modified or tampered with. A key aspect of cryptographic hash functions is their collision resistance: nobody should be able to find two different input values that result in the same hash output.
SHA-2 includes significant changes from its predecessor, SHA-1. The SHA-2 family consists of six hash functions with digests (hash values) that are 224, 256, 384 or 512 bits: SHA-224, SHA-256, SHA-384, SHA-512, SHA-512/224, SHA-512/256.
SHA-256 and SHA-512 are novel hash functions computed with 32-bit and 64-bit words, respectively. They use different shift amounts and additive constants, but their structures are otherwise virtually identical, differing only in the number of rounds. SHA-224 and SHA-384 are simply truncated versions of the first two, computed with different initial values. SHA-512/224 and SHA-512/256 are also truncated versions of SHA-512, but the initial values are generated using the method described in Federal Information Processing Standards (FIPS) PUB 180-4. SHA-2 was published in 2001 by the National Institute of Standards and Technology (NIST) a U.S. federal standard (FIPS). The SHA-2 family of algorithms are patented in US patent 6829355.[5] The United States has released the patent under a royalty-free license.
Currently, the best public attacks break preimage resistance for 52 out of 64 rounds of SHA-256 or 57 out of 80 rounds of SHA-512, and collision resistance for 46 out of 64 rounds of SHA-256.
SHA-256 and SHA-512, and, to a lesser degree, SHA-224 and SHA-384 are prone to length extension attacks, rendering it insecure for some applications. It is thus generally recommended to switch to SHA-3 for 512 bit hashes and to use SHA-512/224 and SHA-512/256 instead of SHA-224 and SHA-256. This also happens to be faster than SHA-224 and SHA-256 on x86-64, since SHA-512 works on 64 bit instead of 32 bit words.[8]
The message from the user will be encrypted and hashed, therefore, the token will be used as an encryption key to decrypt the message for the End-User.
The working principle of decentralized public block chart (Security system).Our company provides/offers special software, which code net and figures/data inside it. Token could be used as a key for decoding figures. It lets to transmit any files and not being scared that they could be stolen or intercepted during sending. Even if hacker/robber stole any files, he couldn't open it because of having no token , which sends only between owners.
We made flexible system of adaptable secure , which apart from of the fact that system kills* viruses from nonpublic base of figures, it could correct any system defects of security base and all any mistakes.
Security system based on decentralized sharing figures between users. It codes by(AES CBC, DSA, HMAC) and optionally heshing by (SHA256). We used blockchain as a key of coding in this system, and it lets open* data by the real native owner.
STEEL EconomyThe volume of issued tokens is 35,000,000,000 STEEL.
Soft cap — 5,000 ETH. Hard cap — 50,000 ETH.
All unsold tokens will be destroyed. The number of tokens sold will be increased by 20%, out of which 20% - goes to the team expences for testing, development and support of new functions. The lower budget threshold provides the development of the basic functions of the STEEL project and support of the infrastructure, and the funds exceeding it allow to speed up the development and attract the maximum number of users. The used STEEL tokens (paid for the use of the service) will be distributed to investors every 30 days in proportion to the number of tokens in their wallet from 5,000,000 STEEL (STL) for more than 30 days.
Closed preSale • Start: 05.03.2018
• Finish: 30.03.2018
• Goal: 250 ETH
• Inlet minimum: 2 ETH
• 1 ETH = 1,000,000 STEEL
• Acquisition through closed registration.
preICO • Start: 09.05.2018
• Finish: 30.07.2018
• Goal: 300 ETH, Hardcup: 1,000 ETH
• Inlet minimum: 1 ETH
• 1 ETH = 500,000 STEEL
• Acquisition through open registration.
ICO • Start: 20.06.2019
• Finish: 20.08.2019
• Goal: Softcap: 5,000 ETH, Hardcap: 50,000 ETH
• Inlet minimum: 0,1 ETH
• Accepted crypto-currencies: ETH
ROADMAP 
Our team 
Advisory board
Daniel Mester - IR Wiz Enterprise, Co/founder of a number of companies in the field of social games, online.
Alexander Tabak
CEO and Founder в Cluster - Disruptive Tech Hub, Art and Social Innovations
CEO and founder IoT Israel and Robotics Israel CEO and founder Tour Now
CEO and founder Voice City
CEO and founder CoLab
CEO and founder IOTA LABS - Israel IoT HUB
Dmitry Pshenin
Investor in Crypto currency, Mining, ICO Marketing, Social Media Strategist,
Networker, Key Note Speaker (21k+ LION)
Richard Trummer
ICO Advisor at COINEXIS and Bitozz Cryptocurrency Enthusiast, ICO Advisor and Investor. Part of an Investors group. Cryptocurrency trading and mining. Translations(engl. to German, whitepapers,...). Internet Marketing Expert specialized in helping others to fulfill their dreams by showing them how to earn a full-time income on the internet. Affiliate marketing and Facebook-ads traffic, selling high ticket products. Wide range of experience in different areas of IM.
Egor Buravtsov
The founder of ICO Summit Moscow, enterpreneur, investor, has joined our team of advisors. He used to work as the CEO of PROMMASH LLC (co-founded the company), and has experience in banking sector (ABN AMRO Bank , The Royal Bank of Scotland, Raiffeisenbank, Gazprombank, Transkreditbank).
Ira Dolgin
Founder of PickMoment company in Israel, is highly experienced in digital and content marketing, as well as ICO&Blockchain promotion.
Gary Baiton
Gary spends his time relentlessly focused on his network and investor experience.
Gary is an inspired visionary, blockchain entrepreneur, with long lasting experience founding and developing innovative solutions. For the past several years focused on ICO/Blockchain technologies,
founding several companies that had successfully exits, Gary is fully dedicated to blockchain community today.
Gary joined blockchain sector in 2016 and immediately got involved with cryptocurrency, as well as helping startups to enter this new, phenomenal world.
Over his 20-year career as a cybersecurity expert and startup entrepreneur, he developed numerous innovations’ and recently -blockchain products.
Chinese translation
https://bitcointalk.org/index.php?topic=3431973.0Russian translation
https://bitcointalk.org/index.php?topic=3399214.0 Contacts
Site | Mail | Telegram | Instagram | Facebook | Twitter | GitHub | Reddit | Medium | Youtube WhitepaperDownload Whitepaper EnglishPresentationEN
