Aiming at the problem of low negotiation efficiency and throughput of traditional Cascade algorithm, a Cascade-Biconf information negotiation algorithm for codrive chaotic synchronous key distribution is proposed. Based on the principle of parity check and dichotomous error correction algorithm, the obtained key is scrambled, divided into blocks, and the check value is transmitted for dichotomous error correction. Different from the traditional Cascade algorithm, the Cascade-Biconf information negotiation algorithm reduces the interaction times and computation amount in the negotiation process by optimizing the block size. The simulation results show that when the initial bit error rate of the two communication parties is 0.1, the Cascade-Biconf information negotiation algorithm can increase the negotiation efficiency of the traditional Cascade algorithm from 0.76 to 0.84, and the total throughput can be increased by 27.9%.