Yajbir-Malik/DocumentServer-v-9.2.0
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

init repo

Browse Source
This commit is contained in:
nikolay ivanov
2014-07-05 18:22:49 +00:00
commit a8be6b9e72
17348 changed files with 9229832 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

503
ActiveX/Common/RSA/Blowfish.h Normal file
View File

@@ -0,0 +1,503 @@
/*
* (c) Copyright Ascensio System SIA 2010-2014
*
* This program is a free software product. You can redistribute it and/or
* modify it under the terms of the GNU Affero General Public License (AGPL)
* version 3 as published by the Free Software Foundation. In accordance with
* Section 7(a) of the GNU AGPL its Section 15 shall be amended to the effect
* that Ascensio System SIA expressly excludes the warranty of non-infringement
* of any third-party rights.
*
* This program is distributed WITHOUT ANY WARRANTY; without even the implied
* warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. For
* details, see the GNU AGPL at: http://www.gnu.org/licenses/agpl-3.0.html
*
* You can contact Ascensio System SIA at Lubanas st. 125a-25, Riga, Latvia,
* EU, LV-1021.
*
* The interactive user interfaces in modified source and object code versions
* of the Program must display Appropriate Legal Notices, as required under
* Section 5 of the GNU AGPL version 3.
*
* Pursuant to Section 7(b) of the License you must retain the original Product
* logo when distributing the program. Pursuant to Section 7(e) we decline to
* grant you any rights under trademark law for use of our trademarks.
*
* All the Product's GUI elements, including illustrations and icon sets, as
* well as technical writing content are licensed under the terms of the
* Creative Commons Attribution-ShareAlike 4.0 International. See the License
* terms at http://creativecommons.org/licenses/by-sa/4.0/legalcode
*
*/
#pragma once
#include <atlenc.h>
#define BYTE3(x) ((BYTE)x)
#define BYTE2(x) ((BYTE)(x>>8))
#define BYTE1(x) ((BYTE)(x>>16))
#define BYTE0(x) ((BYTE)(x>>24))
#define ROUND(a,b,n) (a ^= ((m_pSBoxes[0][BYTE0(b)] + m_pSBoxes[1][BYTE1(b)]) ^ (m_pSBoxes[2][BYTE2(b)] + m_pSBoxes[3][BYTE3(b)]) ^ m_pPArray[n]))
static const DWORD g_cnPArrayDefault[18] =
{
0x243f6a88, 0x85a308d3, 0x13198a2e, 0x03707344,
0xa4093822, 0x299f31d0, 0x082efa98, 0xec4e6c89,
0x452821e6, 0x38d01377, 0xbe5466cf, 0x34e90c6c,
0xc0ac29b7, 0xc97c50dd, 0x3f84d5b5, 0xb5470917,
0x9216d5d9, 0x8979fb1b,
};
static const DWORD g_cnSBoxesDefault[4][256] =
{
0xd1310ba6, 0x98dfb5ac, 0x2ffd72db, 0xd01adfb7,
0xb8e1afed, 0x6a267e96, 0xba7c9045, 0xf12c7f99,
0x24a19947, 0xb3916cf7, 0x0801f2e2, 0x858efc16,
0x636920d8, 0x71574e69, 0xa458fea3, 0xf4933d7e,
0x0d95748f, 0x728eb658, 0x718bcd58, 0x82154aee,
0x7b54a41d, 0xc25a59b5, 0x9c30d539, 0x2af26013,
0xc5d1b023, 0x286085f0, 0xca417918, 0xb8db38ef,
0x8e79dcb0, 0x603a180e, 0x6c9e0e8b, 0xb01e8a3e,
0xd71577c1, 0xbd314b27, 0x78af2fda, 0x55605c60,
0xe65525f3, 0xaa55ab94, 0x57489862, 0x63e81440,
0x55ca396a, 0x2aab10b6, 0xb4cc5c34, 0x1141e8ce,
0xa15486af, 0x7c72e993, 0xb3ee1411, 0x636fbc2a,
0x2ba9c55d, 0x741831f6, 0xce5c3e16, 0x9b87931e,
0xafd6ba33, 0x6c24cf5c, 0x7a325381, 0x28958677,
0x3b8f4898, 0x6b4bb9af, 0xc4bfe81b, 0x66282193,
0x61d809cc, 0xfb21a991, 0x487cac60, 0x5dec8032,
0xef845d5d, 0xe98575b1, 0xdc262302, 0xeb651b88,
0x23893e81, 0xd396acc5, 0x0f6d6ff3, 0x83f44239,
0x2e0b4482, 0xa4842004, 0x69c8f04a, 0x9e1f9b5e,
0x21c66842, 0xf6e96c9a, 0x670c9c61, 0xabd388f0,
0x6a51a0d2, 0xd8542f68, 0x960fa728, 0xab5133a3,
0x6eef0b6c, 0x137a3be4, 0xba3bf050, 0x7efb2a98,
0xa1f1651d, 0x39af0176, 0x66ca593e, 0x82430e88,
0x8cee8619, 0x456f9fb4, 0x7d84a5c3, 0x3b8b5ebe,
0xe06f75d8, 0x85c12073, 0x401a449f, 0x56c16aa6,
0x4ed3aa62, 0x363f7706, 0x1bfedf72, 0x429b023d,
0x37d0d724, 0xd00a1248, 0xdb0fead3, 0x49f1c09b,
0x075372c9, 0x80991b7b, 0x25d479d8, 0xf6e8def7,
0xe3fe501a, 0xb6794c3b, 0x976ce0bd, 0x04c006ba,
0xc1a94fb6, 0x409f60c4, 0x5e5c9ec2, 0x196a2463,
0x68fb6faf, 0x3e6c53b5, 0x1339b2eb, 0x3b52ec6f,
0x6dfc511f, 0x9b30952c, 0xcc814544, 0xaf5ebd09,
0xbee3d004, 0xde334afd, 0x660f2807, 0x192e4bb3,
0xc0cba857, 0x45c8740f, 0xd20b5f39, 0xb9d3fbdb,
0x5579c0bd, 0x1a60320a, 0xd6a100c6, 0x402c7279,
0x679f25fe, 0xfb1fa3cc, 0x8ea5e9f8, 0xdb3222f8,
0x3c7516df, 0xfd616b15, 0x2f501ec8, 0xad0552ab,
0x323db5fa, 0xfd238760, 0x53317b48, 0x3e00df82,
0x9e5c57bb, 0xca6f8ca0, 0x1a87562e, 0xdf1769db,
0xd542a8f6, 0x287effc3, 0xac6732c6, 0x8c4f5573,
0x695b27b0, 0xbbca58c8, 0xe1ffa35d, 0xb8f011a0,
0x10fa3d98, 0xfd2183b8, 0x4afcb56c, 0x2dd1d35b,
0x9a53e479, 0xb6f84565, 0xd28e49bc, 0x4bfb9790,
0xe1ddf2da, 0xa4cb7e33, 0x62fb1341, 0xcee4c6e8,
0xef20cada, 0x36774c01, 0xd07e9efe, 0x2bf11fb4,
0x95dbda4d, 0xae909198, 0xeaad8e71, 0x6b93d5a0,
0xd08ed1d0, 0xafc725e0, 0x8e3c5b2f, 0x8e7594b7,
0x8ff6e2fb, 0xf2122b64, 0x8888b812, 0x900df01c,
0x4fad5ea0, 0x688fc31c, 0xd1cff191, 0xb3a8c1ad,
0x2f2f2218, 0xbe0e1777, 0xea752dfe, 0x8b021fa1,
0xe5a0cc0f, 0xb56f74e8, 0x18acf3d6, 0xce89e299,
0xb4a84fe0, 0xfd13e0b7, 0x7cc43b81, 0xd2ada8d9,
0x165fa266, 0x80957705, 0x93cc7314, 0x211a1477,
0xe6ad2065, 0x77b5fa86, 0xc75442f5, 0xfb9d35cf,
0xebcdaf0c, 0x7b3e89a0, 0xd6411bd3, 0xae1e7e49,
0x00250e2d, 0x2071b35e, 0x226800bb, 0x57b8e0af,
0x2464369b, 0xf009b91e, 0x5563911d, 0x59dfa6aa,
0x78c14389, 0xd95a537f, 0x207d5ba2, 0x02e5b9c5,
0x83260376, 0x6295cfa9, 0x11c81968, 0x4e734a41,
0xb3472dca, 0x7b14a94a, 0x1b510052, 0x9a532915,
0xd60f573f, 0xbc9bc6e4, 0x2b60a476, 0x81e67400,
0x08ba6fb5, 0x571be91f, 0xf296ec6b, 0x2a0dd915,
0xb6636521, 0xe7b9f9b6, 0xff34052e, 0xc5855664,
0x53b02d5d, 0xa99f8fa1, 0x08ba4799, 0x6e85076a,
0x4b7a70e9, 0xb5b32944, 0xdb75092e, 0xc4192623,
0xad6ea6b0, 0x49a7df7d, 0x9cee60b8, 0x8fedb266,
0xecaa8c71, 0x699a17ff, 0x5664526c, 0xc2b19ee1,
0x193602a5, 0x75094c29, 0xa0591340, 0xe4183a3e,
0x3f54989a, 0x5b429d65, 0x6b8fe4d6, 0x99f73fd6,
0xa1d29c07, 0xefe830f5, 0x4d2d38e6, 0xf0255dc1,
0x4cdd2086, 0x8470eb26, 0x6382e9c6, 0x021ecc5e,
0x09686b3f, 0x3ebaefc9, 0x3c971814, 0x6b6a70a1,
0x687f3584, 0x52a0e286, 0xb79c5305, 0xaa500737,
0x3e07841c, 0x7fdeae5c, 0x8e7d44ec, 0x5716f2b8,
0xb03ada37, 0xf0500c0d, 0xf01c1f04, 0x0200b3ff,
0xae0cf51a, 0x3cb574b2, 0x25837a58, 0xdc0921bd,
0xd19113f9, 0x7ca92ff6, 0x94324773, 0x22f54701,
0x3ae5e581, 0x37c2dadc, 0xc8b57634, 0x9af3dda7,
0xa9446146, 0x0fd0030e, 0xecc8c73e, 0xa4751e41,
0xe238cd99, 0x3bea0e2f, 0x3280bba1, 0x183eb331,
0x4e548b38, 0x4f6db908, 0x6f420d03, 0xf60a04bf,
0x2cb81290, 0x24977c79, 0x5679b072, 0xbcaf89af,
0xde9a771f, 0xd9930810, 0xb38bae12, 0xdccf3f2e,
0x5512721f, 0x2e6b7124, 0x501adde6, 0x9f84cd87,
0x7a584718, 0x7408da17, 0xbc9f9abc, 0xe94b7d8c,
0xec7aec3a, 0xdb851dfa, 0x63094366, 0xc464c3d2,
0xef1c1847, 0x3215d908, 0xdd433b37, 0x24c2ba16,
0x12a14d43, 0x2a65c451, 0x50940002, 0x133ae4dd,
0x71dff89e, 0x10314e55, 0x81ac77d6, 0x5f11199b,
0x043556f1, 0xd7a3c76b, 0x3c11183b, 0x5924a509,
0xf28fe6ed, 0x97f1fbfa, 0x9ebabf2c, 0x1e153c6e,
0x86e34570, 0xeae96fb1, 0x860e5e0a, 0x5a3e2ab3,
0x771fe71c, 0x4e3d06fa, 0x2965dcb9, 0x99e71d0f,
0x803e89d6, 0x5266c825, 0x2e4cc978, 0x9c10b36a,
0xc6150eba, 0x94e2ea78, 0xa5fc3c53, 0x1e0a2df4,
0xf2f74ea7, 0x361d2b3d, 0x1939260f, 0x19c27960,
0x5223a708, 0xf71312b6, 0xebadfe6e, 0xeac31f66,
0xe3bc4595, 0xa67bc883, 0xb17f37d1, 0x018cff28,
0xc332ddef, 0xbe6c5aa5, 0x65582185, 0x68ab9802,
0xeecea50f, 0xdb2f953b, 0x2aef7dad, 0x5b6e2f84,
0x1521b628, 0x29076170, 0xecdd4775, 0x619f1510,
0x13cca830, 0xeb61bd96, 0x0334fe1e, 0xaa0363cf,
0xb5735c90, 0x4c70a239, 0xd59e9e0b, 0xcbaade14,
0xeecc86bc, 0x60622ca7, 0x9cab5cab, 0xb2f3846e,
0x648b1eaf, 0x19bdf0ca, 0xa02369b9, 0x655abb50,
0x40685a32, 0x3c2ab4b3, 0x319ee9d5, 0xc021b8f7,
0x9b540b19, 0x875fa099, 0x95f7997e, 0x623d7da8,
0xf837889a, 0x97e32d77, 0x11ed935f, 0x16681281,
0x0e358829, 0xc7e61fd6, 0x96dedfa1, 0x7858ba99,
0x57f584a5, 0x1b227263, 0x9b83c3ff, 0x1ac24696,
0xcdb30aeb, 0x532e3054, 0x8fd948e4, 0x6dbc3128,
0x58ebf2ef, 0x34c6ffea, 0xfe28ed61, 0xee7c3c73,
0x5d4a14d9, 0xe864b7e3, 0x42105d14, 0x203e13e0,
0x45eee2b6, 0xa3aaabea, 0xdb6c4f15, 0xfacb4fd0,
0xc742f442, 0xef6abbb5, 0x654f3b1d, 0x41cd2105,
0xd81e799e, 0x86854dc7, 0xe44b476a, 0x3d816250,
0xcf62a1f2, 0x5b8d2646, 0xfc8883a0, 0xc1c7b6a3,
0x7f1524c3, 0x69cb7492, 0x47848a0b, 0x5692b285,
0x095bbf00, 0xad19489d, 0x1462b174, 0x23820e00,
0x58428d2a, 0x0c55f5ea, 0x1dadf43e, 0x233f7061,
0x3372f092, 0x8d937e41, 0xd65fecf1, 0x6c223bdb,
0x7cde3759, 0xcbee7460, 0x4085f2a7, 0xce77326e,
0xa6078084, 0x19f8509e, 0xe8efd855, 0x61d99735,
0xa969a7aa, 0xc50c06c2, 0x5a04abfc, 0x800bcadc,
0x9e447a2e, 0xc3453484, 0xfdd56705, 0x0e1e9ec9,
0xdb73dbd3, 0x105588cd, 0x675fda79, 0xe3674340,
0xc5c43465, 0x713e38d8, 0x3d28f89e, 0xf16dff20,
0x153e21e7, 0x8fb03d4a, 0xe6e39f2b, 0xdb83adf7,
0xe93d5a68, 0x948140f7, 0xf64c261c, 0x94692934,
0x411520f7, 0x7602d4f7, 0xbcf46b2e, 0xd4a20068,
0xd4082471, 0x3320f46a, 0x43b7d4b7, 0x500061af,
0x1e39f62e, 0x97244546, 0x14214f74, 0xbf8b8840,
0x4d95fc1d, 0x96b591af, 0x70f4ddd3, 0x66a02f45,
0xbfbc09ec, 0x03bd9785, 0x7fac6dd0, 0x31cb8504,
0x96eb27b3, 0x55fd3941, 0xda2547e6, 0xabca0a9a,
0x28507825, 0x530429f4, 0x0a2c86da, 0xe9b66dfb,
0x68dc1462, 0xd7486900, 0x680ec0a4, 0x27a18dee,
0x4f3ffea2, 0xe887ad8c, 0xb58ce006, 0x7af4d6b6,
0xaace1e7c, 0xd3375fec, 0xce78a399, 0x406b2a42,
0x20fe9e35, 0xd9f385b9, 0xee39d7ab, 0x3b124e8b,
0x1dc9faf7, 0x4b6d1856, 0x26a36631, 0xeae397b2,
0x3a6efa74, 0xdd5b4332, 0x6841e7f7, 0xca7820fb,
0xfb0af54e, 0xd8feb397, 0x454056ac, 0xba489527,
0x55533a3a, 0x20838d87, 0xfe6ba9b7, 0xd096954b,
0x55a867bc, 0xa1159a58, 0xcca92963, 0x99e1db33,
0xa62a4a56, 0x3f3125f9, 0x5ef47e1c, 0x9029317c,
0xfdf8e802, 0x04272f70, 0x80bb155c, 0x05282ce3,
0x95c11548, 0xe4c66d22, 0x48c1133f, 0xc70f86dc,
0x07f9c9ee, 0x41041f0f, 0x404779a4, 0x5d886e17,
0x325f51eb, 0xd59bc0d1, 0xf2bcc18f, 0x41113564,
0x257b7834, 0x602a9c60, 0xdff8e8a3, 0x1f636c1b,
0x0e12b4c2, 0x02e1329e, 0xaf664fd1, 0xcad18115,
0x6b2395e0, 0x333e92e1, 0x3b240b62, 0xeebeb922,
0x85b2a20e, 0xe6ba0d99, 0xde720c8c, 0x2da2f728,
0xd0127845, 0x95b794fd, 0x647d0862, 0xe7ccf5f0,
0x5449a36f, 0x877d48fa, 0xc39dfd27, 0xf33e8d1e,
0x0a476341, 0x992eff74, 0x3a6f6eab, 0xf4f8fd37,
0xa812dc60, 0xa1ebddf8, 0x991be14c, 0xdb6e6b0d,
0xc67b5510, 0x6d672c37, 0x2765d43b, 0xdcd0e804,
0xf1290dc7, 0xcc00ffa3, 0xb5390f92, 0x690fed0b,
0x667b9ffb, 0xcedb7d9c, 0xa091cf0b, 0xd9155ea3,
0xbb132f88, 0x515bad24, 0x7b9479bf, 0x763bd6eb,
0x37392eb3, 0xcc115979, 0x8026e297, 0xf42e312d,
0x6842ada7, 0xc66a2b3b, 0x12754ccc, 0x782ef11c,
0x6a124237, 0xb79251e7, 0x06a1bbe6, 0x4bfb6350,
0x1a6b1018, 0x11caedfa, 0x3d25bdd8, 0xe2e1c3c9,
0x44421659, 0x0a121386, 0xd90cec6e, 0xd5abea2a,
0x64af674e, 0xda86a85f, 0xbebfe988, 0x64e4c3fe,
0x9dbc8057, 0xf0f7c086, 0x60787bf8, 0x6003604d,
0xd1fd8346, 0xf6381fb0, 0x7745ae04, 0xd736fccc,
0x83426b33, 0xf01eab71, 0xb0804187, 0x3c005e5f,
0x77a057be, 0xbde8ae24, 0x55464299, 0xbf582e61,
0x4e58f48f, 0xf2ddfda2, 0xf474ef38, 0x8789bdc2,
0x5366f9c3, 0xc8b38e74, 0xb475f255, 0x46fcd9b9,
0x7aeb2661, 0x8b1ddf84, 0x846a0e79, 0x915f95e2,
0x466e598e, 0x20b45770, 0x8cd55591, 0xc902de4c,
0xb90bace1, 0xbb8205d0, 0x11a86248, 0x7574a99e,
0xb77f19b6, 0xe0a9dc09, 0x662d09a1, 0xc4324633,
0xe85a1f02, 0x09f0be8c, 0x4a99a025, 0x1d6efe10,
0x1ab93d1d, 0x0ba5a4df, 0xa186f20f, 0x2868f169,
0xdcb7da83, 0x573906fe, 0xa1e2ce9b, 0x4fcd7f52,
0x50115e01, 0xa70683fa, 0xa002b5c4, 0x0de6d027,
0x9af88c27, 0x773f8641, 0xc3604c06, 0x61a806b5,
0xf0177a28, 0xc0f586e0, 0x006058aa, 0x30dc7d62,
0x11e69ed7, 0x2338ea63, 0x53c2dd94, 0xc2c21634,
0xbbcbee56, 0x90bcb6de, 0xebfc7da1, 0xce591d76,
0x6f05e409, 0x4b7c0188, 0x39720a3d, 0x7c927c24,
0x86e3725f, 0x724d9db9, 0x1ac15bb4, 0xd39eb8fc,
0xed545578, 0x08fca5b5, 0xd83d7cd3, 0x4dad0fc4,
0x1e50ef5e, 0xb161e6f8, 0xa28514d9, 0x6c51133c,
0x6fd5c7e7, 0x56e14ec4, 0x362abfce, 0xddc6c837,
0xd79a3234, 0x92638212, 0x670efa8e, 0x406000e0,
0x3a39ce37, 0xd3faf5cf, 0xabc27737, 0x5ac52d1b,
0x5cb0679e, 0x4fa33742, 0xd3822740, 0x99bc9bbe,
0xd5118e9d, 0xbf0f7315, 0xd62d1c7e, 0xc700c47b,
0xb78c1b6b, 0x21a19045, 0xb26eb1be, 0x6a366eb4,
0x5748ab2f, 0xbc946e79, 0xc6a376d2, 0x6549c2c8,
0x530ff8ee, 0x468dde7d, 0xd5730a1d, 0x4cd04dc6,
0x2939bbdb, 0xa9ba4650, 0xac9526e8, 0xbe5ee304,
0xa1fad5f0, 0x6a2d519a, 0x63ef8ce2, 0x9a86ee22,
0xc089c2b8, 0x43242ef6, 0xa51e03aa, 0x9cf2d0a4,
0x83c061ba, 0x9be96a4d, 0x8fe51550, 0xba645bd6,
0x2826a2f9, 0xa73a3ae1, 0x4ba99586, 0xef5562e9,
0xc72fefd3, 0xf752f7da, 0x3f046f69, 0x77fa0a59,
0x80e4a915, 0x87b08601, 0x9b09e6ad, 0x3b3ee593,
0xe990fd5a, 0x9e34d797, 0x2cf0b7d9, 0x022b8b51,
0x96d5ac3a, 0x017da67d, 0xd1cf3ed6, 0x7c7d2d28,
0x1f9f25cf, 0xadf2b89b, 0x5ad6b472, 0x5a88f54c,
0xe029ac71, 0xe019a5e6, 0x47b0acfd, 0xed93fa9b,
0xe8d3c48d, 0x283b57cc, 0xf8d56629, 0x79132e28,
0x785f0191, 0xed756055, 0xf7960e44, 0xe3d35e8c,
0x15056dd4, 0x88f46dba, 0x03a16125, 0x0564f0bd,
0xc3eb9e15, 0x3c9057a2, 0x97271aec, 0xa93a072a,
0x1b3f6d9b, 0x1e6321f5, 0xf59c66fb, 0x26dcf319,
0x7533d928, 0xb155fdf5, 0x03563482, 0x8aba3cbb,
0x28517711, 0xc20ad9f8, 0xabcc5167, 0xccad925f,
0x4de81751, 0x3830dc8e, 0x379d5862, 0x9320f991,
0xea7a90c2, 0xfb3e7bce, 0x5121ce64, 0x774fbe32,
0xa8b6e37e, 0xc3293d46, 0x48de5369, 0x6413e680,
0xa2ae0810, 0xdd6db224, 0x69852dfd, 0x09072166,
0xb39a460a, 0x6445c0dd, 0x586cdecf, 0x1c20c8ae,
0x5bbef7dd, 0x1b588d40, 0xccd2017f, 0x6bb4e3bb,
0xdda26a7e, 0x3a59ff45, 0x3e350a44, 0xbcb4cdd5,
0x72eacea8, 0xfa6484bb, 0x8d6612ae, 0xbf3c6f47,
0xd29be463, 0x542f5d9e, 0xaec2771b, 0xf64e6370,
0x740e0d8d, 0xe75b1357, 0xf8721671, 0xaf537d5d,
0x4040cb08, 0x4eb4e2cc, 0x34d2466a, 0x0115af84,
0xe1b00428, 0x95983a1d, 0x06b89fb4, 0xce6ea048,
0x6f3f3b82, 0x3520ab82, 0x011a1d4b, 0x277227f8,
0x611560b1, 0xe7933fdc, 0xbb3a792b, 0x344525bd,
0xa08839e1, 0x51ce794b, 0x2f32c9b7, 0xa01fbac9,
0xe01cc87e, 0xbcc7d1f6, 0xcf0111c3, 0xa1e8aac7,
0x1a908749, 0xd44fbd9a, 0xd0dadecb, 0xd50ada38,
0x0339c32a, 0xc6913667, 0x8df9317c, 0xe0b12b4f,
0xf79e59b7, 0x43f5bb3a, 0xf2d519ff, 0x27d9459c,
0xbf97222c, 0x15e6fc2a, 0x0f91fc71, 0x9b941525,
0xfae59361, 0xceb69ceb, 0xc2a86459, 0x12baa8d1,
0xb6c1075e, 0xe3056a0c, 0x10d25065, 0xcb03a442,
0xe0ec6e0e, 0x1698db3b, 0x4c98a0be, 0x3278e964,
0x9f1f9532, 0xe0d392df, 0xd3a0342b, 0x8971f21e,
0x1b0a7441, 0x4ba3348c, 0xc5be7120, 0xc37632d8,
0xdf359f8d, 0x9b992f2e, 0xe60b6f47, 0x0fe3f11d,
0xe54cda54, 0x1edad891, 0xce6279cf, 0xcd3e7e6f,
0x1618b166, 0xfd2c1d05, 0x848fd2c5, 0xf6fb2299,
0xf523f357, 0xa6327623, 0x93a83531, 0x56cccd02,
0xacf08162, 0x5a75ebb5, 0x6e163697, 0x88d273cc,
0xde966292, 0x81b949d0, 0x4c50901b, 0x71c65614,
0xe6c6c7bd, 0x327a140a, 0x45e1d006, 0xc3f27b9a,
0xc9aa53fd, 0x62a80f00, 0xbb25bfe2, 0x35bdd2f6,
0x71126905, 0xb2040222, 0xb6cbcf7c, 0xcd769c2b,
0x53113ec0, 0x1640e3d3, 0x38abbd60, 0x2547adf0,
0xba38209c, 0xf746ce76, 0x77afa1c5, 0x20756060,
0x85cbfe4e, 0x8ae88dd8, 0x7aaaf9b0, 0x4cf9aa7e,
0x1948c25c, 0x02fb8a8c, 0x01c36ae4, 0xd6ebe1f9,
0x90d4f869, 0xa65cdea0, 0x3f09252d, 0xc208e69f,
0xb74e6132, 0xce77e25b, 0x578fdfe3, 0x3ac372e6,
};
class CBlowfish
{
protected:
static const DWORD g_cnPArraySize = 18;
protected:
LPDWORD m_pPArray;
DWORD (*m_pSBoxes)[256];
void Encrypt(DWORD *pLeft, DWORD *pRight)
{
DWORD dwLeft = *pLeft;
DWORD dwRight = *pRight;
dwLeft ^= m_pPArray[0];
ROUND (dwRight, dwLeft, 1); ROUND (dwLeft, dwRight, 2);
ROUND (dwRight, dwLeft, 3); ROUND (dwLeft, dwRight, 4);
ROUND (dwRight, dwLeft, 5); ROUND (dwLeft, dwRight, 6);
ROUND (dwRight, dwLeft, 7); ROUND (dwLeft, dwRight, 8);
ROUND (dwRight, dwLeft, 9); ROUND (dwLeft, dwRight, 10);
ROUND (dwRight, dwLeft, 11); ROUND (dwLeft, dwRight, 12);
ROUND (dwRight, dwLeft, 13); ROUND (dwLeft, dwRight, 14);
ROUND (dwRight, dwLeft, 15); ROUND (dwLeft, dwRight, 16);
dwRight ^= m_pPArray[17];
*pLeft = dwRight;
*pRight = dwLeft;
}
void Decrypt(DWORD *pLeft, DWORD *pRight)
{
DWORD dwLeft = *pLeft;
DWORD dwRight = *pRight;
dwLeft ^= m_pPArray[17];
ROUND (dwRight, dwLeft, 16); ROUND (dwLeft, dwRight, 15);
ROUND (dwRight, dwLeft, 14); ROUND (dwLeft, dwRight, 13);
ROUND (dwRight, dwLeft, 12); ROUND (dwLeft, dwRight, 11);
ROUND (dwRight, dwLeft, 10); ROUND (dwLeft, dwRight, 9);
ROUND (dwRight, dwLeft, 8); ROUND (dwLeft, dwRight, 7);
ROUND (dwRight, dwLeft, 6); ROUND (dwLeft, dwRight, 5);
ROUND (dwRight, dwLeft, 4); ROUND (dwLeft, dwRight, 3);
ROUND (dwRight, dwLeft, 2); ROUND (dwLeft, dwRight, 1);
dwRight ^= m_pPArray[0] ;
*pLeft = dwRight;
*pRight = dwLeft;
}
public:
CBlowfish()
{
m_pPArray = new DWORD[g_cnPArraySize];
m_pSBoxes = new DWORD[4][256];
}
virtual ~CBlowfish()
{
delete []m_pPArray;
delete []m_pSBoxes;
}
void Init(LPBYTE pKey, DWORD dwKeySize)
{
memcpy(m_pPArray, g_cnPArrayDefault, sizeof(DWORD)*g_cnPArraySize);
memcpy(m_pSBoxes, g_cnSBoxesDefault, sizeof(DWORD)*256*4);
size_t j = 0;
for (size_t i = 0 ; i < g_cnPArraySize; ++i)
{
m_pPArray[i] ^= ((pKey[j] << 24) | (pKey[(j+1) % dwKeySize] << 16) | (pKey[(j+2) % dwKeySize] << 16) | pKey[(j+3) % dwKeySize]);
j = (j + 4) % dwKeySize;
}
DWORD dwDataLeft = 0;
DWORD dwDataRight = 0;
for (size_t i = 0 ; i < g_cnPArraySize; i += 2)
{
Encrypt(&dwDataLeft, &dwDataRight);
m_pPArray[i] = dwDataLeft;
m_pPArray[i + 1] = dwDataRight;
}
for (size_t i = 0 ; i < 4 ; ++i)
{
for (size_t j = 0 ; j < 256 ; j += 2)
{
Encrypt(&dwDataLeft, &dwDataRight) ;
m_pSBoxes[i][j] = dwDataLeft;
m_pSBoxes[i][j + 1] = dwDataRight;
}
}
}
DWORD GetOutputLength(DWORD dwInputLength) const
{
DWORD dwTemp = dwInputLength % 8;
if (0!=dwTemp)
return dwInputLength + 8 - dwTemp;
else
return dwInputLength;
}
DWORD Encrypt(LPBYTE pSrcBuffer, LPBYTE pDstBuffer, DWORD dwSize)
{
DWORD dwOutSize = GetOutputLength(dwSize);
if ((NULL==pSrcBuffer)||(NULL==pDstBuffer)||(0==dwSize))
return dwOutSize;
BOOL bSameDest = (pSrcBuffer == pDstBuffer);
if (bSameDest)
{
for (DWORD dwCount = 0 ; dwCount < dwOutSize ; dwCount += 8)
{
if (dwCount >= dwSize - 7)
{
LPBYTE pTemp = pSrcBuffer + dwSize ;
memset(pSrcBuffer + dwSize , 0, dwOutSize - dwSize);
Encrypt((DWORD *)pSrcBuffer, (DWORD *)(pSrcBuffer + 4));
}
Encrypt((DWORD *)pSrcBuffer, (DWORD *)(pSrcBuffer + 4));
pSrcBuffer += 8 ;
}
}
else
{
for (DWORD dwCount = 0 ; dwCount < dwOutSize ; dwCount += 8)
{
if (dwCount < dwSize - 7)
{
memcpy(pDstBuffer, pSrcBuffer, 8);
}
else
{
DWORD dwReminder = dwOutSize - dwSize ;
memcpy(pDstBuffer, pSrcBuffer, 8 - dwReminder);
memset(pDstBuffer + 8 - dwReminder, 0, dwReminder);
}
Encrypt((DWORD *)pDstBuffer, (DWORD *)(pDstBuffer + 4));
pSrcBuffer += 8 ;
pDstBuffer += 8 ;
}
}
return dwOutSize;
}
void Decrypt(LPBYTE pSrcBuffer, LPBYTE pDstBuffer, DWORD dwSize)
{
if ((NULL==pSrcBuffer)||(NULL==pDstBuffer)||(0==dwSize))
return;
if (pSrcBuffer != pDstBuffer)
memcpy(pDstBuffer, pSrcBuffer, dwSize);
for (DWORD dwCount = 0 ; dwCount < dwSize ; dwCount += 8, pDstBuffer += 8)
Decrypt((DWORD *)pDstBuffer, (DWORD *)(pDstBuffer + 4));
}
LPSTR Encrypt(LPCSTR pszSrc)
{
DWORD dwStrLength = (DWORD)strlen(pszSrc);
DWORD dwEncSize = GetOutputLength(dwStrLength);
LPBYTE pEncBuffer = new BYTE[dwEncSize];
if (NULL==pEncBuffer)
return "";
Encrypt((LPBYTE)pszSrc, pEncBuffer, dwStrLength);
int nBase64Size = Base64EncodeGetRequiredLength((int)dwEncSize);
LPSTR pStrData = new char[nBase64Size + 1];
BOOL bSuccess = Base64Encode(pEncBuffer, (int)dwEncSize, pStrData, &nBase64Size);
pStrData[nBase64Size] = '\0';
delete [] pEncBuffer;
return pStrData;
}
LPSTR Decrypt(LPCSTR pszBase64)
{
int nBase64Length = (int)strlen(pszBase64);
int nEncSize;
Base64Decode(pszBase64, nBase64Length, NULL, &nEncSize);
LPBYTE pEncBuffer = new BYTE[nEncSize];
if (NULL==pEncBuffer)
return "";
if (!Base64Decode(pszBase64, nBase64Length, pEncBuffer, &nEncSize))
{
delete []pEncBuffer;
return "";
}
LPSTR pDecBuffer = new char[nEncSize + 2];
if (NULL==pDecBuffer)
{
delete []pEncBuffer;
return "";
}
Decrypt(pEncBuffer, (LPBYTE)pDecBuffer, nEncSize);
pDecBuffer[nEncSize] = '\0';
pDecBuffer[nEncSize + 1] = '\0';
delete [] pEncBuffer;
return pDecBuffer;
}
};

