summaryrefslogtreecommitdiff
path: root/modarith.h
diff options
context:
space:
mode:
authorweidai <weidai11@users.noreply.github.com>2004-07-22 00:51:57 +0000
committerweidai <weidai11@users.noreply.github.com>2004-07-22 00:51:57 +0000
commit393ae4859a9d3df3c5aee304b4c65121b657f613 (patch)
treefaff40f3429fb7fb70249c83afd5378f92ebdb31 /modarith.h
parentad8043d50c19d94177a420fba5ef6e9fd15afff1 (diff)
downloadcryptopp-git-393ae4859a9d3df3c5aee304b4c65121b657f613.tar.gz
fix documentation, fix PanamaMAC, fix algorithm names
Diffstat (limited to 'modarith.h')
-rw-r--r--modarith.h4
1 files changed, 3 insertions, 1 deletions
diff --git a/modarith.h b/modarith.h
index 365f4c5e..f7cb6be7 100644
--- a/modarith.h
+++ b/modarith.h
@@ -14,7 +14,8 @@ CRYPTOPP_DLL_TEMPLATE_CLASS AbstractGroup<Integer>;
CRYPTOPP_DLL_TEMPLATE_CLASS AbstractRing<Integer>;
CRYPTOPP_DLL_TEMPLATE_CLASS AbstractEuclideanDomain<Integer>;
-//! .
+//! ring of congruence classes modulo n
+/*! \note this implementation represents each congruence class as the smallest non-negative integer in that class */
class CRYPTOPP_DLL ModularArithmetic : public AbstractRing<Integer>
{
public:
@@ -117,6 +118,7 @@ protected:
// const ModularArithmetic::RandomizationParameter ModularArithmetic::DefaultRandomizationParameter = 0 ;
//! do modular arithmetics in Montgomery representation for increased speed
+/*! \note the Montgomery representation represents each congruence class [a] as a*r%n, where r is a convenient power of 2 */
class CRYPTOPP_DLL MontgomeryRepresentation : public ModularArithmetic
{
public: