Problematic Relationship of Pt, Ct, and MAC
- From: WTShaw <lurens1@xxxxxxxxx>
- Date: Thu, 21 Aug 2008 22:09:24 -0700 (PDT)
In one quality problematic encryption example given a chosen key, the
Ct is slightly longer than the Pt. If the Ct is decoded, the Pt
results but if the Pt is treated the same way, decode routine, a hash
slightly shorter than the Pt results. So, if Ct is sent with the hash
of the Pt as a MAC, the proper receiver can show with some relative
comfort that when the Pt he recovers and subsequent double decoding
yields a hash that is the same MAC as received, all is well.
The algorithm used meets neither classical block nor stream cipher
criteria but is in an distinct new class.
.
- Follow-Ups:
- Re: Problematic Relationship of Pt, Ct, and MAC
- From: Kristian Gjøsteen
- Re: Problematic Relationship of Pt, Ct, and MAC
- Prev by Date: Re: When is Tom gonna update his website and LibTomCrypt?
- Next by Date: Re: Problematic Relationship of Pt, Ct, and MAC
- Previous by thread: Why HMAC better than hash?
- Next by thread: Re: Problematic Relationship of Pt, Ct, and MAC
- Index(es):
Relevant Pages
|