RE: password cracking: one char at a time.

From: Aditya Deshmukh (aditya.deshmukh_at_online.gateway.strangled.net)
Date: 11/24/05

  • Next message: Lalit Gupta: "RE: Selectively disabling USB devices" 
    To: "'michael young'" <mhyoung@valdosta.edu>, "'Gilbert Fernandes'" <gilbert.fernandes@spamcop.net>
Date: Thu, 24 Nov 2005 09:14:06 +0530

     see below .

    > >> I was wondering if is at all possible to discover a password one
    > >>char at a time.

    <niped>

    > >If the hash is of good cryptographic level, if someone steals
    > >the hashes he won't get an easily time finding collisions.
    > >
    > >And to avoid two users to have the same hash if they use
    > >the same password, salt bits are used (that's what Unix does).
    > >
    > >
    >
    > What are salt bits?

    Salty ! Here they are random numbers to padded and encrypted with
    actual password to make brute forcing difficult

    ________________________________________________________________________
    Delivered using the Free Personal Edition of Mailtraq (www.mailtraq.com)

  • Next message: Lalit Gupta: "RE: Selectively disabling USB devices"

    Relevant Pages

    • Re: Magic Compression? (Why wont this work) (Code provided)
      ... Every time we iterate, compare the MD5 (or ... or whatever hash you prefer) to the hash of the original file. ... Continue to iterate until you have created every possible file given ... This should be a rough time format to avoid wasting bits.. ...
      (comp.compression)
    • Re: Run-time error 3134
      ... I am not sure as I avoid all the hash signs and special symbols in ... try enclose all Field names in square brackets like: ...
      (microsoft.public.access.modulesdaovba)
    • Re: OT: Larry Craig was Re: Scott in SoCal
      ... Hash: SHA1 ... On Thu, 30 Aug 2007, Rich Piehl wrote: ... know to avoid them. ...
      (misc.transport.road)
    • Re: Dynamically generate a symbol name
      ... I would avoid doing this though. ... infinite variations. ... Hash table performance shouldn't be affected by size, ... The memory footprint will grow as you add symbols and ...
      (comp.lang.ruby)
    • Re: Theoretical Problem
      ... Hash tables work fine for finding duplicates. ... as long as one is careful to avoid an inordinate number ...
      (comp.lang.c)