[Cryptech-Commits] [core/math/modexp] 02/06: Updated README with more info about the modexp core and status.

[git at cryptech.is]

This is an automated email from the git hooks/post-receive script.

joachim at secworks.se pushed a commit to branch master
in repository core/math/modexp.

commit d77483d5844b6ca4bfc7d1c7d74e5c863c831271
Author: Joachim Strömbergson <joachim at secworks.se>
Date:   Mon Apr 20 09:28:05 2015 +0200

    Updated README with more info about the modexp core and status.
---
 README.md | 15 ++++++++++++++-
 1 file changed, 14 insertions(+), 1 deletion(-)

diff --git a/README.md b/README.md
index e6f44a9..199e074 100644
--- a/README.md
+++ b/README.md
@@ -26,7 +26,9 @@ FPGA and ASIC devices. No vendor specific macros are used in the code.
 
 The core is using Montgomery multiplication with 32-bit operands. The
 core is iterative and will not be the fastest core on the
-planet.
+planet. The residue calculation is done in a separate process and the
+calculated residue can be extracted and loaded by the application to
+improve performance.
 
 The core will perform blinding to protect against side channel
 attacks.
@@ -39,6 +41,13 @@ No results yet.
 
 ## Status ##
 
+***(2015-04-20)***
+
+The Montgomery calculator has been implemented and debugged. The residue
+calculator has been implemeted and debugged. The top level is being
+developed and debugged.
+
+
 ***(2015-03-13)***
 
 A working, bit exact C model with test cases has been developed and is
@@ -47,3 +56,7 @@ available as support for high level undertanding.
 
 Development of the Montgomery product module started. Top level modexp
 module with memories for all operands are being worked on.
+
+The Montgomery calculator has been implemented and debugged. The residue
+calculator has been implemeted and debugged. The top level is being
+developed and debugged.