What could prevent ping or traceroute responses from reaching the originating device beside network connectivity issues?
1 answer:
You might be interested in
Following are the python program to the given question:
from collections import defaultdict #import package
import heapq as h#import package
def primsMST(gr, st_v): # defining a method primsMST that takes two values in parameters
primalMST = defaultdict(set)#defining primalMST as a variable that calls defaultdict method
v = set([st_v])# defining a variable v that calls the set method and hold its value
e_list = [(c, st_v, to)for to, c in gr[st_v].items()]#defining variable e_list that use loop to hold value in list
h.heapify(e_list)# use package that holds heapify and holds its value
while e_list:#defining while loop that checks e_list
c, s, e = h.heappop(e_list)#holding heapop method value in c,s,and e variable
if e not in v:#defining if block checks e value is not in v
v.add(e)# use add method to add value in v
primalMST[s].add(e)#use primalMST as list that adds value in mwthod
for nxt, c in gr[e].items():#defining for loop that uses nxt, and c variable that checks value in list
if nxt not in v:#defining nxt variable that checks value is not in v
h.heappush(e_list, (c, e, nxt))#add value into the heappush method
return primalMST#return method value
connects=[['A','B',1],['B','C',4],['B','D',6],['D','E',5],['C','E',1]]#defining a list connects
my_gr=dict()#defining a variable my_gr that holds method dict() value
for el in connects:#defining a for loop that uses el to count connects list value
my_gr[el[0]]=dict()#use my_gr as list hold value in dict method
my_gr[el[1]]=dict()#use my_gr as list hold value in dict method
for el in connects:#defining another for loop that uses el to count connects list
my_gr[el[0]].update({el[1]:el[2]}) # use update method that update value in my_gr
my_gr[el[1]].update({el[0]:el[2]})# use update method that update value in my_gr
x=dict(primsMST(my_gr, list(my_gr.keys())[0]))#defining x variable that calls dict method and hold its value
a=[]#defining an empty list
for k in x:#defining a for loop that uses k to hold dict method value
for no in x[k]:#defining a loop that checks list value
a.append([k,no,my_gr[k][no]])#use a that add value in list
print(a)#print list value.
Output:
Please find the attached file.
Program Explanation:
- Import package.
- defining a method primsMST that takes "gr and st_v" as parameters.
- Inside the method, a primalMST as a variable is declared that calls "defaultdict" method.
- Use the v variable that calls the set method and hold its value.
- Defining "e_list" that uses the loop to hold value in lists, and define the heapify and holds its value.
- In the next step, it defines a while loop checks e_list, and defines variable and hold value into the method and use another if to check value and return its value.
- A list "connects" is declared that holds a value and defines a "my_gr" that holds "dict" method value and uses multiple for loop to print the calculated list value.
Learn more:
dictionary: brainly.in/question/14673591
List: brainly.in/question/25140412
Answer:
a. Feistel Cipher is basically a design model used in many block encryption algorithms one of them is DES. The Feistel structure has many rounds of substitution followed by permutation. In each round the plaintext is processed.
A Feistel Cipher comprise of;
1. Divide plaintext block into two parts
2. Perform multiple rounds of
a. Substitution on left half
b. Permutation by swapping halves
See attachment for the diagram of a feistel cipher.
B.
The concept of confusion and diffusion were identified by Claude Shannon in his paper Communication Theory of Secrecy Systems, published in 1949.
According to Shannon's definitions,
-Confusion means, making the relationship between the ciphertext and the key as complex and involved as possible.
It basically hides the relationship between the cipher text and the key. This property makes it difficult to find the key even tough there are many plaintext cipher text pairs created using the same key.
Diffusion is property that the non-uniformity which is much harder to detect. The distribution of the individual and pairs of neighbouring letters in the plaintext should be redistributed into the non-uniformity in the distribution of much larger structures of the ciphertext. The concept behind diffusion is to hide the relationship between the plaintext and the ciphertext. A cipher with good diffusion, should make sure that even if one bit in plaintext changes, then the ciphertext should change completely, in a manner such that its unpredictable.
Both Confusion and diffusion prevents the deduction of encryption key difficult. As a result this protects the original message or plaintext. Confusion and diffusion can be achieved using substitution and permutation.
Encryption methods use the principles of confusion and diffusion.
Confusion does the work of changing the data drastically from input to output by many ways like translate the data using a non-linear table created from the key.
Diffusion is used in encryption to make every bit of input affect every bit of the output which in tun makes the analysis difficult.
