SHA-based encryption function in Python
Gregory G Rose
ggr at qualcomm.com
Wed Apr 24 12:50:59 EDT 2002
More information about the Python-list mailing list
Wed Apr 24 12:50:59 EDT 2002
- Previous message (by thread): SHA-based encryption function in Python
- Next message (by thread): SHA-based encryption function in Python
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
In article <7xu1q1mdwd.fsf at ruckus.brouhaha.com>, Paul Rubin <phr-n2002a at nightsong.com> wrote: >I should re-read Krawczyk's HMAC paper to see what that fancy padding >is really supposed to do. Remember that the underlying encryption >here (SHA-OFB) probably isn't the greatest in the world either. The proof of security of NMAC (that HMAC is based on) requires that the inner and outer hash functions be independent. For HMAC, this is approximated by using the padding so that the keys are effectively different, making the hash operations effectively independent (wave hands here). >And it actually might be faster to use two separate hash-based auth >keys than deal with the fancy HMAC padding, if a simple double hash >has some vulnerabilities. Two different keys would certainly satisfy the conditions. Greg. -- Greg Rose INTERNET: ggr at qualcomm.com Qualcomm Australia VOICE: +61-2-9817 4188 FAX: +61-2-9817 5199 Level 3, 230 Victoria Road, http://people.qualcomm.com/ggr/ Gladesville NSW 2111 232B EC8F 44C6 C853 D68F E107 E6BF CD2F 1081 A37C
- Previous message (by thread): SHA-based encryption function in Python
- Next message (by thread): SHA-based encryption function in Python
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Python-list mailing list