# A Novel and Robust Hybrid Blockchain and Steganography Scheme
## 3 Methodology and Proposed Method
### Proposed Ozyavas-Takaoglu-Ajlouni (OTA) Algorithm
#### 3.3.1 OTA-Steganography Algorithm
The transaction took place instantly in the test environment, and the sending node was rewarded with 50 OTA coins for gaining the right to write blocks. The address arrays created by the OTA-steganography algorithm for 10-bit marking for different sizes of plaintext data can be sent inside transactions easily because a 50 OTA coins is allocated to the accounts of the nodes when they join the system. The continuing steganographic communication within the system ensures that OTA coins will change hands so that even if the nodes do not receive the miner reward, they will have enough coins to trade in the system. Therefore, the OTA-chain algorithm provides a sustainable blockchain steganography communication. \begin{table}
\begin{tabular}{l c c c c c c c c c c c c c c c c c c c c c} \hline \hline \multicolumn{1}{l}{**Embedded**} & \multicolumn{1}{c}{**Data Size**} & \multicolumn{1}{c}{**1 kB**} & \multicolumn{1}{c}{**5 kB**} & \multicolumn{1}{c}{**10 kB**} & \multicolumn{1}{c}{**20 kB**} & \multicolumn{1}{c}{**20 kB**} \\ \hline Bit Block & 2 & 4 & 6 & 8 & 10 & 2 & 4 & 6 & 8 & 10 & 2 & 4 & 6 & 8 & 10 & 2 & 4 & 6 & 8 & 10 \\ Size & Bits & Bits & Bits & Bits & Bits & Bits & Bits & Bits & Bits & Bits & Bits & Bits & Bits & Bits & Bits & Bits & Bits \\ \hline Encoding time (ms) & 3 & 2 & 6 & 22 & 645 & 6 & 7 & 24 & 4895 & 28,073 & 11 & 14 & 28 & 69 & 30,300 & 26 & 25 & 45 & 89 & 30,217 \\ \hline Array size & 3916 & 1958 & 1306 & 979 & 784 & 19,580 & 9790 & 6527 & 4895 & 3916 & 29,160 & 19,580 & 13,054 & 9790 & 7832 & 80,524 & 40,262 & 26,842 & 20,131 & 16,105 \\ \hline No of arrays required & 4 & 2 & 2 & 1 & 1 & 20 & 10 & 7 & 5 & 4 & 39 & 20 & 13 & 10 & 8 & 79 & 40 & 27 & 20 & 16 \\ \hline \hline \end{tabular}
\end{table} 
Table 2: OTA-Steganography CI-1 Results. Figure 7: Example of OTA-Chain Transaction. The OTA-chain algorithm was developed with decentralized, scalability, security, and cost in mind. Even though the proposed system may require a considerable amount of time for very large data, it does not suffer in terms of scalability because steganographic communication will only use relatively small size data. Additionally, due to the difficulty level of the PoW algorithm in low transaction volume systems, energy consumption will be kept at a minimum level. Additionally, because the system is a private blockchain, attacks common to public blockchains are prevented. Encrypting the transmitted information with the OTA encryption algorithm in order to avoid insider attacks has elevated the internal security of the system to the next level. Because the OTA-chain private blockchain system uses its own coin and distributes it free of charge to the nodes with access rights, system costs are limited in that users required only to record transactions as a miner for their hardware. The theory of the proposed OTA-chain algorithm has been put into practice. After the front-end work of the system is completed, it will be shared with the public. The OTA-chain system ensures complete anonymity. Transactions performed in the system can be followed, but it is not possible to track down the users. With the proposed system, real-time data access is provided. It is resistant to all kinds of steganalysis methods and has a tamper-proof structure. The system is closed to the intervention of third parties. ### General Analysis of OTA Algorithm

The OTA algorithm is a novel blockchain steganography algorithm. Its design takes into consideration the new techniques offered by blockchain technology and is not based on traditional steganography techniques. The proposed algorithm provides enhancements on hiding capacity (payload capacity), imperceptibility, security, and robustness, which are emphasized in steganography studies. None of the deficiencies seen in the studies expressed in the literature review are applicable to the OTA algorithm. For example, the payload capacity, which [PERSON] et al. [22] tried to increase in the proposed study, has been made unlimited.