Best means best for some specific objective.
Optimal means the same thing as best.
Depends on what you want to do.
There are countless examples of problems for which
different algorithms scale differently by problem
size,
e.g. for N=10, Algorithm A is the fastest solution,
but for
hi,
In the case of algorithms is the best algorithm always
the best solution to the problem,be the algorithm with
a constant run time or randomised algorithm.
i.e is the best solution always the optimal solution
for a problem.
how can we argue -either way?
Thank U.
Regards Data.
hi,
I have problem understanding time complexity for the
following problem
I need to check if two strings are equal
let string one
s1=aaabbb
and string two
s2=aaabbb
We place it on a single tape turing machine
aaabbb aaabbb
the book says it takes roughly 2n steps to match
corresponding
hi,
thank you Mr. Jim,one more query, regarding Godel's
incompleteness theorom.
with reference to
http://www.miskatonic.org/godel.html
Gödel asks for the program and the circuit design of
the UTM. The program may be complicated, but it can
only be finitely long. Call the program P(UTM) for
hi,
Here is an example illustrating turing thesis
{ Suppose we make a conjecture that a turing machine
is equal to the power of a typical digital
computer?how can we defend or refute sucha hypotheis?
to defend it we could take an increasingly more
difficult and show that they are solvable
Data.
--- Optimizzin Al-gorithym [EMAIL PROTECTED] wrote:
At 05:45 AM 7/14/02 -0700, gfgs pedo wrote:
it is said that atmospheric noise is random but how
can we say for sure.
Physics, chaos, the growth of initial uncertainty as
systems evolve,
energy/time required to make measurements
hi,
I get the idea,thanx.
Regards Data.
can u pls explain how they have statistical
signatures,pls-
may be using SPN's, i have tried ANSI X9.17 key
generation with GOST-it did have a negligably small
skew-it makes me wonder what statistical signature
they have.The negligable skew is
wrote:
On Sat, 13 Jul 2002, gfgs pedo wrote:
can u pls explain how they have statistical
signatures,pls-
may be using SPN's, i have tried ANSI X9.17 key
generation with GOST-it did have a negligably
small
skew-it makes me wonder what statistical
signature
hi,
thanx Mr Jim.
Data.
__
Do You Yahoo!?
Yahoo! Autos - Get free new car price quotes
http://autos.yahoo.com
i meant cryptanalyst-hope i spelled that rite :-)
Data.
__
Do You Yahoo!?
Sign up for SBC Yahoo! Dial - First Month Free
http://sbc.yahoo.com
hi,
suppose a cryptanalysis only has encrypted data-how is
going 2 know which is the encrytion algorithm used 2
encrypt the data ,so that he can effeciently
cryptanalyse if
1:he has large amount of cipher text only
2:has large amount of plain text and corresponding
cipher text.
There r so
will give some clarity.
now he can send Bob the original message of Alice.
So I think the above suggested protocol will not work.
Mallory can still get away with his scheme
Regards Data.
--- Marcel Popescu [EMAIL PROTECTED] wrote:
From: gfgs pedo [EMAIL PROTECTED]
One solution suggested
hi,
Thanx Mark, I was also wondering on the line of hash
functions too,me 2 dont see how it works securely.
Nor does the interlock protocol look secure to me.
Regards Data.
--- Marcel Popescu [EMAIL PROTECTED] wrote:
From: gfgs pedo [EMAIL PROTECTED]
One solution suggested against
hi,
If there is no previous shared secret,then ur
communication on an insecure network is susecptable to
the man in the middle attack.
One solution suggested against the man in the middle
attack is using the interlock protocol
InterLock Protocol
Is used to foil a man in the middle
hi,
Book says, a construction that involved computing
LSFR's over a field of 'odd charecteristics'
is insecure.
Does that mean a register with odd number of bits is
insecure which would mean a tap sequence which
uses an odd degree polynomial is insecure?
Regards Data.
hi,
I was helping a friend if mine with rsa key
generation.if it helps u here it is.
I am posting the mail which i sent to him.
1:Choose 2 large prime numbers p q
2:choose n=p*q z=(p-1)*(q-1)
3:choose a number relatively prime to z anc call it
d.
two numbers (a,b) are said to be
hi,
I have an idea of what x9.17 standards says
but no idea behind the mathametcial background of it.
x9.17 standards is a standard but why is it
so.mathametically what makes it a secure key
generator?
Could some 1 pls address the issue.
Thank u very much.
Data.
hi,
Does any 1 have a reference to the actual Mersenne
Twister algorithm?
Thank u.
Regards Data.
__
Do You Yahoo!?
LAUNCH - Your Yahoo! Music Experience
http://launch.yahoo.com
hi,
Its regarding maximum period LSFR's (Linear feed back
shift registers) used for generating
pseudo random numbers.
A tap sequence for an LFSR is the xor of certain bits
in the register.
For eg: I choose a primitive polynomail mod 2
x^32+x^7+x^5+x^3+x^2+x+1 is a primitive polynomial mod
hi,
With reference to the following url
http://www.ietf.org/rfc/rfc1750.txt
As in idea 1 what about choosing 2 independent bit
file streams.
Then as in RFC 1750 6.1.1 A Trivial Mixing Function
(page 14),
make a 3rd bit file stream such that We xor
For i=0 to n
bit(i)file3=bit(i)file1
hi,
Using Transition Mappings to De-Skew
Randomness Recommendations for Security
RFC 1750
An extract from it.
Another technique, originally due to von Neumann
[VON NEUMANN], is to
examine a bit stream as a sequence of
non-overlapping pair
| pair |
hi,
Here is a query frm my friend-
I wondered if anyone knows a solution for my
problem...
x mod m = a
x mod n = b
Let's say i choose small number...
m=5
n=3
a=3
b=1
then it's
x mod 5 = 3
x mod 3 = 1
after trying a but you will now that x=13
hi,
Here are two ideas which came up in my mind.
Since I have done a few diagrams for illustration and
thought that it will not be a good idea as
attachment,I have put the ideas at the following url
http://www.ircsuper.net/~neo/
I sincerely appreciate ur comments.Thank u for ur
time.
Regards
23 matches
Mail list logo
