如何獲得NTRU參數

我使用NTRU的BouncyCastle的的執行力度，這是我的代碼：如何獲得NTRU參數

NTRUEncryptionKeyGenerationParameters ntruEncryptionKeyGenerationParameters = NTRUEncryptionKeyGenerationParameters.EES1087EP2; 
NTRUEncryptionKeyPairGenerator ntruEncryptionKeyPairGenerator = new NTRUEncryptionKeyPairGenerator(); 
ntruEncryptionKeyPairGenerator.init(ntruEncryptionKeyGenerationParameters); 
AsymmetricCipherKeyPair asymmetricCipherKeyPair = ntruEncryptionKeyPairGenerator.generateKeyPair(); 
NTRUEncryptionPrivateKeyParameters ntruEncryptionPrivateKeyParameters = (NTRUEncryptionPrivateKeyParameters) asymmetricCipherKeyPair.getPrivate(); 

NTRUEncryptionPublicKeyParameters ntruEncryptionPublicKeyParameters = (NTRUEncryptionPublicKeyParameters) asymmetricCipherKeyPair.getPublic(); 
NTRUEngine ntruEngine = new NTRUEngine(); 
ntruEngine.init(true, ntruEncryptionPublicKeyParameters);

的問題是我怎麼能得到˚F多項式和基礎，因爲我發現只有FP（逆的f，而且他們沒有反方法）和Basis？我查了javadocs但沒有結果。

來源

2015-04-04 user3038475

您可以從類找到它NTRUEncryptionKeyPairGenerator

public AsymmetricCipherKeyPair generateKeyPair() 
{ 
    int N = params.N; 
    int q = params.q; 
    int df = params.df; 
    int df1 = params.df1; 
    int df2 = params.df2; 
    int df3 = params.df3; 
    int dg = params.dg; 
    boolean fastFp = params.fastFp; 
    boolean sparse = params.sparse; 

    Polynomial t; 
    IntegerPolynomial fq; 
    IntegerPolynomial fp = null; 

    // choose a random f that is invertible mod 3 and q 
    while (true) 
    { 
     IntegerPolynomial f; 

     // choose random t, calculate f and fp 
     if (fastFp) 
     { 
      // if fastFp=true, f is always invertible mod 3 
      t = params.polyType == NTRUParameters.TERNARY_POLYNOMIAL_TYPE_SIMPLE ? Util.generateRandomTernary(N, df, df, sparse, params.getRandom()) : ProductFormPolynomial.generateRandom(N, df1, df2, df3, df3, params.getRandom()); 
      f = t.toIntegerPolynomial(); 
      f.mult(3); 
      f.coeffs[0] += 1; 
     } 
     else 
     { 
      t = params.polyType == NTRUParameters.TERNARY_POLYNOMIAL_TYPE_SIMPLE ? Util.generateRandomTernary(N, df, df - 1, sparse, params.getRandom()) : ProductFormPolynomial.generateRandom(N, df1, df2, df3, df3 - 1, params.getRandom()); 
      f = t.toIntegerPolynomial(); 
      fp = f.invertF3(); 
      if (fp == null) 
      { 
       continue; 
      } 
     } 

     fq = f.invertFq(q); 
     if (fq == null) 
     { 
      continue; 
     } 
     break; 
    } 

    // if fastFp=true, fp=1 
    if (fastFp) 
    { 
     fp = new IntegerPolynomial(N); 
     fp.coeffs[0] = 1; 
    } 

    // choose a random g that is invertible mod q 
    DenseTernaryPolynomial g; 
    while (true) 
    { 
     g = DenseTernaryPolynomial.generateRandom(N, dg, dg - 1, params.getRandom()); 
     if (g.invertFq(q) != null) 
     { 
      break; 
     } 
    } 

    IntegerPolynomial h = g.mult(fq, q); 
    h.mult3(q); 
    h.ensurePositive(q); 
    g.clear(); 
    fq.clear(); 

    NTRUEncryptionPrivateKeyParameters priv = new NTRUEncryptionPrivateKeyParameters(h, t, fp, params.getEncryptionParameters()); 
    NTRUEncryptionPublicKeyParameters pub = new NTRUEncryptionPublicKeyParameters(h, params.getEncryptionParameters()); 
    return new AsymmetricCipherKeyPair(pub, priv); 
}

f爲你以後的多項式。你是什麼意思的基礎？幾乎逆和快速NTRU密鑰創建

https://www.securityinnovation.com/uploads/Crypto/NTRUTech014.pdf

它是通過以下幾個步驟做了優化的F

發現逆：

逆方法在NTRU報告014描述Z/2Z /（x^N-1）
將其擡升至Z/2^rZ /（x^N-1）
重複至2^r = q

來源

2015-04-06 16:23:05

如何獲得NTRU參數

回答

相關問題