Abstract
In this paper, we introduce a reconciliation protocol with a two-step error correction scheme that uses a short-blocklength, low-rate code and a long-blocklength, high-rate code. We simulate the protocol using a short-block-length low-density parity-check code and show that we can achieve reconciliation efficiencies above 1 using this method. We discuss the necessary steps required regarding security proofs before this protocol can be securely implemented.