BGRAFT: Grouped Anti-Byzantine RAFT Consensus Algorithm Based on RSA Encryption Algorithm

To solve the low performance of PBFT algorithm in large-scale networks in the consortium blockchain and RAFT algorithm cannot cope with the Byzantine problem, cannot exclude malicious nodes, and lack of security guarantee for node communication, this paper proposes the BGRAFT (Byzantine Fault Tolerance Grouped RAFT) consensus algorithm. The algorithm divides the network into small-sized network groups by dynamic network grouping and uses PBFT consensus within the group and RAFT consensus between the groups. At the same time, RSA signature encryption algorithm is introduced to guarantee the privacy and security of inter-node communication. It is shown that BGRAFT has Byzantine fault-tolerant characteristics in large-scale networks, while maintaining high consensus efficiency and scalability, which is better than PBFT, and can achieve 100% message tampering detection rate.