Implement the first round of AES ( Advanced Encryption Standard ) in python.   Given a message with 128 bits, two subkeys subkey0 and subkey1, your program should be able to perform one AddKey before Round 1 and the corresponding operations (SubBytes, ShiftRows, Mix-Columns, and AddKey) in Round 1, and output the result of the encryption after Round 1.

A palindrome is a sequence that is the same as its reverse. For example, the word "RACECAR" is a palindrome. For this problem we will define an almost palindrome to be a sequence that can be transformed into its reverse with 2 or fewer character additions, deletions, replacements, or swaps. A character swap swaps two adjacent characters. For instance "MARJORAM" can be reversed by swapping the 'J' and the 'O'. In addition, "FOOLPROOF" can be reversed by replacing the 'R' with and 'L' and vice versa. Finally, the word "BONOBO" can be reversed by deleting the final 'O' and reinserting it at the beginning. Devise a dynamic programming algorithm that will determine the number of edits necessary to to transform a sequence into its reverse. a) State this problem with formal input and output conditions. b) State a self-reduction for this problem. c) State a dynamic programming algorithm based off of your self-reduction that computes the minimum number of edits to transform a sequence into its…

How do I SUM a list of float? as the output of the previous script, I have this [-0.004894362613156397] [-0.005284630990696516] [-0.39715504708587857] [-0.23893503091440427]... (the floats are calculated potential energy between two atoms in a system of multiple atoms) basically a list of many floats, all in separate rows. I have been searching method to SUM all the float element so that I can end up with a single number ( sum = x), but I have not find anything that works. Can you please help finding a way? the following script is what generates the list above

The Reflection algorithm can be used to encrypt a C-string (character array terminated with the null character) before it is transmitted over the Internet. The Reflection algorithm works as follows:  Each letter in the message is converted to the letter in that is 13 positions to the right of that letter in the English alphabet. If the end of the alphabet is reached, counting continues from the first letter in the alphabet. The case of the letters must be maintained. For example,'M' →'Z', 'x' → 'k', 'A' → 'N'The numeric characters ('0' to '9') are shifted 5 positions to the right of that number in the character set '0' to '9'. If ‘9’ is reached, counting continues from ‘0’. For example,'0' → '5', '2' →'7', '8' → '3' All other characters are left as they are. a) What would the following string be encrypted to by the Reflection algorithm?“Call me at 662-2002 Ext 85393”  b) Write a function, getPosition, which finds the position of a letter in the alphabet regardless of the case of the…

Write a script (Python) for least squares l2 that can receive either: a 2D point cloud. Let the program load an ASCII txt file with the data in two columns, as appropriate. The number of points is arbitrary. In addition, display a graph with the cloud of points and the approximate line, together with the error made.

Your aim is to determine the largest k numbers among n numbers stored in a text file with one number per line.(n >> k). However, we can only read n numbers from the file line by line, ie one by one, we do not have the possibility to read and store them all at once. Under these circumstances, implement the algorithm, which finds and returns k numbers with the largest value for a given value of k out of n numbers in the file, in a programming language of your choice. Your algorithm's timecomplexity should be better than O (nk).

Write python code to find the submatrix. Thank you in Advance.   You are given a 2D matrix that is filled with 1's in almost all the cells. However, there may be at most one rectangular submatrix that is filled with 0s. Implement an algorithm to return the size of the submatrix, in terms of width and height. Examples: Input: [[1,1,1,1,1,1,1], [1,1,1,1,1,1], [1,1,0,0,0,1], [1,1,0,0,0,1], 11,1,1,1,1,1]] Output: [3,2] (Because the width of the sumbmarix 3, and highets 2 Input: [[1,1,1,1], [1,1,1,1], [1,1,1,1]] Output: [0,0] (Because the there is no submatrix that contains 0s) Input: [[1,1,1,1], [1,1,0,1] [1,1,1,1]] Output: [1,1] (Because the width of the submatrix of 0s is 1, and height is 1)

C programming Implement an encoder. When completed, your program should be able to accept a short sentence from the user and display an encrypted version of it. For simplicity, let us assume one case of letters throughout, say CAPITALS. We can use a substitution method to scramble a sentence and then use the reverse of this process to recover it. If we take two rows of the alphabet and shift the bottom row along a specified amount (our key), we can then read the letters in our sentence from the top row and use the substituted letter from the bottom row to form the encrypted sentence. A B C D E F G H I J K L M N O P Q R S T U V W X Y Z X Y Z A B C D E F G H I J K L M N O P Q R S T U V W In the example above, the key is 3, hence the second row is shifted by three characters along. Take, for instance, the sentence “HELLO”. Each letter of your message should be replaced by the letter in the alphabet that comes three letters before. For “HELLO” that would be: EBIIL Your program is required…

Encryption Matrices are commonly used to encrypt data. Here is a simple form such an encryption can take. First, we represent each letter in the alphabet by a number, so let us take = 0, A = 1, B = 2, and so on. Thus, for example, "ABORT MISSION" becomes [1 2 15 18 20 0 13 9 19 19 9 15 14]. To encrypt this coded phrase, we use an invertible matrix of any size with integer entries. For instance, let us take A to be the 3 2 2 x 2 matrix 4 1 We can first arrange the coded sequence of numbers in the form of a matrix with two rows (using zero in the last place if we have an odd number of characters) and then multiply on the left by A. 3 2 1 15 20 13 19 9 14 Encrypted Matrix = 4 1 2 18 0 9. 19 15 0 7 81 60 57 95 57 42 = 6 78 80 61 95 51 56 which we can also write as [7 6 81 78 60 80 57 61 95 95 57 51 42 56]. To decipher the encoded message, multiply the encrypted matrix by A1. The following exercise uses the above matrix A for encoding and decoding. Use the matrix A to encode the phrase "GO…