[Hipsec] Orchid generation algorithm - where should it be specified?
Tobias Heer <heer@cs.rwth-aachen.de> Tue, 02 March 2010 15:28 UTC
Return-Path: <heer@informatik.rwth-aachen.de>
X-Original-To: hipsec@core3.amsl.com
Delivered-To: hipsec@core3.amsl.com
Received: from localhost (localhost [127.0.0.1]) by core3.amsl.com (Postfix) with ESMTP id C5FC93A8B4E for <hipsec@core3.amsl.com>; Tue, 2 Mar 2010 07:28:23 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -4.801
X-Spam-Level:
X-Spam-Status: No, score=-4.801 tagged_above=-999 required=5 tests=[BAYES_00=-2.599, HELO_EQ_DE=0.35, HELO_MISMATCH_DE=1.448, RCVD_IN_DNSWL_MED=-4]
Received: from mail.ietf.org ([64.170.98.32]) by localhost (core3.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id B9QDTcWUaYKZ for <hipsec@core3.amsl.com>; Tue, 2 Mar 2010 07:28:22 -0800 (PST)
Received: from mta-2.ms.rz.rwth-aachen.de (mta-2.ms.rz.RWTH-Aachen.DE [134.130.7.73]) by core3.amsl.com (Postfix) with ESMTP id 782733A8B36 for <hipsec@ietf.org>; Tue, 2 Mar 2010 07:28:22 -0800 (PST)
MIME-version: 1.0
Content-transfer-encoding: 7bit
Content-type: text/plain; charset="us-ascii"
Received: from ironport-out-2.rz.rwth-aachen.de ([134.130.5.41]) by mta-2.ms.rz.RWTH-Aachen.de (Sun Java(tm) System Messaging Server 6.3-7.04 (built Sep 26 2008)) with ESMTP id <0KYN00938UZAVHC0@mta-2.ms.rz.RWTH-Aachen.de> for hipsec@ietf.org; Tue, 02 Mar 2010 16:28:22 +0100 (CET)
X-IronPort-AV: E=Sophos;i="4.49,567,1262559600"; d="scan'208";a="25327748"
Received: from relay-auth-1.ms.rz.rwth-aachen.de (HELO relay-auth-1) ([134.130.7.78]) by ironport-in-2.rz.rwth-aachen.de with ESMTP; Tue, 02 Mar 2010 16:28:22 +0100
Received: from umic-137-226-154-185.nn.rwth-aachen.de ([unknown] [137.226.154.185]) by relay-auth-1.ms.rz.rwth-aachen.de (Sun Java(tm) System Messaging Server 7.0-3.01 64bit (built Dec 9 2008)) with ESMTPA id <0KYN00KKAUZA7Q70@relay-auth-1.ms.rz.rwth-aachen.de> for hipsec@ietf.org; Tue, 02 Mar 2010 16:28:22 +0100 (CET)
From: Tobias Heer <heer@cs.rwth-aachen.de>
Date: Tue, 02 Mar 2010 16:28:26 +0100
Message-id: <A06A3401-7765-45C4-A53B-208993B7071C@cs.rwth-aachen.de>
To: Julien Laganier <julienl@qualcomm.com>, Thomas R Henderson <thomas.r.henderson@boeing.com>
X-Mailer: Apple Mail (2.1077)
Cc: "hipsec@ietf.org WG" <hipsec@ietf.org>
Subject: [Hipsec] Orchid generation algorithm - where should it be specified?
X-BeenThere: hipsec@ietf.org
X-Mailman-Version: 2.1.9
Precedence: list
List-Id: "This is the official IETF Mailing List for the HIP Working Group." <hipsec.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/listinfo/hipsec>, <mailto:hipsec-request@ietf.org?subject=unsubscribe>
List-Archive: <http://www.ietf.org/mail-archive/web/hipsec>
List-Post: <mailto:hipsec@ietf.org>
List-Help: <mailto:hipsec-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/hipsec>, <mailto:hipsec-request@ietf.org?subject=subscribe>
X-List-Received-Date: Tue, 02 Mar 2010 15:28:23 -0000
Hello Julien and Tom, the algorithm for generating the hash part of the HITs in the new ORCHID format and its index should be specified somewhere. The question is where. Since not all protocols that use ORCHIDS are required to use the same bits/algorithms, it might make sense to specify the actual ID and algorithm in the context of the protocol that uses the ORCHID. In our case, we could start with a simple allocation for: ID 0 - SHA2-256 truncated to 96 bits This could be defined in any HIP document. I think RFC5201-bis would make sense, wouldn't it? We can later extend it to use some hash chain extension mechanism (e.g., as ID 1) but I think a simple mechanism is a good start. Any opinions on this? Tobias -- Dipl.-Inform. Tobias Heer, Ph.D. Student Distributed Systems Group RWTH Aachen University, Germany tel: +49 241 80 207 76 web: http://ds.cs.rwth-aachen.de/members/heer
- [Hipsec] Orchid generation algorithm - where shou… Tobias Heer
- Re: [Hipsec] Orchid generation algorithm - where … Laganier, Julien
- Re: [Hipsec] Orchid generation algorithm - where … Henderson, Thomas R