1. 22 Feb, 2018 1 commit
  2. 11 Feb, 2018 4 commits
  3. 24 Jan, 2018 2 commits
  4. 20 Jan, 2018 2 commits
  5. 18 Jan, 2018 2 commits
  6. 17 Jan, 2018 1 commit
    • Milan Broz's avatar
      Introduce new 64bit *keyfile_device_offset functions. · f34ce81f
      Milan Broz authored
      The keyfile interface was designed, well, for keyfiles.
      
      Unfortunately, a keyfile can be placed on a device and the size_t offset
      can overflow.
      
      We have to introduce new set of fucntions that allows 64bit offsets even on 32bit systems:
       - crypt_resume_by_keyfile_device_offset
       - crypt_keyslot_add_by_keyfile_device_offset
       - crypt_activate_by_keyfile_device_offset
       - crypt_keyfile_device_read
      
      The new functions have added _device_ in name.
      
      Old functions are just internall wrappers around these.
      
      Also cryptsetup --keyfile-offset and --new-keyfile-offset must now
      process 64bit offsets.
      
      For more info see issue 359.
      f34ce81f
  7. 17 Dec, 2017 1 commit
  8. 08 Nov, 2017 1 commit
  9. 30 Oct, 2017 2 commits
  10. 29 Oct, 2017 1 commit
  11. 28 Oct, 2017 2 commits
  12. 25 Oct, 2017 1 commit
  13. 17 Oct, 2017 2 commits
  14. 12 Oct, 2017 1 commit
    • Milan Broz's avatar
      Use non-recursive automake. · d77bbe93
      Milan Broz authored
      This change also causes that now binaries and libraries are placed in
      build root directory.
      
      Now we can use subdir-objects for automake.
      d77bbe93
  15. 10 Oct, 2017 1 commit
  16. 04 Oct, 2017 1 commit
  17. 27 Sep, 2017 1 commit
  18. 24 Sep, 2017 3 commits
  19. 23 Sep, 2017 1 commit
  20. 22 Aug, 2017 2 commits
  21. 15 Aug, 2017 1 commit
  22. 12 Aug, 2017 2 commits
    • Milan Broz's avatar
    • Milan Broz's avatar
      Move PBKDF internal benchmark to one place. · 5fc79f56
      Milan Broz authored
      Also cache its value in active context, so we run benchmark
      only once.
      
      The patch also changes calculated value for LUKS1 key digest
      to 125 miliseconds (it means that for full 8 used slots
      the additional slow-down is circa 1 second).
      
      Note that there is no need to have too high iteration count
      for key digest; if it is too computationally expensive, attacker
      will better decrypt of one sector with candidate key anyway.
      (Check for a known signature.)
      
      The reason to have some delay for key digest check was
      to complicate brute-force search for volume key with LUKS header
      only (and if RNG used to generate volumekey was flawed
      allowing such a search i reasonable time).
      5fc79f56
  23. 10 Aug, 2017 2 commits
  24. 07 Aug, 2017 1 commit
  25. 06 Aug, 2017 2 commits
    • Milan Broz's avatar
      Use only crypt_get_integrity_info in API. · 3435f9cb
      Milan Broz authored
      Some other functions remain internal only.
      Signed-off-by: Milan Broz's avatarMilan Broz <gmazyland@gmail.com>
      3435f9cb
    • Milan Broz's avatar
      Add Argon2 benchmark code. · 8a859391
      Milan Broz authored
      Code based on patch by Ondrej Mosnacek
      
      The new benchmark works as follows:
      
      Phase 1:
      It searches for smallest parameters, such that the duration is 250 ms
      (this part is quite fast).
      Then it uses that data point to estimate the paramters that will have
      the desired duration (and fulfill the basic constraints).
      
      Phase 2:
      The candidate parameters are then measured and if their duration falls
      within +-5% of the target duration, they are accepted.
      Otherwise, new candidate parameters are estimated based on the last
      measurement and phase 2 is repeated.
      
      When measuring the duration for given parameters, the measurement
      is repeated 3 or 4 times and a minimum of the measured durations
      is used as the final duration (to reduce variance in measurements).
      A minimum is taken instead of mean, because the measurements definitely
      have a certain lower bound, but no upper bound (therefore mean value
      would tend to be higher than the value with highest probability density).
      The actual "most likely" duration is going to be somewhere just above
      the minimum measurable value, so minimum over the observations is
      a better estimate than mean.
      Signed-off-by: Milan Broz's avatarMilan Broz <gmazyland@gmail.com>
      8a859391