From e7202e0ee6952be84af9e54c1f80f7d25cc66dee Mon Sep 17 00:00:00 2001
From: zzz <zzz@mail.i2p>
Date: Wed, 25 Jul 2018 15:46:20 +0000
Subject: [PATCH] javadoc html fix

---
 .../eddsa/math/ed25519/Ed25519LittleEndianEncoding.java       | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/core/java/src/net/i2p/crypto/eddsa/math/ed25519/Ed25519LittleEndianEncoding.java b/core/java/src/net/i2p/crypto/eddsa/math/ed25519/Ed25519LittleEndianEncoding.java
index 611a0a1d8..f5f0c3260 100644
--- a/core/java/src/net/i2p/crypto/eddsa/math/ed25519/Ed25519LittleEndianEncoding.java
+++ b/core/java/src/net/i2p/crypto/eddsa/math/ed25519/Ed25519LittleEndianEncoding.java
@@ -16,7 +16,7 @@ public class Ed25519LittleEndianEncoding extends Encoding {
      * The idea for the modulo p reduction algorithm is as follows:
      * <p>
      * Assumption:
-     * <p><ul>
+     * </p><ul>
      * <li>p = 2^255 - 19
      * <li>h = h0 + 2^25 * h1 + 2^(26+25) * h2 + ... + 2^230 * h9 where 0 &lt;= |hi| &lt; 2^27 for all i=0,...,9.
      * <li>h congruent r modulo p, i.e. h = r + q * p for some suitable 0 &lt;= r &lt; p and an integer q.
@@ -211,7 +211,7 @@ public class Ed25519LittleEndianEncoding extends Encoding {
      * Return false if x is in {0,2,4,...,q-1}
      * <p>
      * Preconditions:
-     * <p><ul>
+     * </p><ul>
      * <li>|x| bounded by 1.1*2^26,1.1*2^25,1.1*2^26,1.1*2^25,etc.
      * </ul>
      *