44
ActiveX/Common/RSA/Includer.h Normal file
View File

@@ -0,0 +1,44 @@
/*
* (c) Copyright Ascensio System SIA 2010-2014
*
* This program is a free software product. You can redistribute it and/or
* modify it under the terms of the GNU Affero General Public License (AGPL)
* version 3 as published by the Free Software Foundation. In accordance with
* Section 7(a) of the GNU AGPL its Section 15 shall be amended to the effect
* that Ascensio System SIA expressly excludes the warranty of non-infringement
* of any third-party rights.
*
* This program is distributed WITHOUT ANY WARRANTY; without even the implied
* warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. For
* details, see the GNU AGPL at: http://www.gnu.org/licenses/agpl-3.0.html
*
* You can contact Ascensio System SIA at Lubanas st. 125a-25, Riga, Latvia,
* EU, LV-1021.
*
* The interactive user interfaces in modified source and object code versions
* of the Program must display Appropriate Legal Notices, as required under
* Section 5 of the GNU AGPL version 3.
*
* Pursuant to Section 7(b) of the License you must retain the original Product
* logo when distributing the program. Pursuant to Section 7(e) we decline to
* grant you any rights under trademark law for use of our trademarks.
*
* All the Product's GUI elements, including illustrations and icon sets, as
* well as technical writing content are licensed under the terms of the
* Creative Commons Attribution-ShareAlike 4.0 International. See the License
* terms at http://creativecommons.org/licenses/by-sa/4.0/legalcode
*
*/
#pragma once
#include "../../Common/ASCUtils.h"
#include "RSA.h"
#include "Blowfish.h"
const int g_cnBlowfishKeySize = 40;
const CString g_csKeyIndexParamName = _T("KeyIndex");
const CString g_csBlowfishKeyParamName = _T("Password");
const LONG g_nKeyIndex = 11;
const CStringA g_csPublicKey = "Xw53v4LiIskYXuTsri5daG0rJn5F7M55Ur31yvfLqUGIbT0jEljDYQRF9kGPlEw7IfMrXyaEbYPdVNeLzcr1sxi0yhdCqkUTtzyU+NUB91Q=<>U8MAAA==";
const CStringA g_csPrivateKey = "RTZUHbbR/xWD9ZnUU7hd1DRWinH3rONqsrwxZT8tvWq5ythkAwFVpQ==<>U/6duwQS7WqSTxVGevHkZhPKHDNpvvLuvEeRKQDwlktd25MPrj2Pgw==";

