-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On Fri, 12 May 2000, Adam Langley wrote:
> I've written up a discussion I've just had with Scott on #freenet. In the > hope > that others will find it useful. It's at > http://freenet.sourceforge.net/fncrypto.pdf. The pdftotext output is included > below - but the PDF is much clearer. Some corrections: You should include the 768 bit DH prime we use in the text of the paper, so its easy to find. Here's the number in hex: FFFFFFFF FFFFFFFF C90FDAA2 2168C234 C4C6628B 80DC1CD1 29024E08 8A67CC74 020BBEA6 3B139B22 514A0879 8E3404DD EF9519B3 CD3A431B 302B0A6D F25F1437 4FE1356D 6D51C245 E485B576 625E7EC6 F44C42E9 A637ED6B 0BFF5CB6 F406B7ED EE386BFB 5A899FA5 AE9F2411 7C4B1FE6 49286651 ECE65381 FFFFFFFF FFFFFFFF This is from the IPsec standard, and apparently the prime was chosen because it has analysed security properties. Its generator is 2. The names of the arrays are "feedback_register" and "buffer", not "feedback_buffer". You mispelled receiving in the PCFB section. You need to note that the advantage to PCFB is that you can send a single byte, and that you must keep a pointer telling where in the buffer (b[]) you are. You need to make it clear that its the enciphered byte that gets put back into feedback_register. That means that the sending end does C=P ^ BUFFER[i], then puts C in FEEDBACK[i]. The receiver receives C and puts it in FEEDBACK[i], then deciphers: P = C ^ BUFFER[i]. Otherwise, looks quite good. I'm going to send you a latex document that describes the mathematics of PCFB. Scott -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.0.1 (GNU/Linux) Comment: For info see http://www.gnupg.org iD8DBQE5HJIOpXyM95IyRhURAv4HAJ9sR4DtF+0ZCosbCnQRA7W16Ey1YwCgmrRI cYKznTb6yVUnfClAPKtmyL8= =EFHF -----END PGP SIGNATURE----- _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
