[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8},"actionData","errors","root",{"_11":-5},"routes/user.$name.replies",{"_9":10,"_11":12,"_13":14,"_15":16,"_17":18,"_19":16},"replies",[34],"user",{"_20":21,"_13":14,"_22":23,"_24":14,"_25":26,"_27":28,"_29":30,"_31":16,"_32":33},"loginname","betworld","page",1,"limit",50,"total","id","34365","avatar_url","https://avatars3.githubusercontent.com/u/40596647?v=4","githubUsername","create_at","2018-08-04 02:41:56.055","score",5,"topic_count",0,"reply_count","is_star",false,{"_20":35,"_36":37,"_38":39,"_40":41,"_42":43,"_44":45,"_46":47,"_48":33,"_31":49,"_50":51,"_25":52,"_53":54},"35311","author_id","20366","tab","share","content","以下是自己先前在研究密码学时使用 Node.js Crypto 模块和 OpenSSL 为范例做的笔记，和大家分享一下。\r\n\r\n[GitHub 文章连结](https://github.com/EasonWang01/Introduction-to-cryptography)\r\n\r\n#### 目錄\r\n* [相關密碼學介紹](https://github.com/EasonWang01/Introduction-to-cryptography/blob/master/0.%20%E7%9B%B8%E9%97%9C%E5%AF%86%E7%A2%BC%E5%AD%B8%E4%BB%8B%E7%B4%B9.md)\r\n* [有關雜湊](https://github.com/EasonWang01/Introduction-to-cryptography/blob/master/1.%20%E6%9C%89%E9%97%9C%E9%9B%9C%E6%B9%8A.md)\\\r\n 1.1 [Bcrypt、PBKDF2、Scrypt、Argon2](https://github.com/EasonWang01/Introduction-to-cryptography/blob/master/1.1%20Bcrypt%E3%80%81PBKDF2%E3%80%81Scrypt%E3%80%81Argon2.md)\\\r\n 1.2 [SHA](https://github.com/EasonWang01/Introduction-to-cryptography/blob/master/1.2%20SHA.md)\\\r\n 1.3 [RIPEMD](https://github.com/EasonWang01/Introduction-to-cryptography/blob/master/1.3%20RIPEMD.md)\r\n* [對稱式加密](https://github.com/EasonWang01/Introduction-to-cryptography/blob/master/2.%20%E5%B0%8D%E7%A8%B1%E5%BC%8F%E5%8A%A0%E5%AF%86.md)\\\r\n 2.1 [AES](https://github.com/EasonWang01/Introduction-to-cryptography/blob/master/2.1%20AES.md)\\\r\n 2.2 [Triple-DES](https://github.com/EasonWang01/Introduction-to-cryptography/blob/master/2.2%20Triple-DES.md)\\\r\n 2.3 [IDEA](https://github.com/EasonWang01/Introduction-to-cryptography/blob/master/2.3%20IDEA.md)\\\r\n 2.4 [BlowFIsh、TwoFish](https://github.com/EasonWang01/Introduction-to-cryptography/blob/master/2.4%20BlowFIsh%E3%80%81TwoFish.md)\\\r\n 2.5 [RC](https://github.com/EasonWang01/Introduction-to-cryptography/blob/master/2.5%20RC.md)\r\n* [非對稱式加密](https://github.com/EasonWang01/Introduction-to-cryptography/blob/master/3.%20%E9%9D%9E%E5%B0%8D%E7%A8%B1%E5%BC%8F%E5%8A%A0%E5%AF%86.md)\\\r\n 3.1 [RSA](https://github.com/EasonWang01/Introduction-to-cryptography/blob/master/3.1%20RSA.md)\\\r\n 3.2 [DSA](https://github.com/EasonWang01/Introduction-to-cryptography/blob/master/3.2%20DSA.md)\\\r\n 3.3 [ECDSA](https://github.com/EasonWang01/Introduction-to-cryptography/blob/master/3.3%20ECDSA.md)\\\r\n 3.4 [Diffie–Hellman](https://github.com/EasonWang01/Introduction-to-cryptography/blob/master/3.4%20Diffie%E2%80%93Hellman.md)\\\r\n 3.5 [ECDH](https://github.com/EasonWang01/Introduction-to-cryptography/blob/master/3.5%20ECDH.md)\\\r\n 3.6 [ECIES](https://github.com/EasonWang01/Introduction-to-cryptography/blob/master/3.6%20ECIES.md)\r\n \r\n\r\n\r\n---\r\n\r\n\r\n # 相關密碼學介紹\r\n\r\n密碼學被廣泛應用在現今的應用中，例如晶片、信用卡、電子郵件加密傳輸、身分認證、遠端電腦連線等等。\r\n\r\n在現代許多協定均有使用到密碼學來進行加解密的動作，例如 : HTTPS、PGP、IPsec、SSL / TLS、SSH。\r\n\r\n以下介紹將雜湊函式（ Hash ）、對稱式加密、非對稱式加密，並且會以 OpenSSL 與 Node.js 進行範例實作。\r\n\r\n---\r\n\r\n\r\n## OpenSSL\r\n\r\n[https://www.openssl.org/](https://www.openssl.org/)\r\n\r\n可使用以下指令來查看OpenSSL版本\r\n\r\n```\r\nopenssl version -a\r\n```\r\n\r\nOpenSSL為一個開放原始碼的函式庫套件，用C語言寫成，類Unix系統已經內建在裡面，而Windows使用者可以用Git Bash來執行。\r\n\r\n> OpenSSL計劃在1998年開始，目標是發明一套自由的加密工具，其包含目前大部分的主流加密演算法。\r\n\r\n查看所有可用指令與可用加密法\r\n\r\n```\r\nopenssl help\r\n```\r\n\r\n![](/assets/9444.png)\r\n\r\n而我們也可以輸入以下指令，測試電腦執行相關加密演算法時的性能與耗時\r\n\r\n```\r\nopenssl speed\r\n```\r\n\r\n> 其他指令可參考:\r\n>\r\n> [https://wiki.openssl.org/index.php/Command\\_Line\\_Utilities](https://wiki.openssl.org/index.php/Command_Line_Utilities)\r\n\r\n## Node.js Crypto模組\r\n\r\n[https://nodejs.org/api/crypto.html](https://nodejs.org/api/crypto.html)\r\n\r\n可使用以下指令來查看Node.js crypto模組\r\n\r\n```\r\nnode -p crypto\r\n```\r\n\r\n取得可用Hash function\r\n\r\n```\r\nnode -p crypto.getHashes()\r\n```\r\n\r\n取得可用之對稱式加密方法\r\n\r\n```\r\nnode -p crypto.getCiphers()\r\n```\r\n\r\n---\r\n\r\n# 有關雜湊（Hash）\r\n\r\nHash function也可稱為雜湊函式，可以把一串任意長度大小的字串或數字，轉換一串為固定大小的值。\r\n\r\n而任何相同的值經過hash後出來的值都會是相同的，所以就可以進一步做到訊息驗證。\r\n\r\n通常是一個單向函式，也就是無法從算出來的值反推回原本的值 \$ 除了已經被破解的Hash算法例外 \$。\r\n\r\n比較常見的包含MD5、SHA1、SHA2、SHA3與Ripemd系列等等，但目前MD5與SHA1已經被破解。\r\n\r\n而還有一些是專門用來幫密碼做Hash的雜湊函式，例如：\r\n\r\n[bcrypt](https://en.wikipedia.org/wiki/Bcrypt)、[PBKDF2](https://en.wikipedia.org/wiki/PBKDF2)、[scrypt](https://en.wikipedia.org/wiki/Scrypt)、[Argon2](https://en.wikipedia.org/wiki/Argon2)等等。\r\n\r\n雜湊函式被設計成能夠非常快速，讓整個加密程序不至於被拖慢，但這樣攻擊者可以非常快速的用任意的字串來進行雜湊並比對輸出結果，所以在雜湊中會加入一些方法來解決此問題。\r\n\r\n1.Salt\r\n\r\n```\r\nSalt是指在雜湊函數中或是密碼上加入一串隨機的位元 ( random sequence of bytes )。\r\n所以密碼就會像是：salt字串 + password字串\r\n而任何人知道 password 字串並進行雜湊後的雜湊值，將不會與加入salt後的值相同。\r\n如果每個使用者都有不同的salt，就沒有簡單的方法來辨識出使用者是否使用相同的password字串。\r\n```\r\n\r\n2.Stretching\r\n\r\n```\r\n意思就是讓我們雜湊過的數字再次進行雜湊，所以要得到相同的Hash的話對方必須也要進行相同次數的雜湊才可以。\r\n```\r\n\r\n3.Memory\r\n\r\n```\r\n在計算時將大量數字暫存在記憶體中，如此一來電腦在運算時也必須消耗足夠的記憶體，\r\n使用大量的記憶體也代表了這個雜湊函式不容易進行平行處理(parallelize)。\r\n```\r\n\r\n---\r\n\r\n我們下面一樣使用Node.js來展示一些Hash function讓大家可以快速地了解他們的用法。\r\n\r\n## MD5\r\n\r\n```js\r\nconst crypto = require('crypto');\r\n\r\nfunction md5(text) {\r\n return crypto.createHash('md5').update(text).digest('hex');\r\n};\r\n\r\nlet hash = md5('test');\r\nconsole.log(hash);\r\n```\r\n\r\n## SHA\r\n\r\n全名為 Secure Hash Algorithm，從1995年發佈的SHA1、2001年發佈的SHA2、2015年正式發佈的SHA3，每一代都是上一代的改進版本，而SHA1的Hash值長度為160bits，到了SHA2與SHA3他們的長度可以是以下幾種，例如：224、256、384、512等等，所以我們才會常聽到例如SHA-256或是SHA-512等等的名詞。\r\n\r\nSHA-256範例：\r\n\r\n```js\r\nconst crypto = require('crypto');\r\nlet hash = crypto.createHash('sha256').update('test').digest('hex'); //hex代表輸出為16進位，原先為buffer型態\r\nconsole.log(hash);\r\n```\r\n\r\n#### SHA3\r\n\r\n而在2015年8月5日SHA-3正式發表，而由於原先的Keccak被選為SHA3的最適合算法，所以SHA3也稱為Keccak\r\n\r\n以下為Node.js SHA3範例：\r\n\r\n```\r\nnpm install sha3@1.2.0\r\n```\r\n\r\n```js\r\nconst SHA3 = require('sha3');\r\n\r\nlet hash_512 = new SHA3.SHA3Hash().update('test').digest('hex'); //預設為512bits\r\nconsole.log(hash_512);\r\n\r\nlet hash_224 = new SHA3.SHA3Hash(224).update('test').digest('hex'); // 224 bits\r\nconsole.log(hash_224);\r\n```\r\n\r\n## Ripemd\r\n\r\nRipemd系列包含128、160、256、320等等，數字代表其 hash 過後的 bits 長度，最常見的是Ripemd-160，也就是產生160 bits長度的Hash，而Ripemd主要為了加強與改良原先的MD系列而發明。\r\n\r\nRipemd-160範例：\r\n\r\n> 需要先安裝 ripemd160 第三方模組\r\n>\r\n> ```\r\n> npm install ripemd160@2.0.1\r\n> ```\r\n\r\n```js\r\nconst RIPEMD160 = require('ripemd160')\r\n\r\nconsole.log(new RIPEMD160().update('test').digest('hex'))\r\n```\r\n\r\n## HMAC\r\n\r\nHMAC是在上述的雜湊函式外再加上一個secret，然後一起進行Hash。\r\n\r\n```js\r\nconst crypto = require('crypto');\r\nconst hmac = crypto.createHmac('sha256', 'a secret');\r\n\r\nhmac.update('test');\r\nconsole.log(hmac.digest('hex'));\r\n```\r\n\r\n## Blake2\r\n\r\n[https://blake2.net/](https://blake2.net/)\r\n\r\n這是一個強調快速、安全與簡單的Hash算法，並且目前被用來替代MD5和SHA1。\r\n\r\n因為它可以在不耗費更多資源的情況下提供更好的安全性，但後來由Keccak獲選為SHA3的原因是NIST認為Keccak更具有抗ASIC的能力以及因為Blake的實作類似於SHA2，所以後來才不選擇Blake為SHA3標準。\r\n\r\n> 參考此:[https://crypto.stackexchange.com/questions/31674/what-advantages-does-keccak-sha-3-have-over-blake2](https://crypto.stackexchange.com/questions/31674/what-advantages-does-keccak-sha-3-have-over-blake2)\r\n\r\nBlake2在2012年發表，是Blake的改良版本，列於RFC-7693 [https://tools.ietf.org/html/rfc7693](https://tools.ietf.org/html/rfc7693)\r\n\r\n其中分為兩種類型，BLAKE2b是針對64bits的平台進行優化而BLAKE2s是針對8到32bits的平台。\r\n\r\n接著我們使用[https://github.com/dcposch/blakejs模組](https://github.com/dcposch/blakejs模組)\r\n\r\n```\r\nnpm install blakejs@1.1.0\r\n```\r\n\r\n```js\r\nconst blake = require('blakejs')\r\n\r\n// blake2b\r\nconsole.log(blake.blake2bHex('test'))\r\n\r\n// blake2s\r\nconsole.log(blake.blake2sHex('test'))\r\n```\r\n\r\n## Bcrypt、PBKDF2、Scrypt、Argon2\r\n\r\n有一些工具函式是專門設計用來將金鑰、密碼、密文做雜湊的函式，這些函式的特點都是運算速度不快，並且有些需要耗費較多的運算記憶體，讓破解者無法在短時間內快速算出對應的雜湊，增加了密碼被破解的難度。\r\n\r\n# Bcrypt\r\n\r\n基於[Blowfish](https://baike.baidu.com/item/Blowfish/1677776)的一個加密算法，於1999年發表。\r\n\r\nhash的過程會加入一個隨機的salt，然後salt跟password一起hash。但每次產生的salt會不一樣，所以同一個密碼每次進行產生的Hash會不同。\r\n\r\n而Bcrypt包含Round數，也就是要重複進行幾次運算，越多Round會需要越多的計算時間。\r\n\r\n以下為在2GHz core上的耗費時間表：\r\n\r\n![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/%E8%9E%A2%E5%B9%95%E5%BF%AB%E7%85%A7%202018-01-28%20%E4%B8%8B%E5%8D%8812.06.21.png)\r\n\r\n再來你可能會想既然每次產生的Hash不同，那要怎麼進行訊息驗證呢？\r\n\r\n解答是：在要驗證訊息時，會從原先的Hash中取出salt \$ 通常為Hash前面幾個字 \$，然後把取出來的salt跟輸入的password進行hash，最後將得到的結果跟之前保存在資料庫中的Hash值進行比對。\r\n\r\n我們可用Node.js的Bcrypt模組：[https://github.com/kelektiv/node.bcrypt.js](https://github.com/kelektiv/node.bcrypt.js)\r\n\r\n1.安裝\r\n\r\n```\r\nnpm install bcrypt\r\n```\r\n\r\n2.生成Hash\r\n\r\n```js\r\nconst bcrypt = require('bcrypt');\r\nconst saltRounds = 10;\r\nconst myPlaintextPassword = 'I_am_password';\r\n\r\nbcrypt.genSalt(saltRounds, function (err, salt) {\r\n bcrypt.hash(myPlaintextPassword, salt, function (err, hash) {\r\n if (err) console.log(err);\r\n console.log(hash);\r\n });\r\n});\r\n```\r\n\r\n3.驗證\r\n\r\n```js\r\nconst bcrypt = require('bcrypt');\r\nconst myPlaintextPassword = 'I_am_password';\r\n\r\nbcrypt.compare(myPlaintextPassword, \"$2a$10$8QT.28zoo.jyFB2yvDURL.IM6gL4YJHGsr1PUysnFuGeqeDeooxuK\", function(err, res) {\r\n console.log(res)\r\n});\r\n\r\n// 在bcrypt.compare()中的填入要比對的密碼與剛才產生出的Hash\r\n```\r\n\r\n# PBKDF2\r\n\r\n全名為Password-Based Key Derivation Function，利用HMAC的方式來加入password和salt然後一樣進行多次的重複計算。\r\n\r\nNode.js原生即提供了PBKDF2算法。\r\n\r\n```js\r\nconst crypto = require('crypto');\r\ncrypto.pbkdf2('secret', 'salt', 100000, 64, 'sha512', (err, derivedKey) => {\r\n if (err) throw err;\r\n console.log(derivedKey.toString('hex')); // '3745e48...08d59ae'\r\n});\r\n```\r\n\r\n> 其中參數依序為：\r\n>\r\n> password 要進行Hash的字串\r\n>\r\n> salt 加入的隨機值\r\n>\r\n> iterations 計算次數\r\n>\r\n> key\\_length 產生的Hash長度\$bytes\$\r\n>\r\n> digest 使用的Hash算法 e.g. SHA-512\r\n\r\n# Scrypt\r\n\r\n此Hash方法加入了需要大量記憶體運算的設計，作法為利用大量記憶體，並將運算資料儲存在記憶體內供演算法計算，如此可避免一些客製化的硬體快速的計算出Hash。而其也是Litecoin與Dogecoin所使用的Hash演算法。\r\n\r\n其強調他對抗暴力破解程度是PBKDF2的兩萬倍，是Bcrypt的四千倍。\r\n\r\n> [https://www.tarsnap.com/scrypt.html](https://www.tarsnap.com/scrypt.html)\r\n\r\n其通常包含三個參數N、r、p\r\n\r\n> ```\r\n> N: General work factor, iteration count.(重複計算的次數)\r\n> r: blocksize in use for underlying hash; fine-tunes the relative memory-cost.(區塊大小)\r\n> p: parallelization factor; fine-tunes the relative cpu-cost.(平行計算的數量)\r\n>\r\n> 參考至https://stackoverflow.com/questions/11126315/what-are-optimal-scrypt-work-factors\r\n> ```\r\n\r\n```\r\n// 以下為計算Scrypt會需要使用的記憶體大小\r\n128 bytes × N × r\r\n128 × 16384 × 8 = 16,777,216 bytes = 16 MB\r\n```\r\n\r\n> 而p的參數一般來說都會是1\r\n\r\n接著，我們使用node-scrypt模組來進行實際操作。\r\n\r\n> [https://github.com/barrysteyn/node-scrypt](https://github.com/barrysteyn/node-scrypt)\r\n\r\n安裝：\r\n\r\n```\r\nnpm install scrypt\r\n```\r\n\r\n```js\r\nconst scrypt = require(\"scrypt\");\r\n\r\nscrypt.kdf(\"password\", { N: 1, r: 1, p: 1 }, function (err, result) {\r\n scrypt.verifyKdf(result, new Buffer(\"password\"), function (err, result) {\r\n if (err) console.log(err);\r\n console.log(result)\r\n });\r\n});\r\n```\r\n\r\n## Argon2\r\n\r\n在2015獲選為[Password Hashing Competition](https://en.wikipedia.org/wiki/Password_Hashing_Competition)的冠軍，其有三種類型Argon2i、Argon2d與Argon2id。\r\n\r\n其詳細spec可參考: [https://github.com/P-H-C/phc-winner-argon2/blob/master/argon2-specs.pdf](https://github.com/P-H-C/phc-winner-argon2/blob/master/argon2-specs.pdf)\r\n\r\n```\r\nArgon2d: (快速，並且可對抗GPU暴力破解攻擊)\r\nFaster and uses data-depending memory access, which makes it highly resistant against GPU cracking attacks \r\nand suitable for applications with no threats from side-channel timing attacks. \r\n\r\nArgon2i: (適合用於密碼雜湊與金鑰衍伸函式)\r\nWhich is preferred for password hashing and password-based key derivation, \r\nbut it is slower as it makes more passes over the memory to protect from tradeoff attacks.\r\n\r\nArgon2id: (為前兩者的結合)\r\nHybrid of Argon2i and Argon2d, using a combination of data-depending and data-independent memory accesses, \r\nwhich gives some of Argon2i's resistance to side-channel cache timing attacks and much of Argon2d's resistance to GPU cracking attacks.\r\n\r\n參考至: https://github.com/P-H-C/phc-winner-argon2\r\n```\r\n\r\n以下使用Node.js的第三方Argon2模組\r\n\r\n```\r\nnpm install argon2\r\n```\r\n\r\n產生Hash\r\n\r\n```js\r\nconst argon2 = require('argon2');\r\nconst options = {\r\n timeCost: 4, memoryCost: 13, parallelism: 2, type: argon2.argon2d\r\n};\r\n\r\nargon2.hash('password', options).then(hash => {\r\n console.log(hash)\r\n});\r\n```\r\n\r\n驗證\r\n\r\n```js\r\nconst argon2 = require('argon2');\r\n\r\n/*\r\nagron2.verify()的第一個參數填入剛才產生的雜湊值，第二個參數填入雜湊時輸入的密碼\r\n*/\r\nargon2.verify('$argon2d$v=19$m=8192,t=4,p=2$Qt1HCzlwg260X7LNpzqtCg$u+zNJnC2s7gs6vJ6rzlR6usRIKJdvqGGKjALr47txg0', 'password').then(match => {\r\n if (match) {\r\n console.log('match!')\r\n } else {\r\n console.log('not match.')\r\n }\r\n }).catch(err => {\r\n console.log(err)\r\n});\r\n```\r\n\r\n# SHA-256實作原理\r\n\r\n### 第一步:\r\n\r\n```\r\n1.把明文轉為二進位的數字bits\r\n2.在最後面先放一個數字1\r\n3.在最後面補 k 個 0 直到明文bits的長度 + 1 + k % 512 = 448\r\n```\r\n\r\n做完上述三點後，在最後面再加上 64 bits的數字，內容為明文的長度\$以二進位表示\$ ，例如：abc之ASCII二進位長度為24 bits\r\n\r\n而 24 之二進位為11000，因為不足 64 bit 於是在前面補0使其成為：`00....11000`，補足64 bits。\r\n\r\n> 以下為 8-bit 之 ASCII 字母：abc 之例子。對照下圖的第一個 8 bits： `01100001` 對應到 `a`，可參照ASCII Table。\r\n\r\n![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/%E8%9E%A2%E5%B9%95%E5%BF%AB%E7%85%A7%202018-02-01%20%E4%B8%8A%E5%8D%889.01.01.png)\r\n\r\n### 第二步:\r\n\r\n寫出八個 initial hash value（此為被預先定義之固定值）\r\n\r\n#### ![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/%E8%9E%A2%E5%B9%95%E5%BF%AB%E7%85%A7%202018-02-01%20%E4%B8%8A%E5%8D%889.05.43.png)\r\n\r\n##### 原理：\r\n\r\n```js\r\n先取Math.sqrt(n)的小數，然後乘上2 ** 32，之後轉為16進位，然後取小數前面部分\r\n其中math.sqrt(n)，n為從0往上找到的最小八個質數。 \r\n\r\nH(0)\r\n1 = 6a09e667 \r\n(Math.sqrt(2) % 1 * (2**32)).toString(16).substring(0,8)\r\n\r\nH(0)\r\n2 = bb67ae85\r\n(Math.sqrt(3) % 1 * (2**32)).toString(16).substring(0,8)\r\n\r\nH(0)\r\n3 = 3c6ef372\r\n(Math.sqrt(5) % 1 * (2**32)).toString(16).substring(0,8)\r\n\r\nH(0)\r\n4 = a54ff53a\r\n(Math.sqrt(7) % 1 * (2**32)).toString(16).substring(0,8)\r\n\r\nH(0)\r\n5 = 510e527f\r\n(Math.sqrt(11) % 1 * (2**32)).toString(16).substring(0,8)\r\n\r\nH(0)\r\n6 = 9b05688c\r\n(Math.sqrt(13) % 1 * (2**32)).toString(16).substring(0,8)\r\n\r\nH(0)\r\n7 = 1f83d9ab\r\n(Math.sqrt(17) % 1 * (2**32)).toString(16).substring(0,8)\r\n\r\nH(0)\r\n8 = 5be0cd19\r\n(Math.sqrt(19) % 1 * (2**32)).toString(16).substring(0,8)\r\n```\r\n\r\n\r\n\r\n### 第三步\r\n\r\n寫出 64 個固定 k 值\r\n\r\n![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/%E8%9E%A2%E5%B9%95%E5%BF%AB%E7%85%A7%202018-02-01%20%E4%B8%8A%E5%8D%889.07.07.png)**原理： **\r\n\r\n```js\r\n用Math cube root的方法找首64個質數\r\n\r\n(Math.cbrt(2) * (2**32)).toString(16).substring(1,9)\r\n\"428a2f98\"\r\n\r\n(Math.cbrt(3) * (2**32)).toString(16).substring(1,9)\r\n\"71374491\"\r\n\r\n(Math.cbrt(5) * (2**32)).toString(16).substring(1,9)\r\n\"b5c0fbcf\"\r\n```\r\n\r\n\r\n\r\n### 第四步:\r\n\r\n使用SHA-256定義的六個邏輯 Function\r\n\r\n![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/%E8%9E%A2%E5%B9%95%E5%BF%AB%E7%85%A7%202018-02-01%20%E4%B8%8A%E5%8D%889.08.21.png)\r\n\r\n其中符號定義如下\r\n\r\n![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/%E8%9E%A2%E5%B9%95%E5%BF%AB%E7%85%A7%202018-02-01%20%E4%B8%8A%E5%8D%889.09.22.png)\r\n\r\n寫成程式為:\r\n\r\n```js\r\nfunction ch (x, y, z) {\r\n return z ^ (x & (y ^ z))\r\n}\r\n\r\nfunction maj (x, y, z) {\r\n return (x & y) | (z & (x | y))\r\n}\r\n\r\nfunction sigma0 (x) {\r\n return (x >>> 2 | x << 30) ^ (x >>> 13 | x << 19) ^ (x >>> 22 | x << 10)\r\n}\r\n\r\nfunction sigma1 (x) {\r\n return (x >>> 6 | x << 26) ^ (x >>> 11 | x << 21) ^ (x >>> 25 | x << 7)\r\n}\r\n\r\nfunction gamma0 (x) {\r\n return (x >>> 7 | x << 25) ^ (x >>> 18 | x << 14) ^ (x >>> 3)\r\n}\r\n\r\nfunction gamma1 (x) {\r\n return (x >>> 17 | x << 15) ^ (x >>> 19 | x << 13) ^ (x >>> 10)\r\n}\r\n```\r\n\r\n# 完整範例\r\n\r\n> 需要先安裝big-integer模組\r\n\r\n```\r\nnpm install big-integer\r\n```\r\n\r\n```js\r\nconst util = require('util');\r\nvar bigInt = require(\"big-integer\");\r\n\r\n\r\nfunction Hash (blockSize, finalSize) {\r\n this._block = new Buffer(blockSize)\r\n this._finalSize = finalSize\r\n this._blockSize = blockSize\r\n this._len = 0\r\n}\r\n\r\nHash.prototype.digest = function (data, enc) {\r\n\r\ndata = (data).toString(); \r\n//////////////////\r\nlet s = \"\"\r\nlet s1 = \"\"\r\n\r\n// 將字串轉為二進位ASCII\r\nfunction ascii (a) { \r\n let dd = \"\";\r\n for(let i = 0 ; i< a.length; i++) {\r\n let charAscII = a.charAt(i).charCodeAt(0).toString(2)\r\n while(charAscII.length < 8) { // 最前面的0都會被省略，所以手動加上\r\n charAscII = 0 + charAscII\r\n }\r\n dd += charAscII; \r\n }\r\n return dd\r\n}\r\n\r\nlet msgLengthToBinary = ((ascii(data).length).toString(2).length); // 計算訊息有幾個字元再轉為二進位數字的長度\r\nlet BinarymsgLength = (ascii(data).length); // 訊息的二進位的長度\r\n\r\nfor(i = 0; i < 448 - 1 - BinarymsgLength; i++) {s += 0} // 前面補448 bit 的 0\r\nfor(i = 0; i < 64 - msgLengthToBinary ; i++) {s1 += 0} // 後面補64 bit 的 0\r\n\r\nlet msgLength = ascii(data).length;\r\nlet frontPad = ascii(data) + 1 + s + s1 + (ascii(data).length).toString(2);\r\n\r\n\r\nlet c0 = bigInt(bin2dec(frontPad)).toString(16); //涉及大數轉進位(MAX_SAFE_INTEGER)\r\n\r\n\r\nlet initPadedValue = c0.substring(0, c0.length - 2) + msgLength.toString(16); //因為太大的數parseInt並轉二進位後面的數字會被省略掉，所以把它加上\r\n\r\n\r\nlet initPadedValueBuffer = Buffer.from(initPadedValue, 'hex');\r\n\r\n this._update(initPadedValueBuffer) //傳入一開始pad好之buffer進行main loop hash function\r\n var hash = this._hash() //拼接main loop好的a-h八個區塊\r\n\r\n return enc ? hash.toString(enc) : hash //轉為16進位\r\n}\r\n\r\n\r\nfunction bin2dec(str){ //大數二進位在用parseInt轉十進位時後面常被省略，所以用此方法\r\n var dec = str.toString().split(''), sum = [], hex = [], i, s\r\n while(dec.length){\r\n s = 1 * dec.shift()\r\n for(i = 0; s || i < sum.length; i++){\r\n s += (sum[i] || 0) * 2\r\n sum[i] = s % 10\r\n s = (s - sum[i]) / 10\r\n }\r\n }\r\n while(sum.length){\r\n hex.push(sum.pop().toString(10))\r\n }\r\n return hex.join('')\r\n}\r\n\r\n\r\nvar K = [\r\n 0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,\r\n 0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,\r\n 0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,\r\n 0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,\r\n 0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC,\r\n 0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,\r\n 0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7,\r\n 0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967,\r\n 0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13,\r\n 0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85,\r\n 0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3,\r\n 0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,\r\n 0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5,\r\n 0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3,\r\n 0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,\r\n 0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2\r\n]\r\n\r\nvar W = new Array(64)\r\n\r\nfunction Sha256 () {\r\n this.init()\r\n\r\n this._w = W // new Array(64)\r\n\r\n Hash.call(this, 64, 56)\r\n}\r\n\r\nutil.inherits(Sha256, Hash)\r\n\r\nSha256.prototype.init = function () {\r\n this._a = 0x6a09e667\r\n this._b = 0xbb67ae85\r\n this._c = 0x3c6ef372\r\n this._d = 0xa54ff53a\r\n this._e = 0x510e527f\r\n this._f = 0x9b05688c\r\n this._g = 0x1f83d9ab\r\n this._h = 0x5be0cd19\r\n\r\n return this\r\n}\r\n\r\nfunction ch (x, y, z) {\r\n return z ^ (x & (y ^ z))\r\n}\r\n\r\nfunction maj (x, y, z) {\r\n return (x & y) | (z & (x | y))\r\n}\r\n\r\nfunction sigma0 (x) {\r\n return (x >>> 2 | x << 30) ^ (x >>> 13 | x << 19) ^ (x >>> 22 | x << 10)\r\n}\r\n\r\nfunction sigma1 (x) {\r\n return (x >>> 6 | x << 26) ^ (x >>> 11 | x << 21) ^ (x >>> 25 | x << 7)\r\n}\r\n\r\nfunction gamma0 (x) {\r\n return (x >>> 7 | x << 25) ^ (x >>> 18 | x << 14) ^ (x >>> 3)\r\n}\r\n\r\nfunction gamma1 (x) {\r\n return (x >>> 17 | x << 15) ^ (x >>> 19 | x << 13) ^ (x >>> 10)\r\n}\r\n\r\nSha256.prototype._update = function (M) {\r\n var W = this._w\r\n\r\n var a = this._a | 0\r\n var b = this._b | 0\r\n var c = this._c | 0\r\n var d = this._d | 0\r\n var e = this._e | 0\r\n var f = this._f | 0\r\n var g = this._g | 0\r\n var h = this._h | 0\r\n\r\n for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4)\r\n for (; i < 64; ++i) W[i] = (gamma1(W[i - 2]) + W[i - 7] + gamma0(W[i - 15]) + W[i - 16]) | 0\r\n\r\n for (var j = 0; j < 64; ++j) {\r\n var T1 = (h + sigma1(e) + ch(e, f, g) + K[j] + W[j]) | 0\r\n var T2 = (sigma0(a) + maj(a, b, c)) | 0\r\n\r\n h = g\r\n g = f\r\n f = e\r\n e = (d + T1) | 0\r\n d = c\r\n c = b\r\n b = a\r\n a = (T1 + T2) | 0\r\n }\r\n\r\n this._a = (a + this._a) | 0\r\n this._b = (b + this._b) | 0\r\n this._c = (c + this._c) | 0\r\n this._d = (d + this._d) | 0\r\n this._e = (e + this._e) | 0\r\n this._f = (f + this._f) | 0\r\n this._g = (g + this._g) | 0\r\n this._h = (h + this._h) | 0\r\n}\r\n\r\nSha256.prototype._hash = function () {\r\n var H = new Buffer(32)\r\n\r\n H.writeInt32BE(this._a, 0)\r\n H.writeInt32BE(this._b, 4)\r\n H.writeInt32BE(this._c, 8)\r\n H.writeInt32BE(this._d, 12)\r\n H.writeInt32BE(this._e, 16)\r\n H.writeInt32BE(this._f, 20)\r\n H.writeInt32BE(this._g, 24)\r\n H.writeInt32BE(this._h, 28)\r\n\r\n return H\r\n}\r\n\r\n// 執行:\r\n\r\nlet hashString = new Sha256().digest('test','hex');\r\n\r\nconsole.log(hashString)\r\n```\r\n\r\n使用 Node.js 的 crypto 模組進行驗證，可以得到相同的雜湊值。\r\n\r\n```js\r\nconst crypto = require('crypto');\r\nlet result = crypto.createHash('sha256').update('test').digest('hex')\r\nconsole.log(result)\r\n```\r\n\r\n\r\n\r\n參考資料：\r\n\r\n> [http://www.iwar.org.uk/comsec/resources/cipher/sha256-384-512.pdf](http://www.iwar.org.uk/comsec/resources/cipher/sha256-384-512.pdf)\r\n\r\n\r\n# RIPEMD-160實作原理\r\n\r\n## 步驟ㄧ:\r\n\r\n#### 官方公式定義:\r\n\r\n> 根據 j 的值不同，函式計算方式也不同\r\n\r\n![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/%E8%9E%A2%E5%B9%95%E5%BF%AB%E7%85%A7%202018-02-02%20%E4%B8%8B%E5%8D%8812.27.35.png)\r\n\r\n符號意思分別為\r\n\r\n![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/%E8%9E%A2%E5%B9%95%E5%BF%AB%E7%85%A7%202018-02-01%20%E4%B8%8A%E5%8D%889.09.22.png)\r\n\r\n## 步驟二:\r\n\r\n#### 然後加上hash時會用到的常數constant\r\n\r\n#### 1.\r\n\r\n![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/%E8%9E%A2%E5%B9%95%E5%BF%AB%E7%85%A7%202018-02-02%20%E4%B8%8B%E5%8D%8812.29.58.png)\r\n\r\n##### 將其分為hl與hr\r\n\r\n```js\r\nconst hl = [0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e];\r\nconst hr = [0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000];\r\n```\r\n\r\n> 對照上圖最右側公式 \"5a827999\" = \$2 \\*\\* 30 \\* \\(Math.sqrt\\(2\$\\)\\).toString\$16\$.substring\$0,8\$\r\n\r\n#### 2.selection of message word\r\n\r\n##### ![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/%E8%9E%A2%E5%B9%95%E5%BF%AB%E7%85%A7%202018-02-02%20%E4%B8%8B%E5%8D%8812.30.39.png)\r\n寫為如下：\r\n\r\n```js\r\nconst zl = [\r\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\r\n 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\r\n 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,\r\n 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,\r\n 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13\r\n]\r\n\r\nconst zr = [\r\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,\r\n 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,\r\n 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,\r\n 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,\r\n 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11\r\n]\r\n```\r\n\r\n#### 3.Amount for rotate left \$rol\$\r\n\r\n![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/%E8%9E%A2%E5%B9%95%E5%BF%AB%E7%85%A7%202018-01-07%20%E4%B8%8B%E5%8D%885.05.55.png)\r\n\r\n```js\r\nconst sl = [\r\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,\r\n 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\r\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,\r\n 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\r\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6\r\n]\r\n\r\nvar sr = [\r\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,\r\n 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\r\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,\r\n 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\r\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11\r\n]\r\n```\r\n\r\n##### 最後寫上initial value\r\n\r\n![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/%E8%9E%A2%E5%B9%95%E5%BF%AB%E7%85%A7%202018-02-02%20%E4%B8%8B%E5%8D%8812.32.41.png)\r\n\r\n### 看完上面定義的這些數字可能會有點模糊，不知道他們是用來做什麼的\r\n\r\n所以我們直接來看整個hash過程的pseudo-code\r\n\r\n![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/%E8%9E%A2%E5%B9%95%E5%BF%AB%E7%85%A7%202018-01-07%20%E4%B8%8B%E5%8D%885.10.24.png)\r\n\r\n寫成JS\r\n\r\n```js\r\nfunction rotl (x, n) {\r\n return (x << n) | (x >>> (32 - n))\r\n}\r\n\r\nfunction fn1 (a, b, c, d, e, m, k, s) {\r\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + e) | 0\r\n}\r\n\r\nfunction fn2 (a, b, c, d, e, m, k, s) {\r\n return (rotl((a + ((b & c) | ((~b) & d)) + m + k) | 0, s) + e) | 0\r\n}\r\n\r\nfunction fn3 (a, b, c, d, e, m, k, s) {\r\n return (rotl((a + ((b | (~c)) ^ d) + m + k) | 0, s) + e) | 0\r\n}\r\n\r\nfunction fn4 (a, b, c, d, e, m, k, s) {\r\n return (rotl((a + ((b & d) | (c & (~d))) + m + k) | 0, s) + e) | 0\r\n}\r\n\r\nfunction fn5 (a, b, c, d, e, m, k, s) {\r\n return (rotl((a + (b ^ (c | (~d))) + m + k) | 0, s) + e) | 0\r\n}\r\n\r\nfor (var i = 0; i < 80; i += 1) {\r\n var tl\r\n var tr\r\n if (i < 16) {\r\n tl = fn1(al, bl, cl, dl, el, words[zl[i]], hl[0], sl[i])\r\n tr = fn5(ar, br, cr, dr, er, words[zr[i]], hr[0], sr[i])\r\n } else if (i < 32) {\r\n tl = fn2(al, bl, cl, dl, el, words[zl[i]], hl[1], sl[i])\r\n tr = fn4(ar, br, cr, dr, er, words[zr[i]], hr[1], sr[i])\r\n } else if (i < 48) {\r\n tl = fn3(al, bl, cl, dl, el, words[zl[i]], hl[2], sl[i])\r\n tr = fn3(ar, br, cr, dr, er, words[zr[i]], hr[2], sr[i])\r\n } else if (i < 64) {\r\n tl = fn4(al, bl, cl, dl, el, words[zl[i]], hl[3], sl[i])\r\n tr = fn2(ar, br, cr, dr, er, words[zr[i]], hr[3], sr[i])\r\n } else { // if (i<80) {\r\n tl = fn5(al, bl, cl, dl, el, words[zl[i]], hl[4], sl[i])\r\n tr = fn1(ar, br, cr, dr, er, words[zr[i]], hr[4], sr[i])\r\n }\r\n\r\n al = el\r\n el = dl\r\n dl = rotl(cl, 10)\r\n cl = bl\r\n bl = tl\r\n\r\n ar = er\r\n er = dr\r\n dr = rotl(cr, 10)\r\n cr = br\r\n br = tr\r\n}\r\n```\r\n\r\n最後，把一開始的constant的每個數值加上新hash過的數字更新然後串接起來\r\n\r\n```js\r\n let t = (this._b + cl + dr) | 0\r\n this._b = (this._c + dl + er) | 0\r\n this._c = (this._d + el + ar) | 0\r\n this._d = (this._e + al + br) | 0\r\n this._e = (this._a + bl + cr) | 0\r\n this._a = t\r\n\r\n let buffer = new Buffer(20)\r\n buffer.writeInt32LE(this._a, 0)\r\n buffer.writeInt32LE(this._b, 4)\r\n buffer.writeInt32LE(this._c, 8)\r\n buffer.writeInt32LE(this._d, 12)\r\n buffer.writeInt32LE(this._e, 16)\r\n return buffer\r\n```\r\n\r\n#### --------------------------------------------------------------------------------------------------------------------\r\n\r\n#### \r\n\r\n#### 完整程式碼\r\n\r\n```js\r\nconst util = require('util');\r\n\r\nfunction HashBase(blockSize) {\r\n this._block = Buffer.allocUnsafe(blockSize)\r\n this._blockSize = blockSize\r\n this._blockOffset = 0\r\n this._length = [0, 0, 0, 0]\r\n\r\n this._finalized = false\r\n}\r\n\r\n\r\nHashBase.prototype.update = function (data, encoding) {\r\n if (this._finalized) throw new Error('Digest already called')\r\n if (!Buffer.isBuffer(data)) data = Buffer.from(data, encoding)\r\n\r\n // consume data\r\n var block = this._block\r\n var offset = 0\r\n while (this._blockOffset + data.length - offset >= this._blockSize) {\r\n for (var i = this._blockOffset; i < this._blockSize;) block[i++] = data[offset++]\r\n this._update()\r\n this._blockOffset = 0\r\n }\r\n while (offset < data.length) block[this._blockOffset++] = data[offset++]\r\n\r\n // update length\r\n for (var j = 0, carry = data.length * 8; carry > 0; ++j) {\r\n this._length[j] += carry\r\n carry = (this._length[j] / 0x0100000000) | 0\r\n if (carry > 0) this._length[j] -= 0x0100000000 * carry\r\n }\r\n\r\n return this\r\n}\r\n\r\nHashBase.prototype._update = function () {\r\n throw new Error('_update is not implemented')\r\n}\r\n\r\nHashBase.prototype.digest = function (encoding) {\r\n if (this._finalized) throw new Error('Digest already called')\r\n this._finalized = true\r\n\r\n var digest = this._digest()\r\n if (encoding !== undefined) digest = digest.toString(encoding)\r\n\r\n // reset state\r\n this._block.fill(0)\r\n this._blockOffset = 0\r\n for (var i = 0; i < 4; ++i) this._length[i] = 0\r\n\r\n return digest\r\n}\r\n\r\n\r\nvar zl = [\r\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\r\n 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\r\n 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,\r\n 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,\r\n 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13\r\n]\r\n\r\nvar zr = [\r\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,\r\n 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,\r\n 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,\r\n 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,\r\n 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11\r\n]\r\n\r\nvar sl = [\r\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,\r\n 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\r\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,\r\n 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\r\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6\r\n]\r\n\r\nvar sr = [\r\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,\r\n 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\r\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,\r\n 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\r\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11\r\n]\r\n\r\nvar hl = [0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e]\r\nvar hr = [0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000]\r\n\r\nfunction RIPEMD160() {\r\n HashBase.call(this, 64)\r\n\r\n // state\r\n this._a = 0x67452301\r\n this._b = 0xefcdab89\r\n this._c = 0x98badcfe\r\n this._d = 0x10325476\r\n this._e = 0xc3d2e1f0\r\n}\r\n\r\nutil.inherits(RIPEMD160, HashBase)\r\n\r\nRIPEMD160.prototype._update = function () {\r\n const words = new Array(16)\r\n for (var j = 0; j < 16; ++j) words[j] = this._block.readInt32LE(j * 4)\r\n\r\n var al = this._a | 0\r\n var bl = this._b | 0\r\n var cl = this._c | 0\r\n var dl = this._d | 0\r\n var el = this._e | 0\r\n\r\n var ar = this._a | 0\r\n var br = this._b | 0\r\n var cr = this._c | 0\r\n var dr = this._d | 0\r\n var er = this._e | 0\r\n\r\n // computation\r\n for (var i = 0; i < 80; i += 1) {\r\n var tl\r\n var tr\r\n if (i < 16) {\r\n tl = fn1(al, bl, cl, dl, el, words[zl[i]], hl[0], sl[i])\r\n tr = fn5(ar, br, cr, dr, er, words[zr[i]], hr[0], sr[i])\r\n } else if (i < 32) {\r\n tl = fn2(al, bl, cl, dl, el, words[zl[i]], hl[1], sl[i])\r\n tr = fn4(ar, br, cr, dr, er, words[zr[i]], hr[1], sr[i])\r\n } else if (i < 48) {\r\n tl = fn3(al, bl, cl, dl, el, words[zl[i]], hl[2], sl[i])\r\n tr = fn3(ar, br, cr, dr, er, words[zr[i]], hr[2], sr[i])\r\n } else if (i < 64) {\r\n tl = fn4(al, bl, cl, dl, el, words[zl[i]], hl[3], sl[i])\r\n tr = fn2(ar, br, cr, dr, er, words[zr[i]], hr[3], sr[i])\r\n } else { // i < 80\r\n tl = fn5(al, bl, cl, dl, el, words[zl[i]], hl[4], sl[i])\r\n tr = fn1(ar, br, cr, dr, er, words[zr[i]], hr[4], sr[i])\r\n }\r\n\r\n al = el\r\n el = dl\r\n dl = rotl(cl, 10)\r\n cl = bl\r\n bl = tl\r\n\r\n ar = er\r\n er = dr\r\n dr = rotl(cr, 10)\r\n cr = br\r\n br = tr\r\n }\r\n\r\n // update state\r\n var t = (this._b + cl + dr) | 0\r\n this._b = (this._c + dl + er) | 0\r\n this._c = (this._d + el + ar) | 0\r\n this._d = (this._e + al + br) | 0\r\n this._e = (this._a + bl + cr) | 0\r\n this._a = t\r\n}\r\n\r\nRIPEMD160.prototype._digest = function () {\r\n // create padding and handle blocks\r\n this._block[this._blockOffset++] = 0x80\r\n if (this._blockOffset > 56) {\r\n this._block.fill(0, this._blockOffset, 64)\r\n this._update()\r\n this._blockOffset = 0\r\n }\r\n\r\n this._block.fill(0, this._blockOffset, 56)\r\n this._block.writeUInt32LE(this._length[0], 56)\r\n this._block.writeUInt32LE(this._length[1], 60)\r\n this._update()\r\n\r\n // produce result\r\n var buffer = new Buffer(20)\r\n buffer.writeInt32LE(this._a, 0)\r\n buffer.writeInt32LE(this._b, 4)\r\n buffer.writeInt32LE(this._c, 8)\r\n buffer.writeInt32LE(this._d, 12)\r\n buffer.writeInt32LE(this._e, 16)\r\n return buffer\r\n}\r\n\r\nfunction rotl(x, n) {\r\n return (x << n) | (x >>> (32 - n))\r\n}\r\n\r\nfunction fn1(a, b, c, d, e, m, k, s) {\r\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + e) | 0\r\n}\r\n\r\nfunction fn2(a, b, c, d, e, m, k, s) {\r\n return (rotl((a + ((b & c) | ((~b) & d)) + m + k) | 0, s) + e) | 0\r\n}\r\n\r\nfunction fn3(a, b, c, d, e, m, k, s) {\r\n return (rotl((a + ((b | (~c)) ^ d) + m + k) | 0, s) + e) | 0\r\n}\r\n\r\nfunction fn4(a, b, c, d, e, m, k, s) {\r\n return (rotl((a + ((b & d) | (c & (~d))) + m + k) | 0, s) + e) | 0\r\n}\r\n\r\nfunction fn5(a, b, c, d, e, m, k, s) {\r\n return (rotl((a + (b ^ (c | (~d))) + m + k) | 0, s) + e) | 0\r\n}\r\n\r\nconsole.log(new RIPEMD160().update('abc').digest('hex'))\r\n```\r\n\r\n> 參考至[https://www.esat.kuleuven.be/cosic/publications/article-317.pdf](https://www.esat.kuleuven.be/cosic/publications/article-317.pdf)\r\n\r\n# 對稱式加密 \$ Symmetric-Key Algorithm \$\r\n\r\n對稱式加密的特性為加密和解密時使用相同的密鑰，常見的對稱式加密算法有：AES、3DES、IDEA、TwoFish、RC系列等等\r\n\r\n而DES與BlowFish目前因安全性已不建議採用。\r\n\r\n而下面展示一個對稱式加密最基本的原理，假設我們要用以下密鑰 `11110011` 將密文 `Test` 加密：\r\n\r\n```\r\n密文: Test\r\n密鑰: 11110011\r\n```\r\n\r\n我們先把密文轉換為ACSII 二進位\r\n\r\n```js\r\nfunction textToBinary(string) {\r\n return string.split('').map(function (char) {\r\n return '0' + char.charCodeAt(0).toString(2);\r\n })\r\n}\r\n\r\ntextToBinary(\"Test\");\r\n// [\"01010100\", \"01100101\", \"01110011\", \"01110100\"]\r\n```\r\n\r\n上面每個陣列對應一個英文字母，我們把每個陣列元素與密鑰分別做 XOR 運算\$註1\$:\r\n\r\n```js\r\nfunction XOR(a, b) {\r\n if(a.length !== b.length) {\r\n console.log(\"要求兩者二進位數字長度相同\");\r\n return\r\n }\r\n let num = (parseInt(a, 2) ^ parseInt(b, 2)).toString(2);\r\n if(num.length !== a.length) { // 因前面為0會被省略，所以要手動補0\r\n let padLength = a.length - num.length;\r\n num = \"0\".repeat(padLength) + num;\r\n };\r\n return num \r\n}\r\n\r\nlet key_ = \"11110011\"; // 密鑰\r\n\r\n// 加密\r\n([\"01010100\", \"01100101\", \"01110011\", \"01110100\"]).map(d => XOR(d, key_)); // 使用密鑰對每個元素做XOR\r\n\r\n//加密後結果: [\"10100111\", \"10010110\", \"10000000\", \"10000111\"]\r\n```\r\n\r\n然後進行解密\r\n\r\n```js\r\n//解密 (等於是把加密後的結果在與KEY做一次XOR)\r\n([\"10100111\", \"10010110\", \"10000000\", \"10000111\"]).map(d => XOR(d, key_));\r\n\r\n//解密後結果 [\"01010100\", \"01100101\", \"01110011\", \"01110100\"]\r\n\r\n// 最後轉為字串\r\n([\"01010100\", \"01100101\", \"01110011\", \"01110100\"]).map(d => String.fromCharCode(parseInt(d, 2))).join('');\r\n// 得到字串:Test\r\n```\r\n\r\n# Stream Ciphers 與 Block Ciphers\r\n\r\n對稱式加密可以使用Stream Ciphers或是Block Ciphers將明文預先進行分段後再進行演算法加密來提高安全性，以及對於不同加密需求時可以使用不同模式 \$ 例如當明文長度大於 AES 的 128 bits 限制時，可以用區塊加密將其切割 \$。\r\n\r\n> 可以在Node.js使用 crypto.getCiphers\$\$ 來查看可用之加密方法。\r\n\r\n#### 1.Stream Ciphers\r\n\r\nStream Ciphers \$ 資料流加密 \$ 並不會將明文切分為區段，而是一次加密一個資料流的位元或是位元組。常見的作法是將較短的加密鑰匙延展成為無限長、近似亂碼的一長串金鑰串流 \$ keystream \$，再將金鑰串流和原始資料（ plaintext ）經過XOR運算後，產生密文資料（ cipher text ）。\r\n\r\nStream Ciphers 被用在視訊串流或行動通訊等領域。使用Stream Cipher 之加密演算法例如： A5/1、RC4\r\n\r\n由於它可以用硬體來實作，在以前CPU運作速度不夠快的時代比較流行。\r\n\r\n```\r\n1.金鑰長度無法和串流明文一樣長\r\n2.金鑰產生金鑰串流\r\n3.金鑰串流不能重複\r\n```\r\n\r\n#### 2.Block Ciphers\r\n\r\nBlock Ciphers \$ 區段加密 \$ 會將明文分成數個n個字元或位元的區段，並且對每一個區段資料使用相同的演算法和密鑰加密。\r\n\r\n一開始會把明文先拆開成區塊，然後第一個區塊先進行加密演算法後得到密文，之後這個密文再繼續跟後續區塊做計算。\r\n\r\n假設M為明文，其將分割成M1、M2… Mn區段，然後K為密鑰，其可表示為 : E\$M,K\$=E\$M1,K\$.E\$M2,K\$…..E\$Mn,K\$\r\n\r\n較適合對已知加密檔案內容的檔案進行加密。\r\n\r\n> 參考至:[https://security.stackexchange.com/a/345](https://security.stackexchange.com/a/345)\r\n\r\n以下先介紹比較早期發展的四種區塊加密方式：ECB、CBC、CFB和OFB\r\n\r\n#### ECB\r\n\r\n最簡單的加密模式即為（Electronic codebook，ECB）模式。需要加密的訊息按照設定的大小被分為數個區塊，並對每個區塊進行獨立加密。但缺點在於同樣的明文區塊會被加密成相同的密文區塊，並且重複使用同一把金鑰，因此並不推薦用於現代的加密協定中。\r\n\r\n> ![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/1202px-ECB_encryption.svg.png)\r\n>\r\n> [https://en.wikipedia.org/wiki/Block\\_cipher\\_mode\\_of\\_operation](https://en.wikipedia.org/wiki/Block_cipher_mode_of_operation)\r\n\r\n過程主要為\r\n\r\n```\r\n將要加密的明文 ( plaintext ) 分為多個區塊，並用同一支金鑰進行加密的動作。\r\n```\r\n\r\n#### CBC\r\n\r\n全名為Cipher-block chaining，為區塊加密中最常用的模式，在CBC模式中，每個明文區塊先與前一個密文區塊進行XOR後，再進行加密，也就是將前一個區塊加密後的結果作為加密第二個區塊的輸入。在這種方法中，每個密文塊都依賴於它前面的所有明文區塊。並且，其會要求輸入一個初始向量，該初始向量會先跟第一個明文區塊做XOR。\r\n\r\n主要缺點在於加密過程是依序進行的，無法同時進行，所以速度較慢，並且加密訊息必須被填充到區塊大小的整數倍，但其解密是可以並行運算的。\r\n\r\n> 其加密過程如下圖\r\n>\r\n> ![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/1202px-CBC_encryption.svg.png)\r\n>\r\n> [https://en.wikipedia.org/wiki/Block\\_cipher\\_mode\\_of\\_operation](https://en.wikipedia.org/wiki/Block_cipher_mode_of_operation)\r\n\r\n```\r\n1. 初始向量 IV (註2) 與 Plaintext 做 XOR 之後再和金鑰進行演算法加密\r\n2. 然後第上一步驟的結果與下一個區塊的 Plaintext 做 XOR 之後再和金鑰進行演算法加密\r\n3. 重複上一步驟直到所有內容加密完成\r\n```\r\n\r\n#### CFB\r\n\r\n類似剛才提到的CBC模式，前一部分的明文改變將會影響到接下來加密出的密文，其將區塊加密變為可自行同步的串流加密法，如果部分的cipher text在傳輸過程遺失，也不會導致所有原始訊息遺失，仍然可以繼續解密出剩下的訊息，且訊息無需進行填充到一定長度，\r\n\r\n其加密過程如下圖\r\n\r\n![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/1202px-CFB_encryption.svg.png)\r\n\r\n> [https://en.wikipedia.org/wiki/Block\\_cipher\\_mode\\_of\\_operation](https://en.wikipedia.org/wiki/Block_cipher_mode_of_operation#Cipher_Feedback_%28CFB\\)\r\n\r\n過程大致如下\r\n\r\n```txt\r\n1. IV 直接加入金鑰並進行演算法加密\r\n2. 將第一步驟的結果與 plain text 進行 XOR 的運算\r\n3. 將第二個步驟所產生的結果作為下一回合的輸入\r\n4. 重複上一步驟直到所有內容加密完成\r\n```\r\n\r\n#### OFB\r\n\r\n全名為（Output feedback， OFB）可以將區塊加密變成同步的串流加密法。IV與Key產生出block cipher encryption後與明文進行XOR，得到密文。與其它串流加密法一樣，密文中一個 bit 的翻轉會使明文中同樣位置的bit 也產生翻轉。這種特性使得許多[錯誤校正碼](http://www.wikiwand.com/zh-mo/前向錯誤更正)，例如[奇偶校驗位](http://www.wikiwand.com/zh-mo/奇偶校验位)，在加密前計算與加密後進行校驗均可得出正確結果。\r\n\r\n由於XOR操作的對稱性，加密和解密操作是完全相同的：\r\n\r\n> ![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/1202px-OFB_encryption.svg.png)[https://en.wikipedia.org/wiki/Block\\_cipher\\_mode\\_of\\_operation](https://en.wikipedia.org/wiki/Block_cipher_mode_of_operation)\r\n\r\n```\r\n1. IV 直接加入金鑰並進行演算法加密\r\n2. 將第一步驟的結果與 plain text 進行 XOR 的運算 \r\n3. 將第一步驟所產生的結果作為下一回合的輸入\r\n4. 重複上一步驟直到所有內容加密完成\r\n```\r\n\r\n#### CTR\r\n\r\n稱為Counter mode，CTR模式也稱為計數器模式，每個區塊對應一個累加的計數器，通過計數器來生成加密密鑰串流，計數器可以是任意保證長時間不產生重複輸出的函數。下圖的Nonce加上Counter當做一個改變的數值，Nonce和前面幾種模式的IV類似，每次加密都需要隨機生成。而計數器Counter是累加的。CTR模式特點是每組加密都是獨立的，不依賴前一組，所以可以進行並行計算。\r\n\r\n在計數器模式下，我們先對一個累加的計數器進行加密，再用加密後的bits序列與明文分組進行 XOR 得到密文。\r\n\r\n> ![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/1202px-CTR_encryption_2.svg.png)[https://en.wikipedia.org/wiki/Block\\_cipher\\_mode\\_of\\_operation](https://en.wikipedia.org/wiki/Block_cipher_mode_of_operation)\r\n\r\n另外有兩種區塊加密法與CTR相關\r\n\r\n```\r\n1. GCM: GCM中的G就是指GMAC，C就是指上述的CTR。\r\n2. CCM: CCM為CMAC認證算法結合CTR。\r\n```\r\n\r\n而四種方式的比較與選擇可參考：[https://stackoverflow.com/a/1220869](https://stackoverflow.com/a/1220869)\r\n\r\n# Node.js中的對稱式加密相關函式\r\n\r\n主要包含\r\n\r\n```\r\ncrypto.createCipher()\r\ncrypto.createCipheriv()\r\n```\r\n\r\n其中createCipher是輸入密碼，而createCipheriv需輸入key與iv值\r\n\r\n> 例如cbc等需要iv的也可以用createCipher並輸入密碼，因為它會自動衍生出iv與key參考下面程式\r\n>\r\n> [https://gist.github.com/bnoordhuis/2de2766d3d3a47ebe41aaaec7e8b14df](https://gist.github.com/bnoordhuis/2de2766d3d3a47ebe41aaaec7e8b14df)\r\n\r\n---\r\n\r\n#### 註1: XOR\r\n\r\n\$ 兩兩數值相同為否，而數值不同時為真 \$: 例如1 xor 1為 0 ， 1 xor 0 為 1\r\n\r\nF\$false\$亦代表0，T\$true\$亦代表1\r\n\r\n![](https://easonwang01.gitbooks.io/blockchain-and-cryptography/content/assets/2333.png)\r\n\r\n至於為何要使用XOR在對稱式加密，不使用AND或OR，可參考:[https://stackoverflow.com/a/24731845](https://stackoverflow.com/a/24731845)\r\n\r\n#### 註2: IV 初始向量\r\n\r\n通常是一個亂數，讓攻擊者難以對同一把金鑰產生的密文進行破解，會加入區塊加密中一起進行加密運算。\r\n\r\n[https://zh.wikipedia.org/wiki/初始向量](https://zh.wikipedia.org/wiki/初始向量)\r\n\r\n\r\n\r\n# AES\r\n\r\nAdvanced Encryption Standard，縮寫：AES，又稱Rijndael加密法，但嚴格來說AES和Rijndael加密法並不完全一樣，因為Rijndael加密法可以支援更大範圍的區塊長度，AES的區塊長度固定為128位元而Rijndael使用的區塊長度可以是128，192或256位元。AES用來替代原先的DES。\r\n\r\nAES的區塊長度固定為128位元，金鑰長度則可以是128，192或256位元；而Rijndael使用的金鑰和區塊長度均可以是128，192或256位元。\r\n\r\nAES加密過程是在一個4×4的位元組矩陣上運作，其初值即為一個明文區塊，矩陣中一個元素大小就是明文區塊中的一個Byte。\r\n\r\n其加密方法主要包含四個步驟\r\n\r\n```\r\n1. AddRoundKey: 將每個狀態中的位元組與該回合金鑰做異或（⊕）。\r\n2. SubBytes: 矩陣中各位元組被固定的8位元尋找表中對應的特定位元組所替換。\r\n3. ShiftRows: 矩陣中每一行的各個位元組循環向左方位移。位移量則隨著行數遞增而遞增。\r\n4. MixColumns: 每個直行與 AES 定義的多項式 c(x) 進行多項式乘法。\r\n```\r\n\r\n> 以上參考至: [https://en.wikipedia.org/wiki/Advanced\\_Encryption\\_Standard](https://en.wikipedia.org/wiki/Advanced_Encryption_Standard)\r\n\r\n#### AES-256 範例\r\n\r\n```js\r\nconst crypto = require('crypto');\r\n\r\nconst mode = 'aes256' // 可更換為aes128或aes192等等\r\n\r\n// 加密\r\nconst cipher = crypto.createCipher(mode, 'a password');\r\nlet encrypted = cipher.update('I_am_plaintext', 'utf8', 'hex');\r\nencrypted += cipher.final('hex');\r\nconsole.log(encrypted);\r\n\r\n// 解密\r\nconst decipher = crypto.createDecipher(mode, 'a password');\r\nlet decrypted = decipher.update(encrypted, 'hex', 'utf8');\r\ndecrypted += decipher.final('utf8');\r\nconsole.log(decrypted);\r\n```\r\n\r\n# AES之區塊加密模式\r\n\r\n> 在CBC、OFB、CFB、CTR等區塊模式 IV 長度均為 16 bytes，GCM模式的 IV 則沒有一定要 16 bytes\r\n\r\n#### AES-256-CBC範例\r\n\r\n```js\r\nconst crypto = require('crypto');\r\n\r\n// 因為aes-256要求之key 長度為256bits 也就是32 bytes = 32個ASCII英文字母\r\n// aes-128 要求之key 長度為128bits 也就是16 bytes = 16個英文字母\r\nlet key = Buffer.from(\"abcbbbbbbbbbbbbbabcbbbbbbbbbbbbb\", 'utf-8') //or crypto.randomBytes(32);\r\n\r\nconst IV_LENGTH = 16; \r\n\r\nfunction encrypt(text) {\r\n let iv = crypto.randomBytes(IV_LENGTH);\r\n // 可直接替換為ofb、cfb、ctr等模式\r\n let cipher = crypto.createCipheriv('aes-256-cbc', new Buffer(key), iv);\r\n let encrypted = cipher.update(text);\r\n encrypted = cipher.final();\r\n\r\n // 將IV附上在解密時須告知\r\n return iv.toString('hex') + ':' + encrypted.toString('hex');\r\n}\r\n\r\nfunction decrypt(text) {\r\n let textParts = text.split(':');\r\n let iv = new Buffer(textParts.shift(), 'hex');\r\n let encryptedText = new Buffer(textParts.join(':'), 'hex');\r\n let decipher = crypto.createDecipheriv('aes-256-cbc', new Buffer(key), iv);\r\n let decrypted = decipher.update(encryptedText);\r\n\r\n decrypted = decipher.final();\r\n\r\n return decrypted.toString();\r\n}\r\n\r\nconsole.log(encrypt(\"test\"));\r\nconsole.log(decrypt(encrypt(\"test\")))\r\n```\r\n\r\n#### AES-256-GCM範例\r\n\r\n> 需要加上cipher.getAuthTag\$\$; 與 decipher.setAuthTag\$\$;\r\n\r\n目前 AuthTag 與 Additional Authenticated Data \$ AAD \$ 在 Node.js 只有 GCM 模式支援，cipher.setAAD需要在 update\$\$ 之前使用，而 cipher.getAuthTag\$\$ 必須要在[`cipher.final()`](https://nodejs.org/api/crypto.html#crypto_cipher_final_outputencoding)執行後才能使用。\r\n\r\n```js\r\nconst crypto = require('crypto');\r\n\r\n\r\nconst mode = 'aes-256-gcm';\r\n// 因為aes-256要求之key 長度為256bits 也就是32 bytes = 32個ASCII英文字母\r\n// aes-128 要求之key 長度為128bits 也就是16 bytes = 16個英文字母\r\nlet key = Buffer.from(\"abcbbbbbbbbbbbbbabcbbbbbbbbbbbbb\", 'utf-8') //or crypto.randomBytes(32);\r\n\r\nconst IV_LENGTH = 12;\r\nlet tag;\r\n\r\nfunction encrypt(text) {\r\n let iv = crypto.randomBytes(IV_LENGTH);\r\n\r\n let cipher = crypto.createCipheriv(mode, new Buffer(key), iv);\r\n let encrypted = cipher.update(text, 'utf8', 'hex');\r\n encrypted += cipher.final('hex');\r\n // 需要加上AuthTag\r\n tag = cipher.getAuthTag();\r\n // 將IV附上在解密時須告知\r\n return iv.toString('hex') + ':' + encrypted.toString('hex');\r\n}\r\n\r\nfunction decrypt(text) {\r\n let textParts = text.split(':');\r\n let iv = new Buffer(textParts.shift(), 'hex');\r\n let encryptedText = new Buffer(textParts.join(':'), 'hex');\r\n let decipher = crypto.createDecipheriv(mode, new Buffer(key), iv);\r\n // 需要加上AuthTag\r\n decipher.setAuthTag(tag);\r\n let decrypted = decipher.update(encryptedText, 'hex', 'utf8');\r\n decrypted += decipher.final('utf8');\r\n\r\n return decrypted.toString();\r\n}\r\n\r\nconsole.log(encrypt(\"test\"));\r\nconsole.log(decrypt(encrypt(\"test\")))\r\n```\r\n\r\n> 其他Node.js的相關範例可參考\r\n>\r\n> [https://github.com/nodejs/node-v0.x-archive/blob/master/test/simple/test-crypto-authenticated.js\\#L44-L64](https://github.com/nodejs/node-v0.x-archive/blob/master/test/simple/test-crypto-authenticated.js#L44-L64)\r\n\r\n# OpenSSL範例\r\n\r\n產生範例檔案\r\n\r\n```\r\necho test > file.txt\r\n```\r\n\r\n加密\$執行後會要求輸入密碼\$\r\n\r\n```\r\nopenssl enc -aes-256-cbc -salt -in file.txt -out file.txt.enc\r\n```\r\n\r\n解密\$執行後會要求輸入剛才加密的密碼\$\r\n\r\n```\r\nopenssl enc -aes-256-cbc -d -in file.txt.enc -out result.txt\r\n```","title","个人的一些 Node.js Crypto 与 OpenSSL 密码学笔记分享","last_reply_at","2021-05-12 04:23:12.191","good",true,"top",8,"visit_count",15670,"2018-08-04 02:22:40.832","author",{"_13":55,"_22":56},"EasonWang01","https://avatars.githubusercontent.com/u/11001914?v=4"]