On the necessity of cryptanalytic exhaustive search. Hamid R. Amirazizi and Martin E. Hellman . A protocol for solving impossible problems. Fast decryption algorithm for the knapsack cipher. Hamid R. Amirazizi , Ehud D. Karnin , and Justin M. Reyneri .
Compact knapsacks are polynomially solvable.
A variant of a public key cryptosystem based on Goppa codes. Alan G. Konheim . A one-way sequence for transaction verification. Miles E. Smid . Towards a design procedure for cryptosecure substitution boxes.