More sorting, efficient two-party shuffling, sparse matrix multiplication, graph cycle detection

• Secure two-party binary shuffle as in Peceny et al.
• Secure Quicksort
• Sparse matrix multiplication
• Graph cycle detection
• More efficient radix sort as in Asharov et al.
• Efficient two-party MUX as in CrypTFlow2
• Efficiency improvements in binary VM functionality
• Efficiency improvements in Beaver online phase
• Use newer version of libOTe if possible
• More efficient emulation of sorting and shuffling
• Fixed security bug: missing context in Fiat-Shamir.
• Fixed security bug: earlier checking in malicious replicated secret sharing.
• Fixed security bug: insufficient length check in commitment open.
• Fixed security bug: buffer overflow in malicious Shamir private output with sub-maximal threshold.
• Fixed security bug: remove secrets file in case of OT extension failure.