495
ActiveX/Common/RSA/RSA.h Normal file
View File

@@ -0,0 +1,495 @@
/*
* (c) Copyright Ascensio System SIA 2010-2014
*
* This program is a free software product. You can redistribute it and/or
* modify it under the terms of the GNU Affero General Public License (AGPL)
* version 3 as published by the Free Software Foundation. In accordance with
* Section 7(a) of the GNU AGPL its Section 15 shall be amended to the effect
* that Ascensio System SIA expressly excludes the warranty of non-infringement
* of any third-party rights.
*
* This program is distributed WITHOUT ANY WARRANTY; without even the implied
* warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. For
* details, see the GNU AGPL at: http://www.gnu.org/licenses/agpl-3.0.html
*
* You can contact Ascensio System SIA at Lubanas st. 125a-25, Riga, Latvia,
* EU, LV-1021.
*
* The interactive user interfaces in modified source and object code versions
* of the Program must display Appropriate Legal Notices, as required under
* Section 5 of the GNU AGPL version 3.
*
* Pursuant to Section 7(b) of the License you must retain the original Product
* logo when distributing the program. Pursuant to Section 7(e) we decline to
* grant you any rights under trademark law for use of our trademarks.
*
* All the Product's GUI elements, including illustrations and icon sets, as
* well as technical writing content are licensed under the terms of the
* Creative Commons Attribution-ShareAlike 4.0 International. See the License
* terms at http://creativecommons.org/licenses/by-sa/4.0/legalcode
*
*/
#pragma once
#include "VLong.h"
using namespace VLong;
namespace RSA
{
const static CVLong<DWORD> g_coOne = 1;
static const size_t g_cnBufferGrow = 200;
static LPCSTR g_cpszSeparator = "<>";
class CPrimeFactory
{
size_t m_nNP;
LPDWORD m_pData;
public:
CPrimeFactory()
{
m_nNP = 0;
size_t nNP = 200;
m_pData = new DWORD[nNP];
size_t nSS = 8*nNP;
char *pBitTest = new char[nSS+1];
for (size_t i=0; i<=nSS; i++)
pBitTest[i] = 1;
DWORD dwP = 2;
while (TRUE)
{
while (0==pBitTest[dwP])
dwP++;
if (dwP == nSS )
break;
m_pData[m_nNP] = dwP;
m_nNP++;
if (m_nNP == nNP )
break;
DWORD dwTemp = dwP*2;
while (dwTemp < nSS)
{
pBitTest[dwTemp] = 0;
dwTemp += dwP;
}
dwP++;
}
delete []pBitTest;
}
virtual ~CPrimeFactory()
{
delete []m_pData;
}
CVLong<DWORD> FindPrime(CVLong<DWORD> &oStart)
{
DWORD dwSS = 1000;
char *pBitSet = new char[dwSS];
size_t nTestedCount = 0;
while (TRUE)
{
memset(pBitSet, 1, dwSS);
for (DWORD i=0; i<m_nNP; i++)
{
DWORD dwP = m_pData[i];
DWORD dwR = (DWORD)(oStart % (CVLong<DWORD>)dwP);
if (0!=dwR)
dwR = dwP - dwR;
while (dwR < dwSS )
{
pBitSet[dwR] = 0;
dwR += dwP;
}
}
for (DWORD i=0; i<dwSS; i++)
{
if (0!=pBitSet[i])
{
nTestedCount++;
if (IsProbablePrime(oStart))
{
delete []pBitSet;
return oStart;
}
}
oStart += 1;
}
}
delete []pBitSet;
}
static BOOL IsProbablePrime(const CVLong<DWORD> &oPrime)
{
const size_t nRep = 4;
const CVLong<DWORD> arAny[nRep] = {2,3,5,7};
const CVLong<DWORD> oOne(1);
for (size_t i=0; i<nRep; i++)
{
if (oOne != CMontgomery<DWORD>::ModExp(arAny[i], oPrime - 1, oPrime))
return FALSE;
}
return TRUE;
}
};
class CRSAKeyGenerator
{
protected:
CVLong<DWORD> m_oMod;
CVLong<DWORD> m_oExp;
CVLong<DWORD> m_oP;
CVLong<DWORD> m_oQ;
void CalculatePublicKey()
{
m_oMod = m_oP*m_oQ;
m_oExp = 50001;
while ( (CVLong<DWORD>::GCD(m_oP - g_coOne, m_oExp) != g_coOne) ||
(CVLong<DWORD>::GCD(m_oQ - g_coOne, m_oExp) != g_coOne))
m_oExp += 2;
}
public:
LPSTR ExportPrivateKey()
{
LPSTR pszP = m_oP.ExportToBase64(); size_t nPStrLenght = strlen(pszP);
LPSTR pszQ = m_oQ.ExportToBase64(); size_t nQStrLenght = strlen(pszQ);
LPSTR pszRet = new char[nPStrLenght + nQStrLenght + 2 + 1];
pszRet[0] = '\0';
strcat(pszRet, pszP);
delete []pszP;
strcat(pszRet, g_cpszSeparator);
strcat(pszRet, pszQ);
delete []pszQ;
size_t nRetStrLenght = strlen(pszRet);
for (int i=0; i<(int)nRetStrLenght - 1; i++)
{
if (('\r' == pszRet[i])&&('\n' == pszRet[i+1]))
{
memcpy(pszRet, pszRet + 2, nRetStrLenght - i - 2);
nRetStrLenght -= 2;
i -= 2;
}
}
return pszRet;
}
LPSTR ExportPublicKey()
{
LPSTR pszMod = m_oMod.ExportToBase64(); size_t nModStrLenght = strlen(pszMod);
LPSTR pszExp = m_oExp.ExportToBase64(); size_t nExpStrLenght = strlen(pszExp);
LPSTR pszRet = new char[nModStrLenght + nExpStrLenght + 2 + 1];
pszRet[0] = '\0';
strcat(pszRet, pszMod);
delete []pszMod;
strcat(pszRet, g_cpszSeparator);
strcat(pszRet, pszExp);
delete []pszExp;
size_t nRetStrLenght = strlen(pszRet);
for (int i=0; i<(int)nRetStrLenght - 1; i++)
{
if (('\r' == pszRet[i])&&('\n' == pszRet[i+1]))
{
memcpy(pszRet + i, pszRet + i + 2, nRetStrLenght - i - 2);
nRetStrLenght -= 2;
i -= 2;
}
}
return pszRet;
}
void Create(LPBYTE pKey1, size_t nSizeKey1, LPBYTE pKey2, size_t nSizeKey2)
{
CPrimeFactory oPF;
m_oP = oPF.FindPrime(CVLong<DWORD>::FromBuffer(pKey1, nSizeKey1));
m_oQ = oPF.FindPrime(CVLong<DWORD>::FromBuffer(pKey2, nSizeKey2));
if (m_oP > m_oQ)
{
CVLong<DWORD> oTmp = m_oP;
m_oP = m_oQ;
m_oP = oTmp;
}
CalculatePublicKey();
}
};
class CRSAEncryptor
{
protected:
CVLong<DWORD> m_oMod;
CVLong<DWORD> m_oExp;
CVLong<DWORD> Encrypt(const CVLong<DWORD>& oVal)
{
return CMontgomery<DWORD>::ModExp(oVal, m_oExp, m_oMod);
}
public:
BOOL ImportPublicKey(LPCSTR pszBase64)
{
LPCSTR pszExp = strstr(pszBase64, g_cpszSeparator);
if (NULL==pszExp)
return FALSE;
int nModStrLength = (int)(pszExp - pszBase64);
LPSTR pszMod = new char [nModStrLength + 1];
memcpy(pszMod, pszBase64, nModStrLength);
pszMod[nModStrLength] = '\0';
m_oMod.ImportFromBase64(pszMod);
m_oExp.ImportFromBase64(pszExp + 2);
delete [] pszMod;
#ifdef _DEBUG
LPSTR pszTemp = m_oMod.ExportToBase64();
delete [] pszTemp;
pszTemp = m_oExp.ExportToBase64();
delete [] pszTemp;
#endif
return (((CVLong<DWORD>)0!=m_oMod)&&((CVLong<DWORD>)0!=m_oExp));
}
BOOL Encrypt(LPBYTE pSrcBuffer, size_t nSrcSize, LPBYTE &pDstBuffer, size_t &nDstSize)
{
if ((0==nSrcSize)||(NULL==pSrcBuffer))
return FALSE;
size_t nDstBufferSize = nSrcSize + 1024;
pDstBuffer = new BYTE[nDstBufferSize];
if (NULL==pDstBuffer)
return FALSE;
LPBYTE pDstBufferPtr = pDstBuffer;
nDstSize = 0;
CVLong<DWORD> oKoef = 256;
for (size_t i=0; i<nSrcSize;)
{
CVLong<DWORD> oSrcVal = 0;
size_t j = i;
for (; j < nSrcSize; j++)
{
CVLong<DWORD> oTemp = oSrcVal*oKoef + (CVLong<DWORD>)pSrcBuffer[j];
if (oTemp>=m_oMod)
break;
oSrcVal = oTemp;
}
CVLong<DWORD> oDstVal = Encrypt(oSrcVal);
i = j;
size_t nDstValSize = oDstVal.GetByteRealDataSize();
if (nDstSize + nDstValSize>nDstBufferSize)
{
LPBYTE pDstBufferOld = pDstBuffer;
pDstBuffer = new BYTE[nDstBufferSize + g_cnBufferGrow];
if (NULL==pDstBuffer)
{
delete [] pDstBufferOld;
return FALSE;
}
memcpy(pDstBuffer, pDstBufferOld, nDstBufferSize);
delete [] pDstBufferOld;
nDstBufferSize += g_cnBufferGrow;
pDstBufferPtr += nDstSize;
}
oDstVal.ToBuffer(pDstBufferPtr);
pDstBufferPtr += nDstValSize;
nDstSize += nDstValSize;
}
return TRUE;
}
LPSTR Encrypt(LPCSTR pszSrc)
{
LPBYTE pEncBuffer = NULL; size_t nEncBufferSize = 0;
if (!Encrypt((LPBYTE)pszSrc, strlen(pszSrc), pEncBuffer, nEncBufferSize))
return "";
int nStrSize = Base64EncodeGetRequiredLength((int)nEncBufferSize);
LPSTR pStrData = new char[nStrSize + 1];
BOOL bSuccess = Base64Encode(pEncBuffer, (int)nEncBufferSize, pStrData, &nStrSize);
pStrData[nStrSize] = '\0';
delete [] pEncBuffer;
return pStrData;
}
};
class CRSADecryptor
{
protected:
CVLong<DWORD> m_oMod;
CVLong<DWORD> m_oExp;
CVLong<DWORD> m_oP;
CVLong<DWORD> m_oQ;
void CalculatePublicKey()
{
m_oMod = m_oP*m_oQ;
m_oExp = 50001;
while ( (CVLong<DWORD>::GCD(m_oP - g_coOne, m_oExp) != g_coOne) ||
(CVLong<DWORD>::GCD(m_oQ - g_coOne, m_oExp) != g_coOne))
m_oExp += 2;
}
CVLong<DWORD> Decrypt(CVLong<DWORD>& oVal)
{
CVLong<DWORD> oD = CVLong<DWORD>::ModInv(m_oExp, (m_oP - g_coOne)*(m_oQ - g_coOne));
CVLong<DWORD> oU = CVLong<DWORD>::ModInv(m_oP, m_oQ);
CVLong<DWORD> oDP = oD % (m_oP - g_coOne);
CVLong<DWORD> oDQ = oD % (m_oQ - g_coOne);
CVLong<DWORD> oA = CMontgomery<DWORD>::ModExp(oVal % m_oP, oDP, m_oP);
CVLong<DWORD> oB = CMontgomery<DWORD>::ModExp(oVal % m_oQ, oDQ, m_oQ);
if (oB < oA)
oB += m_oQ;
return oA + m_oP * ( ((oB - oA) * oU) % m_oQ);
}
public:
BOOL ImportPrivateKey(LPCSTR pszBase64)
{
LPCSTR pszQ = strstr(pszBase64, g_cpszSeparator);
if (NULL==pszQ)
return FALSE;
int nPStrLength = (int)(pszQ - pszBase64);
LPSTR pszP = new char [nPStrLength + 1];
memcpy(pszP, pszBase64, nPStrLength);
pszP[nPStrLength] = '\0';
m_oP.ImportFromBase64(pszP);
m_oQ.ImportFromBase64(pszQ + 2);
delete [] pszP;
if (((CVLong<DWORD>)0==m_oP)&&((CVLong<DWORD>)0==m_oQ))
return FALSE;
CalculatePublicKey();
#ifdef _DEBUG
LPBYTE pTemp = new BYTE[1024];
m_oP.ToBuffer(pTemp);
for (size_t i=0; i<m_oP.GetByteRealDataSize(); i++)
{
}
m_oQ.ToBuffer(pTemp);
for (size_t i=0; i<m_oQ.GetByteRealDataSize(); i++)
{
}
m_oMod.ToBuffer(pTemp);
for (size_t i=0; i<m_oMod.GetByteRealDataSize(); i++)
{
}
m_oExp.ToBuffer(pTemp);
for (size_t i=0; i<m_oExp.GetByteRealDataSize(); i++)
{
}
delete [] pTemp;
#endif
return TRUE;
}
void Create(LPBYTE pKey1, size_t nSizeKey1, LPBYTE pKey2, size_t nSizeKey2)
{
CPrimeFactory oPF;
m_oP = oPF.FindPrime(CVLong<DWORD>::FromBuffer(pKey1, nSizeKey1));
m_oQ = oPF.FindPrime(CVLong<DWORD>::FromBuffer(pKey2, nSizeKey2));
if (m_oP > m_oQ)
{
CVLong<DWORD> oTmp = m_oP;
m_oP = m_oQ;
m_oP = oTmp;
}
CalculatePublicKey();
}
BOOL Decrypt(LPBYTE pSrcBuffer, size_t nSrcSize, LPBYTE &pDstBuffer, size_t &nDstSize)
{
if ((0==nSrcSize)||(NULL==pSrcBuffer))
return FALSE;
size_t nDstBufferSize = nSrcSize + 1024;
pDstBuffer = new BYTE[nDstBufferSize];
if (NULL==pDstBuffer)
return FALSE;
LPBYTE pDstBufferPtr = pDstBuffer;
size_t nDstBufferCursor = 0;
CVLong<DWORD> oKoef = 256;
for (size_t i=0; i<nSrcSize; )
{
CVLong<DWORD> oSrcVal = 0;
size_t j = i;
for (; j < nSrcSize; j++)
{
CVLong<DWORD> oTemp = oSrcVal*oKoef + (CVLong<DWORD>)pSrcBuffer[j];
if (oTemp>=m_oMod)
break;
oSrcVal = oTemp;
}
CVLong<DWORD> oDstVal = Decrypt(oSrcVal);
i = j;
size_t nDstValSize = oDstVal.GetByteRealDataSize();
if (nDstBufferCursor + nDstValSize>nDstBufferSize)
{
LPBYTE pDstBufferOld = pDstBuffer;
pDstBuffer = new BYTE[nDstBufferSize + g_cnBufferGrow];
if (NULL==pDstBuffer)
{
delete [] pDstBufferOld;
return FALSE;
}
memcpy(pDstBuffer, pDstBufferOld, nDstBufferSize);
delete [] pDstBufferOld;
nDstBufferSize += g_cnBufferGrow;
pDstBufferPtr += nDstBufferCursor;
}
oDstVal.ToBuffer(pDstBufferPtr);
pDstBufferPtr += nDstValSize;
nDstBufferCursor += nDstValSize;
}
nDstSize = nDstBufferCursor;
return TRUE;
}
LPSTR Decrypt(LPCSTR pszBase64)
{
int nBase64StrLen = (int)strlen(pszBase64);
int nEncSize;
nEncSize = Base64DecodeGetRequiredLength(nBase64StrLen);
LPBYTE pEncBuffer = new BYTE[nEncSize];
if (NULL==pEncBuffer)
return "";
if (!Base64Decode(pszBase64, nBase64StrLen, pEncBuffer, &nEncSize))
{
delete []pEncBuffer;
return "";
}
LPBYTE pDecBuffer = NULL;
size_t nDecSize = 0;
if (!Decrypt(pEncBuffer, nEncSize, pDecBuffer, nDecSize))
{
delete []pEncBuffer;
return "";
}
LPSTR pStr = new char[nDecSize+1];
memcpy((LPBYTE)pStr, pDecBuffer, nDecSize);
pStr[nDecSize] = '\0';
delete [] pEncBuffer;
delete [] pDecBuffer;
return pStr;
}
};
};

