[Cfrg] KCipher-2

["Jim Schaad" <[e-mail]>]

The ISE is debating the publication of the document
http://tools.ietf.org/html/draft-kiyomoto-kcipher2-07 
which describes the KCipher2 algorithm.  I would like to get more eyes to
look at the draft and provide comments on the following issues:

1.  Does anybody know any reason why we should not publish this document?

2.  In section 2.4.2 of the document, a procedure is given to determine the
values of a0, a1, a2 and a3.  In appendix A, a simple lookup table is
provided which allows the normal program to not care about what the values
of a0, a1, a2 and a3 are as they can do the required multiplication step by
table lookup.  Is there any reason to require that actual values be provided
for a0, a1, a2 and a3 so that somebody who is not well up on the math (for
example me) could actually check that the values are both correct according
to what they have said is the method of deriving them and that the lookup
tables are correct.


Thanks for any and all input,

Jim Schaad