diffieHellman.getPrime() 方法是加密模塊中 diffieHellman 類的內置應用程序編程接口,用於獲取 DiffieHellman (dh) 對象的質數。
用法:
diffieHellman.getPrime([encoding])
參數:該方法將編碼作為參數。
返回值:它以指定的編碼返回 DiffieHellman 素值。如果未提供編碼,則返回緩衝區,否則返回字符串。
範例1:
index.js
// Node.js program to demonstrate the
// diffieHellman.getPrime() method
// Destructure createDiffieHellman method from crypto
const { createDiffieHellman } = require('crypto');
// Instances of the DiffieHellman class
const dh = createDiffieHellman(512);
// Generate dh's Prime
// No encoding specified
// Return Buffer
let dhPrime = dh.getPrime()
console.log('\nIs Buffer return ( encoding not specified ):' +
Buffer.isBuffer(dhPrime)) // true
console.log('Return value:')
console.log(dhPrime)
// Encoding specified
// Return String
dhPrime = dh.getPrime('base64')
console.log('\nIs Buffer return ( encoding specified ):' +
Buffer.isBuffer(dhPrime)) // true
console.log('Return value:')
console.log(dhPrime)
使用以下命令運行index.js文件:
node index.js
輸出:
Is Buffer return ( encoding not specified ):true Return value: <Buffer d9 10 5a 20 70 0e 9c 19 53 1d 74 bc 93 ac 9e 1d 00 65 cb 2b 7f 13 fd b5 67 cd ba 42 69 fc 2c 4c 44 5c 72 a7 45 26 2d d7 ff 2e ee c1 a9 ad 21 bf c4 3a ... 14 more bytes> Is Buffer return ( encoding specified ):false Return value: 2RBaIHAOnBlTHXS8k6yeHQBlyyt/E/21Z826Qmn8LExEXHKnRSYt1/ 8u7sGprSG/xDqF/zTVe5r9vQ+O0Q5PAw==
範例2:
index.js
// Node.js program to demonstrate the
// diffieHellman.getPrime() method
// Destructure createDiffieHellman method from crypto
const { createDiffieHellman } = require('crypto');
// Generate Alice's keys...
const alice = createDiffieHellman(512);
// Generate Alices's Prime
const alicePrime = alice.getPrime();
// Generate Alice's Generator
const aliceGenerator = alice.getGenerator()
// Generate Alice's Key
const aliceKey = alice.generateKeys();
// Generate Bob's keys...
const bob = createDiffieHellman( alicePrime, aliceGenerator );
// Generate Bobs's Prime
const bobPrime = bob.getPrime();
// Generate Bob's Generator
const bobGenerator = bob.getGenerator()
// Generate Bob's Key
const bobKey = bob.generateKeys();
// Exchange and generate the secret...
const aliceSecret = alice.computeSecret(bobKey);
const bobSecret = bob.computeSecret(aliceKey);
let isSymmetric =
aliceSecret.toString('hex') == bobSecret.toString('hex')
console.log( `Is Symmetric key generation
successful:${ isSymmetric }` ); // true
使用以下命令運行index.js文件:
node index.js
輸出:
Is Symmetric key generation successful:true
參考: https://nodejs.org/api/crypto.html#crypto_diffiehellman_getprime_encoding
相關用法
- Node.js console.timeLog()用法及代碼示例
- Node.js x509.toLegacyObject()用法及代碼示例
- Node.js fs.fsyncSync()用法及代碼示例
- Node.js process.nextTick()用法及代碼示例
- Node.js GM charcoal()用法及代碼示例
- Node.js GM blur()用法及代碼示例
注:本文由純淨天空篩選整理自braktim99大神的英文原創作品 Node.js diffieHellman.getPrime() Method。非經特殊聲明,原始代碼版權歸原作者所有,本譯文未經允許或授權,請勿轉載或複製。