829
ActiveX/Common/RSA/VLong.h Normal file
View File

@@ -0,0 +1,829 @@
/*
* (c) Copyright Ascensio System SIA 2010-2014
*
* This program is a free software product. You can redistribute it and/or
* modify it under the terms of the GNU Affero General Public License (AGPL)
* version 3 as published by the Free Software Foundation. In accordance with
* Section 7(a) of the GNU AGPL its Section 15 shall be amended to the effect
* that Ascensio System SIA expressly excludes the warranty of non-infringement
* of any third-party rights.
*
* This program is distributed WITHOUT ANY WARRANTY; without even the implied
* warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. For
* details, see the GNU AGPL at: http://www.gnu.org/licenses/agpl-3.0.html
*
* You can contact Ascensio System SIA at Lubanas st. 125a-25, Riga, Latvia,
* EU, LV-1021.
*
* The interactive user interfaces in modified source and object code versions
* of the Program must display Appropriate Legal Notices, as required under
* Section 5 of the GNU AGPL version 3.
*
* Pursuant to Section 7(b) of the License you must retain the original Product
* logo when distributing the program. Pursuant to Section 7(e) we decline to
* grant you any rights under trademark law for use of our trademarks.
*
* All the Product's GUI elements, including illustrations and icon sets, as
* well as technical writing content are licensed under the terms of the
* Creative Commons Attribution-ShareAlike 4.0 International. See the License
* terms at http://creativecommons.org/licenses/by-sa/4.0/legalcode
*
*/
#pragma once
#ifdef __BORLANDC__
#include "AVSBase64Codec.h"
using namespace AVSUTILS;
#else
#include <atlenc.h>
#endif
namespace VLong
{
class CReferenceObject
{
protected:
long m_lCounter;
virtual ~CReferenceObject()
{
}
public:
CReferenceObject()
: m_lCounter(1)
{
}
void AddRef()
{
m_lCounter++;
}
void Release()
{
m_lCounter--;
if (0==m_lCounter)
delete this;
}
long GetCounter() const
{
return m_lCounter;
}
};
template< typename TUnit >
class CFlexUnit
{
protected:
TUnit* m_pData;
size_t m_nDataSize;
size_t m_nUsedSize;
public:
CFlexUnit()
: m_pData(NULL)
, m_nDataSize(0)
, m_nUsedSize(0)
{
}
virtual ~CFlexUnit()
{
if (NULL!=m_pData)
delete []m_pData;
}
inline void Clear()
{
m_nUsedSize = 0;
}
inline void Reserve(size_t nNewSize)
{
if (nNewSize>m_nDataSize)
{
TUnit* pNewData = new TUnit[nNewSize];
if (NULL==pNewData)
{
ATLASSERT(FALSE);
return;
}
memset(pNewData, 0, nNewSize*sizeof(TUnit));
if (NULL!=m_pData)
{
memcpy(pNewData, m_pData, m_nUsedSize*sizeof(TUnit));
delete [] m_pData;
}
m_pData = pNewData;
m_nDataSize = nNewSize;
}
}
inline size_t GetUsedSize() const
{
return m_nUsedSize;
}
inline const TUnit *GetData() const
{
return m_pData;
}
inline TUnit Get(size_t nIndex) const
{
if (nIndex>=m_nUsedSize)
return 0;
return m_pData[nIndex];
}
inline void Set(size_t nIndex, TUnit nVal)
{
if (nIndex < m_nUsedSize)
{
m_pData[nIndex] = nVal;
if (0==nVal)
{
while ((0!=m_nUsedSize) && (0==m_pData[m_nUsedSize-1]))
m_nUsedSize--;
}
}
else if (0!=nVal)
{
Reserve(nIndex+1);
if (nIndex>m_nUsedSize)
memset(m_pData + m_nUsedSize*sizeof(TUnit), 0, (nIndex - m_nUsedSize) * sizeof(TUnit));
m_pData[nIndex] = nVal;
m_nUsedSize = nIndex + 1;
}
}
inline void Pack()
{
TUnit* pDataPtr = m_pData + m_nUsedSize - 1;
while ((m_nUsedSize>0)&&(0==(*pDataPtr)))
{
m_nUsedSize--;
pDataPtr--;
}
}
#define BIT_PER_UNIT (8*sizeof(TUnit))
#define Lo(x) ((x) & ((1<<(BIT_PER_UNIT/2))-1))
#define Hi(x) ((x) >> (BIT_PER_UNIT/2))
#define LH(x) ((x) << (BIT_PER_UNIT/2))
inline void MulFast(const CFlexUnit<TUnit> &nVal1, const CFlexUnit<TUnit> &nVal2, size_t nLimitBit)
{
size_t nLimit = (nLimitBit + BIT_PER_UNIT - 1)/BIT_PER_UNIT;
Reserve(nLimit);
memset(m_pData, 0, nLimit*sizeof(TUnit));
size_t nValSize1 = min(nVal1.GetUsedSize(), nLimit);
for (size_t i=0; i<nValSize1; i++)
{
TUnit m = nVal1.m_pData[i];
TUnit c = 0;
size_t nValSize2 = min(i + nVal2.GetUsedSize(), nLimit);
size_t j=i;
for (;j<nValSize2; j++)
{
TUnit w;
TUnit v = m_pData[j];
TUnit p = nVal2.m_pData[j-i];
v += c;
c = ((v < c) ? 1 : 0);
w = Lo(p)*Lo(m); v += w; c += ( v < w );
w = Lo(p)*Hi(m); c += Hi(w); w = LH(w); v += w; c += ( v < w );
w = Hi(p)*Lo(m); c += Hi(w); w = LH(w); v += w; c += ( v < w );
c += Hi(p) * Hi(m);
m_pData[j] = v;
}
while ((0!=c) && (j<nLimit))
{
m_pData[j] += c;
c = ((m_pData[j] < c) ? 1 : 0);
j++;
}
}
nLimitBit %= BIT_PER_UNIT;
if (0!=nLimitBit)
m_pData[nLimit-1] &= (1<<nLimitBit)-1;
m_nUsedSize = nLimit;
Pack();
}
};
template< typename TUnit >
class CVLongValue
: public CFlexUnit<TUnit>
, public CReferenceObject
{
protected:
virtual ~CVLongValue()
{
}
static BOOL BinaryToBase64(const BYTE* pData, size_t nSize, LPSTR pszResult)
{
if ((NULL==pData) || (0==nSize))
return FALSE;
int nStrSize = Base64EncodeGetRequiredLength((int)nSize);
BOOL bSuccess = Base64Encode(pData, (int)nSize, pszResult, &nStrSize);
pszResult[nStrSize] = '\0';
return bSuccess;
}
public:
CVLongValue()
{
}
operator TUnit()
{
return Get(0);
}
inline BOOL IsZero() const
{
return (0==m_nUsedSize);
}
BOOL IsBitZero(size_t nIndex) const
{
return (0!=(Get(nIndex/BIT_PER_UNIT) & (1<<(nIndex % BIT_PER_UNIT))));
}
size_t GetBitsCount() const
{
size_t nCount = m_nUsedSize*BIT_PER_UNIT;
while ((0!=nCount) && (0==IsBitZero(nCount - 1)))
nCount--;
return nCount;
}
long Compare(const CVLongValue& oVal) const
{
if (m_nUsedSize > oVal.m_nUsedSize)
return +1;
if (m_nUsedSize < oVal.m_nUsedSize)
return -1;
TUnit* ptrValData = oVal.m_pData + m_nUsedSize - 1;
TUnit* ptrThisData = m_pData + m_nUsedSize - 1;
for (size_t i = m_nUsedSize; i>0; --i, ptrValData--, ptrThisData--)
{
if ((*ptrThisData) > (*ptrValData))
return +1;
if ((*ptrThisData) < (*ptrValData))
return -1;
}
return 0;
}
void SHL()
{
TUnit nCarry = 0;
size_t nOldUsedSize = m_nUsedSize;
for (size_t i = 0; i<=nOldUsedSize; i++)
{
TUnit nTemp = Get(i);
Set(i,(nTemp<<1) + nCarry);
nCarry = nTemp>>(BIT_PER_UNIT-1);
}
}
void SHR()
{
TUnit nCarry = 0;
for (long i = (long)m_nUsedSize-1; i>=0; i--)
{
TUnit nTemp = Get(i);
Set(i, (nTemp>>1) + nCarry);
nCarry = nTemp<<(BIT_PER_UNIT - 1);
}
}
void SHR(size_t nCount)
{
size_t nDelta = nCount/BIT_PER_UNIT;
nCount %= BIT_PER_UNIT;
size_t nOldUsedSize = m_nUsedSize;
for (size_t i=0; i<nOldUsedSize; i++)
{
TUnit oVal = Get(i + nDelta);
if (0!=nCount)
{
oVal >>= nCount;
oVal += Get(i + nDelta + 1) << (BIT_PER_UNIT - nCount);
}
Set(i, oVal);
}
}
void Add(const CVLongValue& oVal)
{
TUnit oCarry = 0;
size_t nSize = max(m_nUsedSize, oVal.m_nUsedSize);
Reserve(nSize);
for (size_t i=0; i < nSize + 1; i++)
{
TUnit oThisUnit = Get(i);
oThisUnit += oCarry;
oCarry = ((oThisUnit < oCarry) ? 1 : 0);
TUnit oValUnit = oVal.Get(i);
oThisUnit += oValUnit;
oCarry += ((oThisUnit < oValUnit) ? 1 : 0);
Set(i,oThisUnit);
}
}
void Sub(const CVLongValue& oVal)
{
TUnit oCarry = 0;
size_t nOldUsedSize = m_nUsedSize;
for (size_t i=0; i<nOldUsedSize; i++)
{
TUnit oValUnit = oVal.Get(i);
oValUnit += oCarry;
if (oValUnit >= oCarry)
{
TUnit oThisUnit = Get(i);
TUnit oTemp = oThisUnit - oValUnit;
oCarry = ((oTemp > oThisUnit) ? 1 : 0);
Set(i, oTemp);
}
}
}
void Init(TUnit oVal)
{
Clear();
Set(0, oVal);
}
void CopyFrom(const CVLongValue& oVal)
{
Clear();
if (0==oVal.m_nUsedSize)
return;
Reserve(oVal.m_nUsedSize);
memcpy(m_pData, oVal.m_pData, oVal.m_nUsedSize*sizeof(TUnit));
m_nUsedSize = oVal.m_nUsedSize;
Pack();
}
void Mul(const CVLongValue& oVal1, const CVLongValue& oVal2)
{
MulFast(oVal1, oVal2, oVal1.GetBitsCount() + oVal2.GetBitsCount());
}
void Div(const CVLongValue& oVal1, const CVLongValue& oVal2, CVLongValue& oRem)
{
Init(0);
oRem.CopyFrom(oVal1);
CVLongValue oTemp1;
oTemp1.CopyFrom(oVal2);
CVLongValue oTemp2;
oTemp2.Init(1);
while (oRem.Compare(oTemp1)>0)
{
oTemp1.SHL();
oTemp2.SHL();
}
while (oRem.Compare(oVal2) >= 0)
{
while (oRem.Compare(oTemp1) < 0)
{
oTemp1.SHR();
oTemp2.SHR();
}
oRem.Sub(oTemp1);
Add(oTemp2);
}
}
inline LPSTR ExportToBase64()
{
int nSize = (int)m_nUsedSize*sizeof(TUnit);
int nStrSize = Base64EncodeGetRequiredLength((int)nSize);
LPSTR pszRet = new char[nStrSize + 1];
BinaryToBase64((LPBYTE)m_pData, nSize, pszRet);
pszRet[nStrSize] = '\0';
return pszRet;
}
inline BOOL ImportFromBase64(LPCSTR pszBase64)
{
Clear();
int nBase64Length = (int)strlen(pszBase64);
int nDataSize = Base64DecodeGetRequiredLength(nBase64Length);
int nUsedSize = nDataSize/sizeof(TUnit) + ((0!=(nDataSize%sizeof(TUnit)))?1:0);
Reserve(nUsedSize);
if (!Base64Decode(pszBase64, nBase64Length, (LPBYTE)m_pData, &nDataSize))
return FALSE;
m_nUsedSize = nDataSize/sizeof(TUnit) + ((0!=(nDataSize%sizeof(TUnit)))?1:0);
return TRUE;
}
};
template< typename TUnit>
class CMontgomery;
template< typename TUnit>
class CVLong
{
friend class CMontgomery<TUnit>;
private:
CVLongValue<TUnit> *m_pValue;
BOOL m_bNegative;
long Compare(const CVLong &oVLong) const
{
BOOL bZero = ((NULL==m_pValue)||(m_pValue->IsZero()));
if (IsZero())
{
if (oVLong.IsZero())
return 0;
else if (oVLong.m_bNegative)
return +1;
else
return -1;
}
else if (m_bNegative)
{
if (oVLong.IsZero())
return -1;
else if (oVLong.m_bNegative)
return (-(m_pValue->Compare(*(oVLong.m_pValue))));
else
return -1;
}
else
{
if (oVLong.IsZero())
return +1;
else if (oVLong.m_bNegative)
return +1;
else
return (m_pValue->Compare(*(oVLong.m_pValue)));
}
}
void DoCopy()
{
if ((NULL!=m_pValue)&&(1<m_pValue->GetCounter()))
{
CVLongValue<TUnit> *pValue = new CVLongValue<TUnit>();
pValue->CopyFrom(*m_pValue);
m_pValue->Release();
m_pValue = pValue;
}
}
inline BOOL IsZero() const
{
return ((NULL==m_pValue)||(m_pValue->IsZero()));
}
public:
CVLong(TUnit oVal = 0)
: m_bNegative(FALSE)
{
m_pValue = new CVLongValue<TUnit>;
if (NULL!=m_pValue)
m_pValue->Init(oVal);
}
CVLong(const CVLong<TUnit> &cvlVal)
: m_bNegative(cvlVal.m_bNegative)
, m_pValue(cvlVal.m_pValue)
{
if (NULL!=m_pValue)
m_pValue->AddRef();
}
virtual ~CVLong()
{
if (NULL!=m_pValue)
m_pValue->Release();
}
operator TUnit()
{
if (NULL==m_pValue)
return 0;
return *m_pValue;
}
CVLong& operator =(const CVLong& oVal)
{
if (NULL!=m_pValue)
m_pValue->Release();
m_pValue = oVal.m_pValue;
if (NULL!=m_pValue)
m_pValue->AddRef();
m_bNegative = oVal.m_bNegative;
return *this;
}
friend CVLong operator +(const CVLong& oVLong1, const CVLong& oVLong2)
{
CVLong oRes = oVLong1;
oRes += oVLong2;
return oRes;
}
friend CVLong operator -(const CVLong& oVLong1, const CVLong& oVLong2)
{
CVLong oRes = oVLong1;
oRes -= oVLong2;
return oRes;
}
friend CVLong operator *(const CVLong& oVLong1, const CVLong& oVLong2)
{
if ((NULL==oVLong1.m_pValue)||(NULL==oVLong2.m_pValue))
return CVLong(0);
CVLong oRes;
oRes.m_pValue->Mul(*oVLong1.m_pValue, *oVLong2.m_pValue);
oRes.m_bNegative =
(((oVLong1.m_bNegative) && (!oVLong2.m_bNegative)) ||
((!oVLong1.m_bNegative) && (oVLong2.m_bNegative)));
return oRes;
}
friend CVLong operator /(const CVLong& oVLong1, const CVLong& oVLong2)
{
if (NULL==oVLong1.m_pValue)
return CVLong(0);
if (NULL==oVLong1.m_pValue)
{
ATLASSERT(FALSE);
return CVLong(0);
}
CVLong oRes;
CVLongValue<TUnit> *pRemValue = new CVLongValue<TUnit>;
oRes.m_pValue->Div(*oVLong1.m_pValue, *oVLong2.m_pValue, *pRemValue);
pRemValue->Release();
oRes.m_bNegative =
(((oVLong1.m_bNegative) && (!oVLong2.m_bNegative)) ||
((!oVLong1.m_bNegative)&& (oVLong2.m_bNegative)));
return oRes;
}
friend CVLong operator %(const CVLong& oVLong1, const CVLong& oVLong2)
{
if (NULL==oVLong1.m_pValue)
return CVLong(0);
if (NULL==oVLong1.m_pValue)
{
ATLASSERT(FALSE);
return CVLong(0);
}
CVLong oTemp;
CVLong oRem;
oTemp.m_pValue->Div(*oVLong1.m_pValue, *oVLong2.m_pValue, *oRem.m_pValue);
oRem.m_bNegative = oVLong2.m_bNegative;
return oRem;
}
CVLong& operator += (const CVLong& oVLong)
{
if (oVLong.IsZero())
return *this;
if (NULL==m_pValue)
{
m_pValue = oVLong.m_pValue;
if (NULL!=m_pValue)
m_pValue->AddRef();
m_bNegative = oVLong.m_bNegative;
return *this;
}
if (((m_bNegative) && (oVLong.m_bNegative))||
((!m_bNegative) && (!oVLong.m_bNegative)))
{
DoCopy();
m_pValue->Add(*oVLong.m_pValue);
}
else if (m_pValue->Compare(*oVLong.m_pValue) >= 0 )
{
DoCopy();
m_pValue->Sub(*oVLong.m_pValue);
}
else
{
CVLong oTemp = *this;
*this = oVLong;
*this += oTemp;
}
return *this;
}
CVLong& operator -=(const CVLong& oVLong)
{
if (oVLong.IsZero())
return *this;
if (NULL==m_pValue)
{
m_pValue = oVLong.m_pValue;
if (NULL!=m_pValue)
m_pValue->AddRef();
m_bNegative = (!oVLong.m_bNegative);
return *this;
}
if (((m_bNegative) && (!oVLong.m_bNegative))||
((!m_bNegative) && (oVLong.m_bNegative)))
{
DoCopy();
m_pValue->Add(*oVLong.m_pValue);
}
else if (m_pValue->Compare(*oVLong.m_pValue) >= 0 )
{
DoCopy();
m_pValue->Sub(*oVLong.m_pValue);
}
else
{
CVLong oTemp = *this;
*this = oVLong;
*this -= oTemp;
m_bNegative = (!m_bNegative);
}
return *this;
}
friend inline int operator !=(const CVLong& oVLong1, const CVLong& oVLong2)
{
return (0 != oVLong1.Compare(oVLong2));
}
friend inline int operator ==(const CVLong& oVLong1, const CVLong& oVLong2)
{
return (0 == oVLong1.Compare(oVLong2));
}
friend inline int operator >=(const CVLong& oVLong1, const CVLong& oVLong2)
{
return (0 <= oVLong1.Compare(oVLong2));
}
friend inline int operator <=(const CVLong& oVLong1, const CVLong& oVLong2)
{
return (0 >= oVLong1.Compare(oVLong2));
}
friend inline int operator > (const CVLong& oVLong1, const CVLong& oVLong2)
{
return (0 < oVLong1.Compare(oVLong2));
}
friend inline int operator < (const CVLong& oVLong1, const CVLong& oVLong2)
{
return (0 > oVLong1.Compare(oVLong2));
}
inline LPSTR ExportToBase64()
{
if (NULL==m_pValue)
return "";
return m_pValue->ExportToBase64();
}
inline BOOL ImportFromBase64(LPCSTR pszBase64)
{
if (NULL!=m_pValue)
m_pValue->Release();
m_pValue = new CVLongValue<TUnit>;
if (NULL==m_pValue)
return FALSE;
return m_pValue->ImportFromBase64(pszBase64);
}
inline size_t ToBuffer(LPBYTE pBuffer)
{
size_t nRet = GetByteRealDataSize();
LPBYTE pBufferPtr = pBuffer;
LPBYTE pDataPtr = (LPBYTE)m_pValue->GetData() + nRet - 1;
for (size_t i = 0; i<nRet; i++, pBufferPtr++, pDataPtr--)
{
*pBufferPtr = *pDataPtr;
}
return nRet;
}
inline size_t GetByteRealDataSize()
{
size_t nRet = m_pValue->GetUsedSize()*sizeof(TUnit);
LPBYTE pDataPtr = (LPBYTE)m_pValue->GetData() + nRet - 1;
for (;(nRet>0)&&(0==(*pDataPtr)); nRet--, pDataPtr--)
;
return nRet;
}
static CVLong GCD(const CVLong& oVLong1, const CVLong& oVLong2)
{
CVLong oTemp1 = oVLong1;
CVLong oTemp2 = oVLong2;
while (TRUE)
{
if ((CVLong)0==oTemp2)
return oTemp1;
oTemp1 = oTemp1 % oTemp2;
if ((CVLong)0==oTemp1)
return oTemp2;
oTemp2 = oTemp2 % oTemp1;
}
}
static CVLong ModInv(const CVLong& oVLong, const CVLong& oMod)
{
CVLong j=1;
CVLong i=0;
CVLong b=oMod;
CVLong c=oVLong;
CVLong x,y;
while (c!=(CVLong)0)
{
x = b / c;
y = b - x*c;
b = c;
c = y;
y = j;
j = i - j*x;
i = y;
}
if ( i < (CVLong)0 )
i += oMod;
return i;
}
static CVLong FromBuffer(LPBYTE pBuffer, size_t nSize)
{
const CVLong coKoeff = 256;
CVLong oRes = 0;
LPBYTE pBufferPtr = pBuffer;
for (size_t i=0; i<nSize; i++, pBufferPtr++)
{
oRes = oRes * coKoeff + (CVLong)(*pBufferPtr);
}
return oRes;
}
};
template< typename TUnit >
class CMontgomery
{
CVLong<TUnit> m_oR, m_oR1, m_oM, m_oN1;
CVLong<TUnit> m_oT, m_oK;
size_t m_nRBitsCount;
void Mul(CVLong<TUnit> &oVLong1, const CVLong<TUnit> &oVLong2)
{
m_oT.m_pValue->MulFast(*oVLong1.m_pValue, *oVLong2.m_pValue, m_nRBitsCount*2);
m_oK.m_pValue->MulFast(*m_oT.m_pValue, *m_oN1.m_pValue, m_nRBitsCount);
oVLong1.m_pValue->MulFast(*m_oK.m_pValue, *m_oM.m_pValue, m_nRBitsCount*2);
oVLong1 += m_oT;
oVLong1.m_pValue->SHR(m_nRBitsCount);
if (oVLong1>=m_oM)
oVLong1 -= m_oM;
}
public:
CMontgomery(const CVLong<TUnit> &oVal)
{
m_oM = oVal;
m_nRBitsCount = 0;
m_oR = 1;
while (m_oR < m_oM)
{
m_oR += m_oR;
m_nRBitsCount++;
}
m_oR1 = CVLong<TUnit>::ModInv(m_oR - m_oM, m_oM);
m_oN1 = m_oR - CVLong<TUnit>::ModInv(m_oM, m_oR);
}
CVLong<TUnit> Exp( const CVLong<TUnit> &oVal, const CVLong<TUnit> &oExp)
{
CVLong<TUnit> oRes = m_oR - m_oM;
CVLong<TUnit> oTemp = (oVal * m_oR) % m_oM;
size_t nBitsCount = oExp.m_pValue->GetBitsCount();
size_t i = 0;
while (TRUE)
{
if (oExp.m_pValue->IsBitZero(i))
Mul(oRes, oTemp);
i++;
if (i==nBitsCount)
break;
Mul(oTemp, oTemp);
}
oRes = (oRes * m_oR1) % m_oM;
return oRes;
}
static CVLong<TUnit> ModExp(const CVLong<TUnit> &oVLong, const CVLong<TUnit> &oExp, const CVLong<TUnit> &oMod)
{
CMontgomery oTemp(oMod);
return oTemp.Exp(oVLong, oExp);
}
};
};

