svn commit: lorikeet r113 - in trunk/samba4-ad-thesis: .

[abartlet at samba.org]

Author: abartlet
Date: 2004-10-28 13:22:14 +0000 (Thu, 28 Oct 2004)
New Revision: 113

WebSVN: http://websvn.samba.org/websvn/changeset.php?rep=lorikeet&path=/trunk/samba4-ad-thesis&rev=113&nolog=1

Log:
More fixes from dad.

Andrew Bartlett

Modified:
   trunk/samba4-ad-thesis/chapters.lyx


Changeset:
Modified: trunk/samba4-ad-thesis/chapters.lyx
===================================================================
--- trunk/samba4-ad-thesis/chapters.lyx	2004-10-27 13:26:57 UTC (rev 112)
+++ trunk/samba4-ad-thesis/chapters.lyx	2004-10-28 13:22:14 UTC (rev 113)
@@ -3043,10 +3043,10 @@
  hdb module development.
 \layout Section
 
-clapd
+Clapd
 \layout Standard
 
-clapd is a simple Connectionless LDAP daemon, written as part of the IBM
+Clapd is a simple Connectionless LDAP daemon, written as part of the IBM
  research effort
 \begin_inset LatexCommand \citep{jmcdAD}
 
@@ -3087,12 +3087,12 @@
 LDB
 \layout Standard
 
-LDB is a described as a `LDAP like Database'.
+LDB is described as a `LDAP like Database'.
  Designed to avoid giving Samba4 a dependency on OpenLDAP, ldb implements
  an `LDAP like' API and data format.
  LDB includes an abstraction layer that allows it to be backed onto LDAP,
  or onto a local flat-file database, in the format of a TDB.
- As such, a Samba4 installation can remain self-contained, without demanding
+ Therefore, a Samba4 installation can remain self-contained, without demanding
  the notoriously complex task of setting up an external LDAP server.
  
 \layout Standard
@@ -3402,7 +3402,7 @@
 Trying the short name
 \layout Standard
 
-After compleating the `failed' testing with long-name domain joins, comparison
+After completing the `failed' testing with long-name domain joins, comparison
  tests were run - to confirm the status of the `before' case, which was
  expected to easily be triggered by simply using the `short' or NetBIOS
  domain name.
@@ -3461,7 +3461,7 @@
 Crypto Challenges
 \layout Standard
 
-In implementing many of the Active Directory protocols, a there have been
+In implementing many of the Active Directory protocols, there have been
  a number of cryptographic puzzles which we have had to solve.
  These have involved determining the encryption routine, or in one case
  the previously unknown encryption keys used between Microsoft's own client
@@ -3469,7 +3469,7 @@
 \layout Standard
 
 Cryptographic challenges differ greatly from the normal style of network
- protocol analysis, because until the correct answer is obtained, there
+ protocol analysis because, until the correct answer is obtained, there
  is no indication how `close' a particular solution may be.
  This puts off many people from the challenge, but also makes the problem
  that much more rewarding when the answer finally arrives.
@@ -3576,7 +3576,7 @@
  own password.
 \end_inset 
 
- As such, versions of Windows 2000 introduced a confounder, into the session
+ Hence, versions of Windows 2000 introduced a confounder, into the session
  key (integrated in this case with MD5), to ensure that any two password
  set operations have distinct encryption keys.
 \layout Subsection
@@ -3729,8 +3729,8 @@
 Proof that it's a fixed key
 \layout Standard
 
-One of the first breakthrough in solving the puzzle was the realisation
- that despite changes in user-names and passwords, the encrypted secret
+One of the first breakthroughs in solving the puzzle was the realisation
+ that, despite changes in user-names and passwords, the encrypted secret
  would not change.
  This was most puzzling, because secrets are typically encrypted with a
  session key, a secret to between the user and server (which implies that