The exit gas from an alcohol fermenter consists of an

Need more help!

The exit gas from an alcohol fermenter consists of an air-C02 mixture containing 10 mol% C02 that is to be absorbed in a 5.0-N solution of triethanolamine, containing 0.04 mol of carbon dioxide per mole of amine solution. If the column operates isothermally at 25oC, if the exit liquid contains 78.4% of the C02 in the feed gas to the absorber, and if absorption is carried out in a six-theoretical-plate column, calculate:
(a) Moles of amine solution required per mole of feed gas.
(b) Exit gas composition.

Equilibrium Data 0.032 0.05 0.12 0.008 0.023 0.003 0.043 0.015 0.04 0.06 0.02 0.03 0.083 0.01 0.055 0.07 0.068 0.099 0.1

Equilibrium Data 0.032 0.05 0.12 0.008 0.023 0.003 0.043 0.015 0.04 0.06 0.02 0.03 0.083 0.01 0.055 0.07 0.068 0.099 0.1

Y = moles C02/mole air; X = moles C02/mole aminesolution

Johnny, an Ontario Tech graduate recently got a job at CSE in

Johnny, an Ontario Tech graduate recently got a job at CSE in Ottawa. As part of a pilot project, every month CSE announces a list of 3 prime numbers (all less than 2°) in proxy repositories which automatically sign the 3 numbers for Navy bases across the Country to fetch them. These numbers become part of public keys so confidentiality is not required, only signature. In his very first day at work, Johnny volunteers to take charge of the automatic signature generation in the Bay of Fundy proxy (as, according to Johnny, it was close enough to his native St. John\'s). He decided to sign the 3 numbers using a hash value consisting of the bitwise XOR amongst the bit representation of these 3 numbers and then encrypting the hash value using CSE\'s private RSA key. Further, he made sure his automatic process only signed the numbers if all of the 3 numbers were prime (i.e., if at least one of the 3 numbers were composite the process would refuse to sign). Last month\'s numbers were {251, 157, 191}. Johnny\'s program computed the hash to be 217 (because 251 XOR 157 XOR 191 = 217) which then was encrypted with RSA and appended to the set of numbers as signature. Shortly after, CSE suspected a probable compromise of the Bay of Fundy proxy since the Nova Scotia Navy Base ended up using composite numbers in their crypto operations causing serious disruptions in the pilot project! During his debrief, Johnny claimed that to forge the signature with probability ½, 28 = 2\' = 128 sets of 3 random 2 an attacker would need to compute the hash values of composite numbers, not to mention that the attacker would require to break RSA. But his boss, an experienced cryptographer advises that Johnny\'s claims were overly optimistic, saying that the attacker could forge a signature with probability greater than ½ by computing the hashes of only 22 = 2* = 16 (not 128) sets of 3 random composite numbers, and that the attacker wouldn\'t even have to break RSA at all. Johnny was speechless! In her explanation, Johnny\'s boss alluded to the birthday paradox, a concept that for some reason Johnny never quite grasped while taking Crypto at Ontario Tech. Help Johnny understand the birthday paradox, after the fact, by following these steps in a Python program: (a) Compute the hashes of 2\' = 16 sets of 3 random prime numbers less than 28. (b) Then keep selecting sets of 3 fraudulent composite numbers less than 28 until you find a set {C1, C2, c3} with a hash value that matches one of the hashes computed in step (a); we will refer to that matching set as {p1, p2, p3}. (c) Explain to Johnny that the attacker would replace the legitimate prime set {251, 157, 191} with the fraudulent composite set {C1, c2, c3} in the Bay of Fundy proxy server. The attacker would then use Johnny\'s automatic signing process to sign the prime set {P1, P2, P3} and append such signature to the composite set {C1, C2, C3}. At this point the attacker has been successful at signing the composite set {c1, C2, C3} without knowing CSE\'s RSA private key and by computing just over 16 hashes (i.e., 16 from Part (a) + some from Part (b). (d) Submit your Python code and a screenshot like the one depicted in the figure below. (Notes: Of course, Johnny wasn\'t so naïve as to suggest such a simple scheme for signing; in reality he was using SHA- 256 but here we are simplifying things just to get the concept across (see Question 4). Also, CSE uses prime numbers in the order of 20, not 2. As per Johnny\'s future at CSE, don\'t worry; his boss decided to give him a second chance. Johnny was spotted last evening close to the ByWard Market enjoying a beaver tail with his partner.) CAWindows\\system32\\cmd.exe 16 valid messages: ( 157 7 11 || 145 67 29 89}|| { 149 { 227 17 { 47 223 ( 149 103 167 } || 85 [ 229 197 41 { 71 251 179} || 15 { 53 59 19 } | 29 { 149 227 151 } || 225 { 103 167 29 } || 221 79 113 2231 | 225 7 211 83 1 || 135 13 { 19 211 looking for a fraudulent message that matches a valid message\'s hash... collision found af ter 3 attempts: { 103 167 { 74 135 16 } || 221 Press any key to continue 7 13 97 } ? 249 83 } | 161 73 } ?| 185 73 } || 105 53 53 ) || 41 79 ) ii 65 89 ) || 153 29 } || 221

Members

Access to 2 Million+ Textbook solutions
Ask any question from 24/7 available
Tutors

$9.99

VIEW SOLUTION

Already member? Sign In

OR

Non-Members

Get help from Chemical Engineering Tutors

Ask questions directly from Qualified Online Chemical Engineering Tutors .

Best for online homework assistance.