From 8d5e7a3945f24ae6092f14b6f321e64f5a2be781 Mon Sep 17 00:00:00 2001
From: Gemorroj <wapinet@gmail.com>
Date: Wed, 20 Feb 2013 18:11:23 +0300
Subject: [PATCH] Fixed broken characters.

---
 phpseclib/File/ASN1.php       | 14 +++++++-------
 phpseclib/Math/BigInteger.php |  6 +++---
 2 files changed, 10 insertions(+), 10 deletions(-)

diff --git a/phpseclib/File/ASN1.php b/phpseclib/File/ASN1.php
index a224abde..806fb4e5 100644
--- a/phpseclib/File/ASN1.php
+++ b/phpseclib/File/ASN1.php
@@ -304,12 +304,12 @@ class File_ASN1 {
                 } while ( $loop );
             }
 
-            // Length, as discussed in � 8.1.3 of X.690-0207.pdf#page=13
+            // Length, as discussed in § 8.1.3 of X.690-0207.pdf#page=13
             $length = ord($this->_string_shift($encoded));
             $start++;
             if ( $length == 0x80 ) { // indefinite length
                 // "[A sender shall] use the indefinite form (see 8.1.3.6) if the encoding is constructed and is not all 
-                //  immediately available." -- � 8.1.3.2.c
+                //  immediately available." -- § 8.1.3.2.c
                 //if ( !$constructed ) {
                 //    return false;
                 //}
@@ -323,7 +323,7 @@ class File_ASN1 {
                 extract(unpack('Nlength', substr(str_pad($temp, 4, chr(0), STR_PAD_LEFT), -4)));
             }
 
-            // End-of-content, see �� 8.1.1.3, 8.1.3.2, 8.1.3.6, 8.1.5, and (for an example) 8.6.4.2
+            // End-of-content, see §§ 8.1.1.3, 8.1.3.2, 8.1.3.6, 8.1.5, and (for an example) 8.6.4.2
             if (!$type && !$length) {
                 return $decoded;
             }
@@ -357,7 +357,7 @@ class File_ASN1 {
             // decode UNIVERSAL tags
             switch ($tag) {
                 case FILE_ASN1_TYPE_BOOLEAN:
-                    // "The contents octets shall consist of a single octet." -- � 8.2.1
+                    // "The contents octets shall consist of a single octet." -- § 8.2.1
                     //if (strlen($content) != 1) {
                     //    return false;
                     //}
@@ -410,7 +410,7 @@ class File_ASN1 {
                     }
                     break;
                 case FILE_ASN1_TYPE_NULL:
-                    // "The contents octets shall not contain any octets." -- � 8.8.2
+                    // "The contents octets shall not contain any octets." -- § 8.8.2
                     //if (strlen($content)) {
                     //    return false;
                     //}
@@ -441,7 +441,7 @@ class File_ASN1 {
                 /* Each character string type shall be encoded as if it had been declared:
                    [UNIVERSAL x] IMPLICIT OCTET STRING
 
-                     -- X.690-0207.pdf#page=23 (� 8.21.3)
+                     -- X.690-0207.pdf#page=23 (§ 8.21.3)
 
                    Per that, we're not going to do any validation.  If there are any illegal characters in the string, 
                    we don't really care */
@@ -1055,7 +1055,7 @@ class File_ASN1 {
      * DER-encode the length
      *
      * DER supports lengths up to (2**8)**127, however, we'll only support lengths up to (2**8)**4.  See
-     * {@link http://itu.int/ITU-T/studygroups/com17/languages/X.690-0207.pdf#p=13 X.690 � 8.1.3} for more information.
+     * {@link http://itu.int/ITU-T/studygroups/com17/languages/X.690-0207.pdf#p=13 X.690 § 8.1.3} for more information.
      *
      * @access private
      * @param Integer $length
diff --git a/phpseclib/Math/BigInteger.php b/phpseclib/Math/BigInteger.php
index db2dc9c2..897fe9e2 100644
--- a/phpseclib/Math/BigInteger.php
+++ b/phpseclib/Math/BigInteger.php
@@ -2425,12 +2425,12 @@ class Math_BigInteger {
     }
 
     /**
-     * Calculates the greatest common divisor and B�zout's identity.
+     * Calculates the greatest common divisor and Bézout's identity.
      *
-     * Say you have 693 and 609.  The GCD is 21.  B�zout's identity states that there exist integers x and y such that
+     * Say you have 693 and 609.  The GCD is 21.  Bézout's identity states that there exist integers x and y such that
      * 693*x + 609*y == 21.  In point of fact, there are actually an infinite number of x and y combinations and which
      * combination is returned is dependant upon which mode is in use.  See
-     * {@link http://en.wikipedia.org/wiki/B%C3%A9zout%27s_identity B�zout's identity - Wikipedia} for more information.
+     * {@link http://en.wikipedia.org/wiki/B%C3%A9zout%27s_identity Bézout's identity - Wikipedia} for more information.
      *
      * Here's an example:
      * <code>