Re: PuTTY to OpenSSH, slow auth

Jeff B <jbeardNo-Spam1185@xxxxxxxxxxxx> writes:
>it will also try both protocols(1,2) and the RSA/DSA and host
>authentications, so config the target host to use specifically that
>technique you used to create your pass-phrase and it will carve of some
>more time.

I very much doubt any of those things will make any noticeable
difference, since in all those cases, a single algorithm is chosen and
the CPU-intensive cryptography (etc) is only performed for the chosen
algorithm. The time taken to make the decision should be negligible, so
eliminating the choice of algorithms should make no difference.
.

Relevant Pages

  • Re: PuTTY to OpenSSH, slow auth
    ... so config the target host to use specifically that technique you used to create your pass-phrase and it will carve of some more time. ... difference, since in all those cases, a single algorithm is chosen and ...
    (comp.security.ssh)
  • Re: A very fast Fermat factoring algorithm
    ... > Another is a very old technique that uses exclusion moduli to ... I'd rather not share the technique just yet. ... I have heard of several Fermat speedups, but none that are nearly this ... nothing like Fermat's algorithm, but it has the same runtime ...
    (sci.crypt)
  • Re: Large-numbers division way too slow -- what to do?
    ... > This is barrett reduction ... This is close to the technique in Paul Barett's Crypto '86 ... easier to implement than Knuth's algorithm D. ... implementation of RSA escapes me. ...
    (sci.crypt)
  • Re: Write a Fortran program to solve Sudoku puzzles :-)
    ... What technique (e.g. Tabu, simulated annealing, ... > what decision rules do you use to get the algorithm to give up looking ... to brute force if the logic rules prove insufficient. ...
    (comp.lang.fortran)
  • Fingerprint Recognition System Release 4.0
    ... improved algorithm based on a hybrid ... technique is used to core point positioning. ...
    (sci.image.processing)