rrent ssh implementation which does not have a fix for
this; it should no longer be possible to tell what's a password and what
isn't. See the references.
--
Kyle R. Hofmann <[EMAIL PROTECTED]>
s are supposed to be protected.
While the prospect of reducing latency is nice, I don't think the potential
vulnerabilities make this a good idea.
--
Kyle R. Hofmann <[EMAIL PROTECTED]>
t.
I will also direct them to the pf archives, so they can read your words for
themselves.
I would like to say I am sorry that my only contact with Emerging
Technologies, Inc. has been so disappointing.
Yours Sincerely,
Kyle R. Hofmann
that O ignores is much smaller.
This is really a shortcoming of O notation; it's easier to understand a
comparison like this when you try to work out rough running times using each
bound.
--
Kyle R. Hofmann <[EMAIL PROTECTED]>
| |_< / ( ) ( ( ) ) (( ) )).) ((/ | ( | \( )) ((. ).
<_\\__\__(___)_))_((_())__(_(___.oooO_Oooo.(_(_)_)((_
HAND, HTH.
(ASCII art courtesy of someone else)
(And, more seriously, I suggest that you read the source. Then it should be
clear why pf works as it does.)
--
Kyle R. Hofmann <[EMAIL PROTECTED]>
is not matched. scp and sftp don't set tos early,
either.
It seems to me that ssh is not doing the right thing here; it should determine
the type of service that it will use and set it before it sends the first
SYN.
--
Kyle R. Hofmann <[EMAIL PROTECTED]>
in
what you send" rule implies that you should accept fragments with DF set, but
the potential for a host system to misinterpret such datagrams makes me
unwilling to agree.
--
Kyle R. Hofmann <[EMAIL PROTECTED]>
l children, but that should still be O(n).
You lose skip steps with such a case, though, so performance would be worse
than it is now. But it feels to me like it should be possible to avoid such a
pathological case with good tree construction.
--
Kyle R. Hofmann <[EMAIL PROTECTED]>