254
ActiveX/Common/RSA/XMLDecoder.h Normal file
View File

@@ -0,0 +1,254 @@
/*
* (c) Copyright Ascensio System SIA 2010-2014
*
* This program is a free software product. You can redistribute it and/or
* modify it under the terms of the GNU Affero General Public License (AGPL)
* version 3 as published by the Free Software Foundation. In accordance with
* Section 7(a) of the GNU AGPL its Section 15 shall be amended to the effect
* that Ascensio System SIA expressly excludes the warranty of non-infringement
* of any third-party rights.
*
* This program is distributed WITHOUT ANY WARRANTY; without even the implied
* warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. For
* details, see the GNU AGPL at: http://www.gnu.org/licenses/agpl-3.0.html
*
* You can contact Ascensio System SIA at Lubanas st. 125a-25, Riga, Latvia,
* EU, LV-1021.
*
* The interactive user interfaces in modified source and object code versions
* of the Program must display Appropriate Legal Notices, as required under
* Section 5 of the GNU AGPL version 3.
*
* Pursuant to Section 7(b) of the License you must retain the original Product
* logo when distributing the program. Pursuant to Section 7(e) we decline to
* grant you any rights under trademark law for use of our trademarks.
*
* All the Product's GUI elements, including illustrations and icon sets, as
* well as technical writing content are licensed under the terms of the
* Creative Commons Attribution-ShareAlike 4.0 International. See the License
* terms at http://creativecommons.org/licenses/by-sa/4.0/legalcode
*
*/
#pragma once
#include "Includer.h"
class CXMLDecoder
{
public:
CXMLDecoder()
: m_pBlowfishKey(NULL)
, m_nBlowfishKeySize(0)
{
m_oRSADecryptor.ImportPrivateKey(g_csPrivateKey);
}
virtual ~CXMLDecoder()
{
if (NULL!=m_pBlowfishKey)
delete []m_pBlowfishKey;
}
BOOL SetBlowfishKey(IUnknown *punkKeyData)
{
RELEASEARRAYOBJECTS(m_pBlowfishKey);
if (NULL != punkKeyData)
{
MediaCore::IAVSMediaData *pMediaData = NULL;
punkKeyData->QueryInterface(MediaCore::IID_IAVSMediaData, (void**)&pMediaData);
if (NULL!=pMediaData)
{
LPBYTE pBuffer = NULL;
pMediaData->get_Buffer(&pBuffer);
long lDataSize = 0;
pMediaData->get_DataSize(&lDataSize);
if ((NULL != pBuffer) && (0 != lDataSize))
{
m_pBlowfishKey = NULL;
m_nBlowfishKeySize = 0;
m_oRSADecryptor.Decrypt(pBuffer, lDataSize, m_pBlowfishKey, m_nBlowfishKeySize);
}
pMediaData->Release();
}
}
return TRUE;
}
void DecryptXML(BYTE **ppData, DWORD *pdwDataLen)
{
if (NULL == m_pBlowfishKey)
return;
m_oBlowfish.Init(m_pBlowfishKey, (DWORD)m_nBlowfishKeySize);
LPBYTE pszBase64 = (LPBYTE)*ppData;
int nBase64Length = (int)*pdwDataLen;
LPBYTE pDecBuffer = NULL;
int nDecSize = 0;
if (!Decrypt(pszBase64, nBase64Length, pDecBuffer, nDecSize))
return;
delete []*ppData;
*ppData = (BYTE*)pDecBuffer;
*pdwDataLen = (DWORD)nDecSize;
return;
}
CString DecryptXML(BSTR bstrXML)
{
if (NULL == m_pBlowfishKey)
return CString(bstrXML);
m_oBlowfish.Init(m_pBlowfishKey, (DWORD)m_nBlowfishKeySize);
CStringA sXML = (CStringA)bstrXML;
LPBYTE pszBase64 = (LPBYTE)sXML.GetBuffer();
int nBase64Length = (int)sXML.GetLength();
LPBYTE pDecBuffer = NULL;
int nEncSize = 0;
if (!Decrypt(pszBase64, nBase64Length, pDecBuffer, nEncSize))
{
return _T("");
}
CString strRet = GetUnicodeString(pDecBuffer, nEncSize);
delete []pDecBuffer;
return strRet;
}
CStringW DecryptXMLW(BSTR bstrXML)
{
if (NULL == m_pBlowfishKey)
return CStringW(bstrXML);
return _DecryptXMLW((CStringA)bstrXML);
}
protected:
CStringW _DecryptXMLW(CStringA &sXML)
{
if (NULL == m_pBlowfishKey)
return _T("");
m_oBlowfish.Init(m_pBlowfishKey, (DWORD)m_nBlowfishKeySize);
LPBYTE pszBase64 = (LPBYTE)sXML.GetBuffer();
int nBase64Length = (int)sXML.GetLength();
LPBYTE pDecBuffer = NULL;
int nEncSize = 0;
if (!Decrypt(pszBase64, nBase64Length, pDecBuffer, nEncSize))
{
return _T("");
}
CStringW strRet((WCHAR*)pDecBuffer, nEncSize / sizeof(WCHAR));
delete []pDecBuffer;
return strRet;
}
CString _DecryptXML(CStringA &sXML)
{
if (NULL == m_pBlowfishKey)
return _T("");
m_oBlowfish.Init(m_pBlowfishKey, (DWORD)m_nBlowfishKeySize);
LPBYTE pszBase64 = (LPBYTE)sXML.GetBuffer();
int nBase64Length = (int)sXML.GetLength();
LPBYTE pDecBuffer = NULL;
int nEncSize = 0;
if (!Decrypt(pszBase64, nBase64Length, pDecBuffer, nEncSize))
{
return _T("");
}
CString strRet((TCHAR*)pDecBuffer, nEncSize / sizeof(TCHAR));
delete []pDecBuffer;
return strRet;
}
protected:
RSA::CRSADecryptor m_oRSADecryptor;
LPBYTE m_pBlowfishKey;
size_t m_nBlowfishKeySize;
CBlowfish m_oBlowfish;
protected:
BOOL Decrypt(BYTE* pszBase64, int nBase64Length, BYTE*& pDecBuffer, int& nEncSize)
{
pDecBuffer = NULL;
nEncSize = 0;
Base64Decode((LPCSTR)pszBase64, nBase64Length, NULL, &nEncSize);
LPBYTE pEncBuffer = new BYTE[nEncSize];
if (NULL == pEncBuffer)
return FALSE;
if (!Base64Decode((LPCSTR)pszBase64, nBase64Length, pEncBuffer, &nEncSize))
{
delete []pEncBuffer;
return FALSE;
}
pDecBuffer = new BYTE[nEncSize + 1];
if (NULL == pDecBuffer)
{
delete []pEncBuffer;
return FALSE;
}
m_oBlowfish.Decrypt(pEncBuffer, (LPBYTE)pDecBuffer, nEncSize);
pDecBuffer[nEncSize] = '\0';
delete [] pEncBuffer;
return TRUE;
}
CString GetUnicodeString(BYTE* pBuffer, int nSize)
{
CStringA strFind(pBuffer);
int nStart = strFind.Find("<?xml");
int nEnd = strFind.Find("?>");
if ((-1 == nStart) || (-1 == nEnd))
{
CString strRet((TCHAR*)pBuffer, nSize / sizeof(TCHAR));
return strRet;
}
CString sXMLNode = (CString)strFind.Mid (nStart, nEnd - nStart + 2);
sXMLNode.MakeLower();
CHAR* pSrc = (CHAR*)(pBuffer + nEnd + 2);
BOOL bIsUTF8 = (-1 != sXMLNode.Find(_T("utf-8")));
if (bIsUTF8)
{
int nSize = MultiByteToWideChar(CP_UTF8, 0, pSrc, -1, NULL, 0);
CStringW strW;
MultiByteToWideChar(CP_UTF8, 0, pSrc, -1, strW.GetBuffer(nSize + 1), nSize);
strW.ReleaseBuffer();
return strW;
}
CString strRet((TCHAR)pBuffer, nSize / sizeof(TCHAR));
return strRet;
}
};

