Author: toad
Date: 2006-03-10 16:34:26 +0000 (Fri, 10 Mar 2006)
New Revision: 8214

Modified:
   trunk/docs/fnet.tex
Log:
minor changes

Modified: trunk/docs/fnet.tex
===================================================================
--- trunk/docs/fnet.tex 2006-03-10 16:30:27 UTC (rev 8213)
+++ trunk/docs/fnet.tex 2006-03-10 16:34:26 UTC (rev 8214)
@@ -257,16 +257,16 @@
 client into plaintext reconstructed versions.

 Encryption of the data is typically done using symmetric encryption,
-the key being part of the address (in the case of the CHK) or the
-bitwise XOR of a subspace wide key and and a hash of the name part
-(using a different hash function than we use when deriving the routing
-key).
+the key being part of the address (in the case of the CHK), or an
+encrypted key provided in the headers, to be decrypted using a subspace
+wide key provided in the address (in the case of an SSK). Either way,
+the key itself is normally derived from the data's original hash.

 The client also handles splitting and padding of data. As a basic
 measure to help a little againts profiling and traffic analysis,
-documents in Freenet must be an exponent of two bytes in size. Clients
-ensure this by padding, and also by splitting larger documents into
-many smaller parts. The latter process is also a performance
+documents in Freenet are a fixed size - 32kB for CHKs, and 1kB for SSKs.
+Clients ensure this by padding, and also by splitting larger documents 
+into many smaller parts. The latter process is also a performance
 enhancement: because the parts are inserted under different keys, they
 spread throughout the network which allows for effective multi-source
 downloading (in the style of newer peer-to-peer programs such as
@@ -275,7 +275,7 @@
 As part of the splitting there is also an additional layer of
 redundancy, since the clients can use erasure codes to make sure that
 not all the parts are necessary to recreate the document. Freenet
-currently makes use of INSERT TYPE OF CODES WITH REFERENCE HERE.
+currently makes use of Vandermonde Forward Error Correction codes.


 \section{Routing in the Network}
@@ -361,9 +361,9 @@

 The system for joining and leaving the network is very
 simple. Nodes choose an identity at random, and then connect to those
-peers with whom they have a prestablished trusted relationship. To
+peers with whom they have a pre-established trusted relationship. To
 protect against man in the middle attacks, the connections are
-initiated by the exchange of certificates between user - the certificates
+initiated by the exchange of certificates between users - the certificates
 include both contact information (in practice, the nodes current IP
 address and port number) and cryptographic identifiers for the nodes. 

@@ -392,7 +392,7 @@
 increased performance to encourage people to authenticate and connect
 to as many trusted peers as possible, but in the future other ways of
 encouraging this may be necessary (for example allowing the software
-to be used as an instant messaging client and/or fille sharing client
+to be used as an instant messaging client and/or file-sharing client
 with those one has authenticated).

 \section{Implementation}


Reply via email to