He presented both a chosen-plaintext attack and a known-plaintext attack; each uses about 236 plaintexts and 290 work, but the known-plaintext attack requires much more memory.
He presented two types of attacks: one using chosen plaintexts and the other using known plaintexts. Both methods require around 236 plaintexts and 290 calculations, although the latter needs much more storage space.