Posts: 1
Joined: Feb 2010
hai
i wish to implement Brute force attacks on RC4 chipers.
please forward verilog,VHDL codes to me
thank you
Posts: 2,268
Joined: Sep 2010
[attachment=5365]
Brute-Force approach
1. Define Brute-Force approach.
Brute force is a straightforward approach of solving the problem. It is directly based onthe problem statement and definitions of concepts that are directly involved in the problem. Inshort, the method has “Just do it” approach.
2. Write any four examples for Brute force approach.
a. Computing an
b. Computing n!
c. Performing multiplication of two matrices
d. Searching a key value from given list of element
3. Write the various features of Brute force approach.
a. This strategy is applicable to wide variety of problems
b. Brute force is applied for solving problems with no restriction on input size
c. Brute force is used for solving problems with small class of input.
d. Even though the brute force is an inefficient method it is useful for solving small sizeinstances of a problem.
4. Write the procedure for Selection sort.
ALGORITHM SelectionSort(A[0..n-1] )
for i 0 to n-2 do
mini
for j i+1 to n-1 do
if A[j] < A[min] min j
swap A[i] and A[min
5. Write the procedure for Bubble sort.
ALGORITHM BubbleSort(A[0..n-1] )
for i 0 to n-2 do
for j 0 to n-2-i do
if A[ j +1] < A[ j ]
swap A[j] and A[ j +1]
6. Differentiate Selection sort and Bubble sort.
In Selection sort, scan the entire array to find its smallest element and swap it with the firstelement. Then swap the scan the array and swap the smallest element with the second element and soon.In Bubble sort, First the largest element is moved at highest index in the array. Then the second
largest element bubbles up, then the third element and so on
7. State the time complexity of Selection sort algorithm.
In Selection sort, the number of times the basic operation is executed depends only on the array’s size and is given by the following sum:
C(n) = Thus The time complexity is È( n2 )
8. State the time complexity of bubble sort algorithm.
In Bubble sort, the number of times the basic operation is executed depends only on the array’s size and is given by the following sum:
C(n) = Thus The time complexity is È( n2 )
9. Is bubble sort stable?
Bubble sort is a stable sorting algorithm because two items of equal keys are never swapped and initial relative ordering of items of equal keys is preserved.