Often in encryption it is a mistake to use an easily guessed key, like one with all 0’s or all 1’s or with a short, repeating pattern. what step in des provides for "randomization"? for example, at what step would an all-zero input result in a set of non-zero outputs? use the student id j00386388 then your plaintext is 00386388386388 (in hex) and your key is 00386388386388 (in hex).