XTR algorithm for MIKEY

1
XTR algorithm for MIKEY

• draft-liang-msec-mikey-xtr-00.txt
• Jing Liang
• Hui Deng
• Shouwen Lai

2
Problem and Goal

• RFC3830 uses Diffie-Hellman to establish group
  secure key
• Performance is not good enough in application of
  mobile computing devices such as PDA.
• Our draft is targeted to this problem and we
  proposed the method of applying XTR for MIKEY.

3
Performance
XTR Efficient and Compact Subgroup Trace
Representation
XTR ECC RSA
Operation Speed Fastest 23ms Fast 28ms Slow 5ms for 32-bit
Key Length Short 170-bit Short 170-bit Long 1020-bit
Key selection Simplest Hard Simple
Pentium III 450 MHz and 96 MB of Ram
4
XTR-DH message Exchange

• INITIATOR RESPONDER
• I_MESSAGE
• HDR, T, RAND, IDiCERTi,
• IDr, SP, XTR-DHi, SIGNi
• ----gt
• R_MESSAGE
• lt---- HDR, T, IDrCERTr, IDi, XTR-DHr,
  SIGNr

1.Trace(ga)
3.Both parties computes key Trace(gab)
2.Trace(gb)
5
Work Item?

• Efficient Multicast Group Key Generation for the
  smart and resource-constrained device should be a
  problem ?