Comments by Ratika Agarwal (Top 31 by date)

Now do you have any optimistic comments on my problem??

I have already searched it on internet. But there is an issue. The formula given in 2-3 sources is that- the firth one is right...i.e.,
Exp have to be done after taking mod of addition.
Exp[ (Log A + Log B) Mod 255].

But Result of addition is so small that it doesn't need Mod, instead, result of Exponent is much long upto 2-4 bytes, which needs Mod.

What should be done in this case??

I have come here to ask for help and discuss on its issues to the concerned peoples and experts, that I do not find in other sources. I request you that if you know the solution then please post here. If you do not know the solution then please do not down vote the question and let others help me.

try what?? Try to run? Above is a formula.

I have 2 Objects of a Class, which are accessing the same set of 4 Methods randomly, which are using the same global variable arrays of that class..
I just want to check whether values of those arrays are affected by those Method Calls or not...!!

Thanks.But the code I have given here is just an example for the logic that I want. I want to do this operation to check my result. Because I have no other way to check that part of code.

I need this particular operation for "Mix rows /columns operation of AES/Whirlpool algorithms" of cryptography.

Thanks for help. But I have already searched a lot before coming to code project. I too came across this PDF, but it's not helpful.

Yes. It is the multiplication over a Galois finite Field, but not over vandermonde.

What is your ques?? tell me.

A simple matrix mult.is not same as in Galois Field(2 power n). That is what I am asking here for, how to do it..

Quote me... "You are here to ask for help or to help somebody. Not to make fun of what you don't know about."

I think you should do a bit homework on the questions posted in forums. B'coz you may be the only one who is not able to understand some term of it. If you know the ans.then post it. Else, let others help the needy ones.

I know matrix operations very well. But my problem is to multiply in GALOIS FIELD(2 power n).

I don't need a language specific answer. I just want its logic and idea. It is a part of advance Mathematics, that's why I have tagged is as mathematics too.

thanks for the idea of 0x.

please do help somebody..

yes I had..but it contains only setups of SHA1, not for Whirlpool.

i have already tried from first one. but it is not worth.

anybody please answer

thanks

Now check the following code.
There is change only in parallel version loop. But then also the time concept is opposite.



int[,] a = { { 3, 1, 2 }, { 5, 4, 6 }, { 2, 5, 4 }, { 5, 9, 1 } };
var sw = Stopwatch.StartNew();
int[] t = new int[4];

/**********************Parallel code START of Finding largest in 2-d MATRIX***********
Parallel.For(0, 4, (int i) =>
{
t[i] = a[i, 0];
for (int j = 1; j < 3; j++)
{
if (t[i] < a[i,j])
{
t[i] = a[i,j];
}
}
Console.WriteLine("Largest no.t["+i+"] is = " + t[i]);
}
);
int x = t[0];
for (int j = 1; j < t.Length; j++)
{
if (x < t[j])
{
x = t[j];
}
}
Console.WriteLine("Largest no. = " + x);
********************END of Finding largest in 2-d MATRIX*******************/

/***************Sequentially Finding largest in 2-d MATRIX***/
int i;
for (i = 0; i < 4; i++)
{
t[i] = a[i, 0];
for (int j = 1; j < 3; j++)
{
if (t[i] < a[i, j])
{
t[i] = a[i, j];
}
}
Console.WriteLine("Largest no.t["+i+"] is = " + t[i]);
}
int x = t[0];
for (int j = 1; j < t.Length; j++)
{
if (x < t[j])
{
x = t[j];
}
}
Console.WriteLine("Largest element = " + x);


TimeSpan s = sw.Elapsed; // For calculation
Console.WriteLine("total time = " + s); // of timespan


Console.ReadLine();

ok. thanks.

yess

Don't take it wrong, but......
When answering a question please:
Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Let's work to help developers, not make them feel stupid.

yess..I too want to do on my own.
I have decided to parallelize an existing sequential algo which is not yet parallelized by anybody.
For eg., Advanced Encryption Standard Algorithm has already been parallelized.
Similarly I am just asking for any such algo. I'm not asking about how to implement the total project.
If you have any idea, then you can share it here.