• Plaintext: 01110010 Simplified-DES • Key: 1010000010 • Ciphertext: 01110111 10-bit key 10 P10 Simplified-DES LS-1 LS-1 P10 (permutate) Input : 123456789 10 Output: 35274 10 1986 P8 K, + P8 (select and permutate) Input :1 23456789 10 Output: 637485 109 LS-2 || LS-2 LS-1 (left shift 1 position) LS-2 (left shift 2 positions) P8 K 8-t plaitest • S-DES (and DES) perform substitutions using S-Boxes • S-Box considered as a matrix: input Simplified-DES IP (initial permutation) Input :12345678 Output:2 63 14857 used to select row/column; selected element is output 4 bit input: bit1, bit2, bit3, bit4 bit1, bit4 specifies row (0,1,2 or 3 in sw decimal) bit2, bit3 specifies column 2-bit output EP(expand and permutate) Input :1 2 34 Output:4 123 2 3 41 01 00 11 10 P4 (permutate) Input :123 4 Output:2 431 00 01 10 11 10 00 01 11 11 00 01 00 10 01 00 11 11 10 01 00 S0 = S1 = 00 10 01 11 11 01 11 10 IP-(inverse of IP)

• Plaintext: 01110010 Simplified-DES • Key: 1010000010 • Ciphertext: 01110111 10-bit key 10 P10 Simplified-DES LS-1 LS-1 P10 (permutate) Input : 123456789 10 Output: 35274 10 1986 P8 K, + P8 (select and permutate) Input :1 23456789 10 Output: 637485 109 LS-2 || LS-2 LS-1 (left shift 1 position) LS-2 (left shift 2 positions) P8 K 8-t plaitest • S-DES (and DES) perform substitutions using S-Boxes • S-Box considered as a matrix: input Simplified-DES IP (initial permutation) Input :12345678 Output:2 63 14857 used to select row/column; selected element is output 4 bit input: bit1, bit2, bit3, bit4 bit1, bit4 specifies row (0,1,2 or 3 in sw decimal) bit2, bit3 specifies column 2-bit output EP(expand and permutate) Input :1 2 34 Output:4 123 2 3 41 01 00 11 10 P4 (permutate) Input :123 4 Output:2 431 00 01 10 11 10 00 01 11 11 00 01 00 10 01 00 11 11 10 01 00 S0 = S1 = 00 10 01 11 11 01 11 10 IP-(inverse of IP)

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Topic : Mips Datapath Covert this c code to mips code. For(i=0; i< id number; i++) Sum= sum + ( A[i] + 5 )
LA=33bit PA=24bit Page size=2kb System is byte addressable. Find total number of pages and frames.
254. In OOOVBOVB, V stands for violation and B stands for a. Bit b. Baud c. Bandwidth d. Bipolm
In the steps of “Append the padding bits” in SHA-512 system (shown in Figure 1), the message is padded so that its length is congruent to 896 mod 1024 or (length ≅ 896 mod 1024). State the value of the following padding field is the message length is: a) 1919 b) 1920 c) 2942
greatestBitPos(x) Compute a mask marking the most significant 1 bit. program should return maskmarking not value of significant bit example: greatestBitPos(96) = 0x40 /* * greatestBitPos - return a mask that marks the position of the* most significant 1 bit. If x == 0, return 0* Example: greatestBitPos(96) = 0x40* Legal ops: ! ~ & ^ | + << >>* Max ops: 70* Rating: 4 */int greatestBitPos(int x) {return 2;}
The initial step in producing an RSA-PSS signature for a given message M involves the creation of a standardized message digest with a predetermined length, which is referred to as a/an ------------------------. The 2009 edition of FIPS 186 incorporates various methods that rely on RSA Laboratories' developments and are widely employed, in addition to the NST Digital Signature Algorithm and ECDSA. FIPS 186-3 includes digital signature algorithms that are founded on RSA and another form of cryptography.
implement bitMask(x,y) Generate a mask consisting of all 1’s from lowbit to highbit /* * bitMask - Generate a mask consisting of all 1's * lowbit and highbit* Examples: bitMask(5,3) = 0x38* Assume 0 <= lowbit <= 31, and 0 <= highbit <= 31* If lowbit > highbit, then mask should be all 0's* Legal ops: ! ~ & ^ | + << >>* Max ops: 16* Rating: 3*/int bitMask(int highbit, int lowbit) {return 2;}
InstructionsOpcodes - LDA = 00 SN opcode n i x b p e Displacement Target Address (TA) 1 000000 1 1 0 0 1 0 0110 0000 0000 2 000000 1 1 1 1 0 0 0011 0000 0000 3 000000 1 0 0 0 1 0 0000 0011 0000 4 000000 0 1 0 0 0 0 0000 0011 0000 5 000000 1 1 0 0 0 1 0000 1100 0011 0000 0011 Using diagrams, mathematic notations or representations explain the syntax analysis stage inthe program compilation process and its effect or relationship on/with the token table
Encode the following bit stream, 01001101 with the following encoding schemes: a) NRZ-L b) NRZ-I c) AMI d) Manchester e) Differential Manchester f) Bipolar g) NRZ
The following was encrypted with DES utilizing ECB and base 64 encoding: WziSIkVWLmxSaCXRH1Q/q9VXjz5AnbiM The key was: 11415678
screenshot of the results how to implement S-DES on Anaconda jupyter? with the followings information: Key: 10 bits 8 bit plaintext rounds : initial and final initial-premutation : 26314857 final-permutation : 41357286 expension : 41232341 pt = "123456ABCD132536"key = "AABB09182736CCDD
a)Given a 64 bit plaintext FFFE 397D AC28 8855 and 48 bit Round key 4D77 32C5 29EF, perform one round DES encryption and decrypt the computed cipher retrieving the original input. b) Given a 56-bit key 88DF E9DC C277 CA, compute 48 bit Round1, Round2 and Round3 keys