// Anna Safavi
// Steve Saucedo package desRound;
import java.util.*; import java.math.*; import java.lang.*; public class DESRound { private String text; private String key; private static final byte[] IP = { 58, 50, 42, 34, 26, 18, 10, 2, 60, 52, 44, 36, 28, 20, 12, 4, 62, 54, 46, 38, 30, 22, 14, 6, 64, 56, 48, 40, 32, 24, 16, 8, 57, 49, 41, 33, 25, 17, 9, 1, 59, 51, 43, 35, 27, 19, 11, 3, 61, 53, 45, 37, 29, 21, 13, 5, 63, 55, 47, 39, 31, 23, 15, 7 }; private static final byte[] PC1 = { 57, 49, 41, 33, 25, 17, 9, 1, 58, 50, 42, 34, 26, 18, 10, 2, 59, 51, 43, 35, 27, 19, 11, 3, 60, 52, 44, 36, 63, 55, 47, 39, 31, 23, 15, 7, 62, 54, 46, 38, 30, 22, 14, 6, 61, 53, 45, 37, 29, 21, 13, 5, 28, 20, 12, 4 }; private static final byte[] PC2 = { 14, 17, 11, 24, 1, 5, 3, 28, 15, 6, 21, 10, 23, 19, 12, 4, 26, 8, 16, 7, 27, 20, 13, 2, 41, 52, 31, 37, 47, 55, 30, 40, 51, 45, 33, 48, 44, 49, 39, 56, 34, 53, 46, 42, 50, 36, 29, 32 }; private static final byte[] E = { 32, 1, 2, 3, 4, 5, 4, 5, 6, 7, 8, 9, 8, 9, 10, 11, 12, 13, 12, 13, 14, 15, 16, 17, 16, 17, 18, 19, 20, 21, 20, 21, 22, 23, 24, 25, 24, 25, 26, 27, 28, 29, 28, 29, 30, 31, 32, 1 }; private static final byte[][] S = { { 14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7, 0, 15, 7, 4, 14, 2, 13, 1, 10, 6, 12, 11, 9, 5, 3, 8, 4, 1, 14, 8, 13, 6, 2, 11, 15, 12, 9,
|1 |$ 60 |$ 45 |$ 105 |$ 60 |$ 45 |$ 105 |$ 45 |
6. 7. 8. 9. 10. 11. 12. 13. 14. 15. i. b d j c k e l a f
2, 2, 0, 5,1, 4,1, 3, 0, 0, 1, 4, 4, 0,1, 4, 3, 4, 2, 1
G, L, H, D, B, M, N, I, E, O, J, P, K, F, C, A
tuples are: 15, 19, 22, 25, 25, 45, 13, 16, 16, 33, 20, 20, 21, 22, 52, 70, 25, 25, 40, 46, 35,
3, 4, 5, 6, 7, 8, 9, 10, 11 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15 12, 13, 14, 15 16, 17, 18 19
128 | 64 | 32 | 16 | 8 | 4 | 2 | 1
Generally in connection based structure when two or more workstations transmit information in the same time, data gets blended up to noise and this state is known as collision. Right when the effect is seen in the workstations hold up certain amount of time and attempt to send once again. In this circumstance it can 't be picked when a workstation will get a chance to transmit. This kind of condition is known as nondeterministic protocol
3 3 3 3 4 4 4 7 7 7 8 9 11 12 13 14 15 16 17 18 19 21
int startTag = 0, endTag = 0, startALT = 0, endAltText = 0, startAltText = 0;
import java.io. Serializable; import java.net. InetAddress; import java.net. UnknownHostException; import java.rmi. NotBoundException; import java.rmi.
85 87 89 92 94 97 98 99 102 103 105 106 107 109 110 111 114 115 118
static char[] Array, duplicatearray; // declare two arrays one orignal and one copy array //
import java.awt. *; import java.awt.event. *; import java.net. *; import java.util. *; import javax.swing.