Upload 3 files

chunks (1).json

@@ -0,0 +1,6 @@
+[
+    "Chapter 04 Data Encryption Standard ( DES ) Computer Security-3 INTRODUCTION The Data Encryption Standard ( DES ) is a symmetric - key block cipher published by the National Institute of Standards and Technology ( NIST ) . In 1973 , NIST published a request for proposals for a national symmetric-key cryptosystem . A proposal from IBM , a modification of a project called Lucifer , was accepted as DES . DES was published in the Federal Register in March 1975 as a draft of the Federal Information Processing Standard ( FIPS ) . DES \u2022 Data Encryption Standard ( DES ) encrypts blocks of size 64 bit . \u2022 Standardized 1977 by the National Bureau of Standards ( NBS ) today called National Institute of Standards and Technology ( NIST ) . \u2022 Most popular block cipher for most of the last 30 years . \u2022 By far best studied symmetric algorithm . \u2022 Nowadays considered insecure due to the small key length of 56 bit . \u2022 But : 3DES yields very secure cipher , still widely used today . \u2022 Replaced by the Advanced Encryption Standard ( AES ) in 2000 DES is a block cipher , as shown in Figure 1 . Figure 1 Encryption and decryption with DES DES Structure Figure 2 General structure of DES The encryption process is made of two permutations ( P - boxes ) , which we call initial and final permutations , and sixteen Feistel rounds . 6.6 Initial and Final Permutations 6.8 Key Scheduling Key Scheduling The initial and final permutations are straight P-boxes that are inverses of each other . They have no cryptography significance in DES . Note Initial and Final Permutations DES uses 16 rounds . Each round of DES is a Feistel cipher .",
+    "and Final Permutations 6.8 Key Scheduling Key Scheduling The initial and final permutations are straight P-boxes that are inverses of each other . They have no cryptography significance in DES . Note Initial and Final Permutations DES uses 16 rounds . Each round of DES is a Feistel cipher . Rounds L and R swapped again at the end of the cipher , i.e. , after round 16 followed by a final permutation The heart of DES is the DES function . The DES function applies a 48-bit key to the rightmost 32 bits to produce a 32-bit output . DES Function Figure 5 DES function Expansion P-box Since RI\u22121 is a 32-bit input and KI is a 48-bit key , we first need to expand RI\u22121 to 48 bits . Expansion P-box The S-boxes do the real mixing ( confusion ) . DES uses 8 S-boxes , each with a 6- bit input and a 4-bit output . S-Boxes Figure 8 S-box rule S-Boxes The input to S - box 1 is 1 0001 1 . What is the output ? If we write the first and the sixth bits together , we get 11 in binary , which is 3 in decimal . The remaining bits are 0001 in binary , which is 1 in decimal . We look for the value in row 3 , column 1 , in Table 6 . 3 ( S - box 1 ) . The result is 12 in decimal , which in binary is 1100 . So the input 100011 yields the output 1100 . Solution S-Boxes The input to S - box 1 is 1 0001 1 . What is the output ? If we write the first and the sixth bits together , we get 11 in binary",
+    "which in binary is 1100 . So the input 100011 yields the output 1100 . Solution S-Boxes The input to S - box 1 is 1 0001 1 . What is the output ? If we write the first and the sixth bits together , we get 11 in binary , which is 3 in decimal . The remaining bits are 0001 in binary , which is 1 in decimal . We look for the value in row 3 , column 1 , in Table 6 . 3 ( S - box 1 ) . The result is 12 in decimal , which in binary is 1100 . So the input 100011 yields the output 1100 . Solution S-Boxes The input to S - box 8 is 000000 . What is the output ? If we write the first and the sixth bits together , we get 00 in binary , which is 0 in decimal . The remaining bits are 0000 in binary , which is 0 in decimal . We look for the value in row 0 , column 0 , in Table 6 . 10 ( S - box 8 ) . The result is 14 in decimal , which is 1101 in binary . So the input 000000 yields the output 1110 . Solution S-Boxes The input to S - box 8 is 000000 . What is the output ? If we write the first and the sixth bits together , we get 00 in binary , which is 0 in decimal . The remaining bits are 0000 in binary , which is 0 in decimal . We look for the value in row 0 , column 0 , in Table 6 . 10 ( S - box 8 ) . The result is 14 in",
+    ", which is 0 in decimal . The remaining bits are 0000 in binary , which is 0 in decimal . We look for the value in row 0 , column 0 , in Table 6 . 10 ( S - box 8 ) . The result is 14 in decimal , which is 1101 in binary . So the input 000000 yields the output 1110 . Solution S-Boxes 6.24"
+]

faiss_index (1).bin

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6070c78f148ba21084930f00023bad7be9415816918c99852aff7979e4d1beaa
+size 6189

metadata (1).pkl

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5106276d138c952fea8ae6e576c20aae6adfa52964fc3b17b36ad8f28279cf16
+size 50