266
ActiveX/Common/RSA/XMLEncoder.h Normal file
View File

@@ -0,0 +1,266 @@
/*
* (c) Copyright Ascensio System SIA 2010-2014
*
* This program is a free software product. You can redistribute it and/or
* modify it under the terms of the GNU Affero General Public License (AGPL)
* version 3 as published by the Free Software Foundation. In accordance with
* Section 7(a) of the GNU AGPL its Section 15 shall be amended to the effect
* that Ascensio System SIA expressly excludes the warranty of non-infringement
* of any third-party rights.
*
* This program is distributed WITHOUT ANY WARRANTY; without even the implied
* warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. For
* details, see the GNU AGPL at: http://www.gnu.org/licenses/agpl-3.0.html
*
* You can contact Ascensio System SIA at Lubanas st. 125a-25, Riga, Latvia,
* EU, LV-1021.
*
* The interactive user interfaces in modified source and object code versions
* of the Program must display Appropriate Legal Notices, as required under
* Section 5 of the GNU AGPL version 3.
*
* Pursuant to Section 7(b) of the License you must retain the original Product
* logo when distributing the program. Pursuant to Section 7(e) we decline to
* grant you any rights under trademark law for use of our trademarks.
*
* All the Product's GUI elements, including illustrations and icon sets, as
* well as technical writing content are licensed under the terms of the
* Creative Commons Attribution-ShareAlike 4.0 International. See the License
* terms at http://creativecommons.org/licenses/by-sa/4.0/legalcode
*
*/
#pragma once
#include "Includer.h"
class CXMLEncoder
{
public:
CXMLEncoder()
: m_pBlowfishKey(NULL)
, m_nBlowfishKeySize(g_cnBlowfishKeySize)
{
m_oRSAEncryptor.ImportPublicKey(g_csPublicKey);
NewBlowfishKey();
}
virtual ~CXMLEncoder()
{
RELEASEARRAYOBJECTS(m_pBlowfishKey);
}
void EncryptXML(BYTE** ppData, DWORD* pdwDataLen, BOOL bChangeBlowfishKey = FALSE)
{
if (bChangeBlowfishKey)
{
if (!NewBlowfishKey())
return;
}
m_oBlowfish.Init(m_pBlowfishKey, (DWORD)m_nBlowfishKeySize);
LPBYTE pSrc = (LPBYTE)*ppData;
DWORD dwInputLen = *pdwDataLen;
DWORD dwOutputLen = m_oBlowfish.GetOutputLength(dwInputLen);
LPBYTE pEncBuffer = new BYTE[dwOutputLen];
if (NULL == pEncBuffer)
return;
m_oBlowfish.Encrypt(pSrc, pEncBuffer, dwInputLen);
delete []*ppData;
int nBase64Size = Base64EncodeGetRequiredLength((int)dwOutputLen);
LPSTR pStrData = new char[nBase64Size + 1];
BOOL bSuccess = Base64Encode(pEncBuffer, (int)dwOutputLen, pStrData, &nBase64Size);
pStrData[nBase64Size] = '\0';
delete [] pEncBuffer;
*ppData = (BYTE*)pStrData;
*pdwDataLen = nBase64Size;
return;
}
#ifdef UNICODE
CStringA EncryptXML(CString strXml, BOOL bChangeBlowfishKey = FALSE)
{
if (bChangeBlowfishKey)
{
if (!NewBlowfishKey())
return "";
}
m_oBlowfish.Init(m_pBlowfishKey, (DWORD)m_nBlowfishKeySize);
LPBYTE pSrc = (LPBYTE)strXml.GetBuffer();
DWORD dwInputLen = strXml.GetLength() * sizeof(TCHAR);
DWORD dwOutputLen = m_oBlowfish.GetOutputLength(dwInputLen);
LPBYTE pEncBuffer = new BYTE[dwOutputLen];
if (NULL == pEncBuffer)
return "";
m_oBlowfish.Encrypt(pSrc, pEncBuffer, dwInputLen);
int nBase64Size = Base64EncodeGetRequiredLength((int)dwOutputLen);
LPSTR pStrData = new char[nBase64Size + 1];
BOOL bSuccess = Base64Encode(pEncBuffer, (int)dwOutputLen, pStrData, &nBase64Size);
pStrData[nBase64Size] = '\0';
delete [] pEncBuffer;
CStringA strA(pStrData, nBase64Size);
delete[] pStrData;
return strA;
}
#endif
CStringA EncryptXML(CStringA strXml, BOOL bChangeBlowfishKey = FALSE)
{
if (bChangeBlowfishKey)
{
if (!NewBlowfishKey())
return "";
}
m_oBlowfish.Init(m_pBlowfishKey, (DWORD)m_nBlowfishKeySize);
LPBYTE pSrc = (LPBYTE)strXml.GetBuffer();
DWORD dwInputLen = strXml.GetLength();
DWORD dwOutputLen = m_oBlowfish.GetOutputLength(dwInputLen);
LPBYTE pEncBuffer = new BYTE[dwOutputLen];
if (NULL == pEncBuffer)
return "";
m_oBlowfish.Encrypt(pSrc, pEncBuffer, dwInputLen);
int nBase64Size = Base64EncodeGetRequiredLength((int)dwOutputLen);
LPSTR pStrData = new char[nBase64Size + 1];
BOOL bSuccess = Base64Encode(pEncBuffer, (int)dwOutputLen, pStrData, &nBase64Size);
pStrData[nBase64Size] = '\0';
delete [] pEncBuffer;
CStringA strA(pStrData, nBase64Size);
delete[] pStrData;
return strA;
}
protected:
RSA::CRSAEncryptor m_oRSAEncryptor;
long m_lRSAKeyIndex;
LPBYTE m_pBlowfishKey;
size_t m_nBlowfishKeySize;
CBlowfish m_oBlowfish;
BOOL NewBlowfishKey()
{
if (NULL != m_pBlowfishKey)
delete []m_pBlowfishKey;
m_pBlowfishKey = new BYTE[g_cnBlowfishKeySize];
if (NULL == m_pBlowfishKey)
return FALSE;
srand(GetTickCount());
for (long i = 0; i < g_cnBlowfishKeySize; i++)
m_pBlowfishKey[i] = (rand() % 255) + 1;
return TRUE;
}
public:
template<typename T>
void ToInterface(T* pInterface)
{
SetKeyIndex(pInterface);
SendBlowfishKey(pInterface);
}
IUnknown* GetBlowfishKey()
{
LPBYTE pEncodedKey = NULL; size_t nEncodedKeySize = 0;
if (!m_oRSAEncryptor.Encrypt(m_pBlowfishKey, m_nBlowfishKeySize, pEncodedKey, nEncodedKeySize))
return NULL;
MediaCore::IAVSMediaData *pData = NULL;
CoCreateInstance(MediaCore::CLSID_CAVSMediaData, NULL, CLSCTX_ALL, MediaCore::IID_IAVSMediaData, (void**)&pData);
if (NULL == pData)
{
delete []pEncodedKey;
return NULL;
}
pData->AllocateBuffer((long)nEncodedKeySize);
LPBYTE pBuffer = NULL;
pData->get_Buffer(&pBuffer);
memcpy(pBuffer, pEncodedKey, nEncodedKeySize);
delete []pEncodedKey;
IUnknown* punkRes = NULL;
pData->QueryInterface(IID_IUnknown, (void**)&punkRes);
RELEASEINTERFACE(pData);
return punkRes;
}
protected:
template<typename T>
void SetKeyIndex(T* pData)
{
if (NULL == pData)
return;
VARIANT val;
val.vt = VT_I4;
val.lVal = m_lRSAKeyIndex;
BSTR bstrName = g_csKeyIndexParamName.AllocSysString();
pData->SetAdditionalParam(bstrName, val);
SysFreeString(bstrName);
}
template<typename T>
void SendBlowfishKey(T* pInterface)
{
if (NULL == pInterface)
return;
LPBYTE pEncodedKey = NULL; size_t nEncodedKeySize = 0;
if (!m_oRSAEncryptor.Encrypt(m_pBlowfishKey, m_nBlowfishKeySize, pEncodedKey, nEncodedKeySize))
return FALSE;
MediaCore::IAVSMediaData *pData = NULL;
CoCreateInstance(MediaCore::CLSID_CAVSMediaData, NULL, CLSCTX_ALL, MediaCore::IID_IAVSMediaData, (void**)&pData);
if (NULL == pData)
{
delete []pEncodedKey;
return;
}
pData->AllocateBuffer((long)nEncodedKeySize);
LPBYTE pBuffer = NULL;
pData->get_Buffer(&pBuffer);
memcpy(pBuffer, pEncodedKey, nEncodedKeySize);
delete []pEncodedKey;
VARIANT val;
val.vt = VT_UNKNOWN;
pData->QueryInterface(__uuidof(IUnknown), (void**)&val.punkVal);
RELEASEINTERFACE(pData);
BSTR bstrName = g_csBlowfishKeyParamName.AllocSysString();
pInterface->SetAdditionalParam(bstrName, val);
SysFreeString(bstrName);
RELEASEINTERFACE(val.punkVal);
return TRUE;
}
};