Citation Context

...omputationally hard problem. The conjugacy search problem (CSP) was first suggested for key exchange in the pioneering work by Anshel et al. [2, 1] and Ko et al. [7]. The CSP was later generalized in =-=[8]-=- for left conjugacy closed (LCC) loops as a partial conjugacy search problem (PSCP) allowing a wider class of platform structures. In this paper, we show that cryptographic protocols that rely on infe...