{'fraction_non_alphanumeric': 0.036626916524701875, 'fraction_numerical': 0.004258943781942078, 'mean_word_length': 5.283422459893048, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Algorithm-Based Fault-Tolerant Cryptography

The algorithm-based fault-tolerant (ABFT) scheme has been applied to computation-intensive tasks for couple of years. This technique mainly deals with matrix operations that are capable of using the ready-made ALUs in certain protocol architectures. Besides, the ABFT-based fault-tolerant scheme can be performed concurrently with the cryptographic processes. In that case, overhead associated with the additional redundancy can be reduced. Because of the advantages compared with other fault-tolerant methods, we adjust and integrate the ABFT technique into error detection and correction schemes for symmetric key encryption/decryption and hash function cryptosystem. RC4, AES, and SHA-512 are specified examples set for conventional stream ciphers, block ciphers, and hash functions, respectively, to show our claim. These proposed approaches can provide simple computation, robust fault tolerance, reasonable overhead, and fast error detection/correction also, which make ABFT-based schemes practical and useful. 
 
 
Keywords: 
 
ABFT; 
RC4; 
AES; 
hash function; 
check-sum; 
fault tolerant; 
error detection and correction