PageSourceSearch

https://www.ddpmod.gov.in/modules/custom/custom_admin_login/js/aes.js?v=1790759925

js ddpmod.gov.in collected 2026-10-02 17:27:24 UTC 8,187 bytes, 214 lines download raw bytes

vendor: 8,187 bytes, lines 1-214
1(function () {
2    // Shortcuts
3    var C = CryptoJS;
4    var C_lib = C.lib;
5    var BlockCipher = C_lib.BlockCipher;
6    var C_algo = C.algo;
7
8    // Lookup tables
9    var SBOX = [];
10    var INV_SBOX = [];
11    var SUB_MIX_0 = [];
12    var SUB_MIX_1 = [];
13    var SUB_MIX_2 = [];
14    var SUB_MIX_3 = [];
15    var INV_SUB_MIX_0 = [];
16    var INV_SUB_MIX_1 = [];
17    var INV_SUB_MIX_2 = [];
18    var INV_SUB_MIX_3 = [];
19
20    // Compute lookup tables
21    (function () {
22        // Compute double table
23        var d = [];
24        for (var i = 0; i < 256; i++) {
25            if (i < 128) {
26                d[i] = i << 1;
27            } else {
28                d[i] = (i << 1) ^ 0x11b;
29            }
30        }
31
32        // Walk GF(2^8)
33        var x = 0;
34        var xi = 0;
35        for (var i = 0; i < 256; i++) {
36            // Compute sbox
37            var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4);
38            sx = (sx >>> 8) ^ (sx & 0xff) ^ 0x63;
39            SBOX[x] = sx;
40            INV_SBOX[sx] = x;
41
42            // Compute multiplication
43            var x2 = d[x];
44            var x4 = d[x2];
45            var x8 = d[x4];
46
47            // Compute sub bytes, mix columns tables
48            var t = (d[sx] * 0x101) ^ (sx * 0x1010100);
49            SUB_MIX_0[x] = (t << 24) | (t >>> 8);
50            SUB_MIX_1[x] = (t << 16) | (t >>> 16);
51            SUB_MIX_2[x] = (t << 8)  | (t >>> 24);
52            SUB_MIX_3[x] = t;
53
54            // Compute inv sub bytes, inv mix columns tables
55            var t = (x8 * 0x1010101) ^ (x4 * 0x10001) ^ (x2 * 0x101) ^ (x * 0x1010100);
56            INV_SUB_MIX_0[sx] = (t << 24) | (t >>> 8);
57            INV_SUB_MIX_1[sx] = (t << 16) | (t >>> 16);
58            INV_SUB_MIX_2[sx] = (t << 8)  | (t >>> 24);
59            INV_SUB_MIX_3[sx] = t;
60
61            // Compute next counter
62            if (!x) {
63                x = xi = 1;
64            } else {
65                x = x2 ^ d[d[d[x8 ^ x2]]];
66                xi ^= d[d[xi]];
67            }
68        }
69    }());
70
71    // Precomputed Rcon lookup
72    var RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36];
73
74    /**
75     * AES block cipher algorithm.
76     */
77    var AES = C_algo.AES = BlockCipher.extend({
78        _doReset: function () {
79            var t;
80            
81            // Skip reset of nRounds has been set before and key did not change
82            if (this._nRounds && this._keyPriorReset === this._key) {
83                return;
84            }
85
86            // Shortcuts
87            var key = this._keyPriorReset = this._key;
88            var keyWords = key.words;
89            var keySize = key.sigBytes / 4;
90
91            // Compute number of rounds
92            var nRounds = this._nRounds = keySize + 6;
93
94            // Compute number of key schedule rows
95            var ksRows = (nRounds + 1) * 4;
96
97            // Compute key schedule
98            var keySchedule = this._keySchedule = [];
99            for (var ksRow = 0; ksRow < ksRows; ksRow++) {
100                if (ksRow < keySize) {
101                    keySchedule[ksRow] = keyWords[ksRow];
102                } else {
103                    t = keySchedule[ksRow - 1];
104
105                    if (!(ksRow % keySize)) {
106                        // Rot word
107                        t = (t << 8) | (t >>> 24);
108
109                        // Sub word
110                        t = (SBOX[t >>> 24] << 24) | (SBOX[(t >>> 16) & 0xff] << 16) | (SBOX[(t >>> 8) & 0xff] << 8) | SBOX[t & 0xff];
111
112                        // Mix Rcon
113                        t ^= RCON[(ksRow / keySize) | 0] << 24;
114                    } else if (keySize > 6 && ksRow % keySize == 4) {
115                        // Sub word
116                        t = (SBOX[t >>> 24] << 24) | (SBOX[(t >>> 16) & 0xff] << 16) | (SBOX[(t >>> 8) & 0xff] << 8) | SBOX[t & 0xff];
117                    }
118
119                    keySchedule[ksRow] = keySchedule[ksRow - keySize] ^ t;
120                }
121            }
122
123            // Compute inv key schedule
124            var invKeySchedule = this._invKeySchedule = [];
125            for (var invKsRow = 0; invKsRow < ksRows; invKsRow++) {
126                var ksRow = ksRows - invKsRow;
127
128                if (invKsRow % 4) {
129                    var t = keySchedule[ksRow];
130                } else {
131                    var t = keySchedule[ksRow - 4];
132                }
133
134                if (invKsRow < 4 || ksRow <= 4) {
135                    invKeySchedule[invKsRow] = t;
136                } else {
137                    invKeySchedule[invKsRow] = INV_SUB_MIX_0[SBOX[t >>> 24]] ^ INV_SUB_MIX_1[SBOX[(t >>> 16) & 0xff]] ^
138                                               INV_SUB_MIX_2[SBOX[(t >>> 8) & 0xff]] ^ INV_SUB_MIX_3[SBOX[t & 0xff]];
139                }
140            }
141        },
142
143        encryptBlock: function (M, offset) {
144            this._doCryptBlock(M, offset, this._keySchedule, SUB_MIX_0, SUB_MIX_1, SUB_MIX_2, SUB_MIX_3, SBOX);
145        },
146
147        decryptBlock: function (M, offset) {
148            // Swap 2nd and 4th rows
149            var t = M[offset + 1];
150            M[offset + 1] = M[offset + 3];
151            M[offset + 3] = t;
152
153            this._doCryptBlock(M, offset, this._invKeySchedule, INV_SUB_MIX_0, INV_SUB_MIX_1, INV_SUB_MIX_2, INV_SUB_MIX_3, INV_SBOX);
154
155            // Inv swap 2nd and 4th rows
156            var t = M[offset + 1];
157            M[offset + 1] = M[offset + 3];
158            M[offset + 3] = t;
159        },
160
161        _doCryptBlock: function (M, offset, keySchedule, SUB_MIX_0, SUB_MIX_1, SUB_MIX_2, SUB_MIX_3, SBOX) {
162            // Shortcut
163            var nRounds = this._nRounds;
164
165            // Get input, add round key
166            var s0 = M[offset]     ^ keySchedule[0];
167            var s1 = M[offset + 1] ^ keySchedule[1];
168            var s2 = M[offset + 2] ^ keySchedule[2];
169            var s3 = M[offset + 3] ^ keySchedule[3];
170
171            // Key schedule row counter
172            var ksRow = 4;
173
174            // Rounds
175            for (var round = 1; round < nRounds; round++) {
176                // Shift rows, sub bytes, mix columns, add round key
177                var t0 = SUB_MIX_0[s0 >>> 24] ^ SUB_MIX_1[(s1 >>> 16) & 0xff] ^ SUB_MIX_2[(s2 >>> 8) & 0xff] ^ SUB_MIX_3[s3 & 0xff] ^ keySchedule[ksRow++];
178                var t1 = SUB_MIX_0[s1 >>> 24] ^ SUB_MIX_1[(s2 >>> 16) & 0xff] ^ SUB_MIX_2[(s3 >>> 8) & 0xff] ^ SUB_MIX_3[s0 & 0xff] ^ keySchedule[ksRow++];
179                var t2 = SUB_MIX_0[s2 >>> 24] ^ SUB_MIX_1[(s3 >>> 16) & 0xff] ^ SUB_MIX_2[(s0 >>> 8) & 0xff] ^ SUB_MIX_3[s1 & 0xff] ^ keySchedule[ksRow++];
180                var t3 = SUB_MIX_0[s3 >>> 24] ^ SUB_MIX_1[(s0 >>> 16) & 0xff] ^ SUB_MIX_2[(s1 >>> 8) & 0xff] ^ SUB_MIX_3[s2 & 0xff] ^ keySchedule[ksRow++];
181
182                // Update state
183                s0 = t0;
184                s1 = t1;
185                s2 = t2;
186                s3 = t3;
187            }
188
189            // Shift rows, sub bytes, add round key
190            var t0 = ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 0xff] << 16) | (SBOX[(s2 >>> 8) & 0xff] << 8) | SBOX[s3 & 0xff]) ^ keySchedule[ksRow++];
191            var t1 = ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 0xff] << 16) | (SBOX[(s3 >>> 8) & 0xff] << 8) | SBOX[s0 & 0xff]) ^ keySchedule[ksRow++];
192            var t2 = ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 0xff] << 16) | (SBOX[(s0 >>> 8) & 0xff] << 8) | SBOX[s1 & 0xff]) ^ keySchedule[ksRow++];
193            var t3 = ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 0xff] << 16) | (SBOX[(s1 >>> 8) & 0xff] << 8) | SBOX[s2 & 0xff]) ^ keySchedule[ksRow++];
194
195            // Set output
196            M[offset]     = t0;
197            M[offset + 1] = t1;
198            M[offset + 2] = t2;
199            M[offset + 3] = t3;
200        },
201
202        keySize: 256/32
203    });
204
205    /**
206     * Shortcut functions to the cipher's object interface.
207     *
208     * @example
209     *
210     *     var ciphertext = CryptoJS.AES.encrypt(message, key, cfg);
211     *     var plaintext  = CryptoJS.AES.decrypt(ciphertext, key, cfg);
212     */
213    C.AES = BlockCipher._createHelper(AES);
214}());

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.