libfplll-dev 4.0.4-2 / usr / include / fplll / util.h

/* Copyright (C) 2005-2008 Damien Stehle.
   Copyright (C) 2007 David Cade.
   Copyright (C) 2011 Xavier Pujol.

   This file is part of fplll. fplll is free software: you
   can redistribute it and/or modify it under the terms of the GNU Lesser
   General Public License as published by the Free Software Foundation,
   either version 2.1 of the License, or (at your option) any later version.

   fplll is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
   GNU Lesser General Public License for more details.

   You should have received a copy of the GNU Lesser General Public License
   along with fplll. If not, see <http://www.gnu.org/licenses/>. */
/** \file util.h
    Miscellaneous. */

#ifndef FPLLL_UTIL_H
#define FPLLL_UTIL_H

#include "matrix.h"

FPLLL_BEGIN_NAMESPACE

static inline int cputime() {
#ifdef FPLLL_WITH_GETRUSAGE
  struct rusage rus;
  getrusage(RUSAGE_SELF, &rus);
  return rus.ru_utime.tv_sec * 1000 + rus.ru_utime.tv_usec / 1000;
#else
  return time(NULL) * 1000;
#endif
}

/* Computes result = x * m (it is not required that result is initialized,
   x.size() must be equal to m.GetNumRows()) */
template<class ZT>
void vectMatrixProduct(vector<ZT>& result, const vector<ZT>& x, const Matrix<ZT>& m) {
  int nRows = m.getRows(), nCols = m.getCols();
  genZeroVect(result, nCols);
  for (int i = 0; i < nRows; i++)
    for (int j = 0; j < nCols; j++)
      result[j].addmul(x[i], m(i, j));
}

/* Computes result = x * m (it is not required that result is initialized,
   x.size() must be equal to m.GetNumRows()) */
template<class ZT>
void vectMatrixProduct(NumVect<ZT>& result, const NumVect<ZT>& x, const Matrix<ZT>& m) {
  int nRows = m.getRows(), nCols = m.getCols();
  result.gen_zero(nCols);
  for (int i = 0; i < nRows; i++)
    for (int j = 0; j < nCols; j++)
      result[j].addmul(x[i], m(i, j));
}

template<class T>
void scalarProduct(T& result, const MatrixRow<T>& v1, const MatrixRow<T>& v2, int n) {
  FPLLL_DEBUG_CHECK(n <= static_cast<int>(v1.size())
          && n <= static_cast<int>(v2.size()));
  T tmp;
  result.mul(v1[0], v2[0]);
  for (int i = 1; i < n; i++) {
    tmp.mul(v1[i], v2[i]);
    result.add(result, tmp);
  }
}

template<class T>
inline void sqrNorm(T& result, const MatrixRow<T>& v, int n) {
  scalarProduct(result, v, v, n);
}

/** Prints x on stream os. */
template<class T>
ostream& operator<<(ostream& os, const Z_NR<T>& x) {
  return os << x.getData();
}

template<>
ostream& operator<<(ostream& os, const Z_NR<mpz_t>& x);

/** Prints x on stream os. */
template<class T>
ostream& operator<<(ostream& os, const FP_NR<T>& x) {
  return os << x.getData();
}

#ifdef FPLLL_WITH_DPE
template<>
ostream& operator<<(ostream& os, const FP_NR<dpe_t>& x);
#endif

template<>
ostream& operator<<(ostream& os, const FP_NR<mpfr_t>& x);

/** Reads x from stream is. */
template<class T>
istream& operator>>(istream& is, Z_NR<T>& x) {
  return is >> x.getData();
}

template<>
istream& operator>>(istream& is, Z_NR<mpz_t>& x);

const double DEF_GSO_PREC_EPSILON = 0.03;

/**
 * Returns the minimum precision required to ensure that error bounds on the
 * GSO are valid. Computes rho such that for all 0 &lt;= i &lt; d and 0 &lt;= j &lt;= i:
 *
 *   |r~_i - r_i| / r_i     <= d * rho ^ (i + 1) * 2 ^ (2 - prec)
 *
 *   |mu~_(i,j) - mu_(i,j)| <= d * rho ^ (i + 1) * 2 ^ (4 - prec)
 */
int gsoMinPrec(double& rho, int d, double delta, double eta,
               double epsilon = DEF_GSO_PREC_EPSILON);

/**
 * Returns the minimum precision for the proved version of LLL.
 */
int l2MinPrec(int d, double delta, double eta, double epsilon);

/**
 * Computes the volume of a d-dimensional hypersphere of radius 1.
 */
void sphereVolume(Float& volume, int d);

/**
 * Estimates the cost of the enumeration for SVP.
 */
void costEstimate(Float& cost, const Float& bound,
                  const Matrix<Float>& r, int dimMax);

#ifdef FPLLL_V3_COMPAT

void gramSchmidt(const IntMatrix& b, Matrix<Float>& mu, FloatVect& rdiag);

template<class ZT>
inline void ScalarProduct(Z_NR<ZT>& s, const Z_NR<ZT>* vec1,
  const Z_NR<ZT>* vec2, int n) {

  Z_NR<ZT> tmp;
  s.mul(vec1[0],vec2[0]);

  for (int i=1;i<n;i++)
    {
      tmp.mul(vec1[i],vec2[i]);
      s.add(s,tmp);
    }
}

inline double fpScalarProduct(double* vec1, double* vec2, int n) {
  int i;
  double sum;

  sum = vec1[0] * vec2[0];
  for (i=1; i<n; i++)
    sum += vec1[i] * vec2[i];

  return sum;
} 

template<class FT>
inline void fpScalarProduct(FP_NR<FT>& result, const FP_NR<FT>* v1,
                            const FP_NR<FT>* v2, int n) {
  result.mul(v1[0], v2[0]);
  for (int i = 1; i < n; i++)
    result.addmul(v1[i], v2[i]);
} 

inline double fpNorm(double* vec, int n) {
  int i;
  double sum;

  sum = vec[0] * vec[0];
  for (i = 1 ; i < n ; i++)
    sum += vec[i]*vec[i];

  return sum;
} 

template<class FT> inline void fpNorm (FP_NR<FT>& s, FP_NR<FT> *vec, int n)
{
  int i;
  FP_NR<FT> tmp;
  
  s.mul(vec[0], vec[0]);
  
  for (i=1; i<n; i++)
    {
      tmp.mul(vec[i], vec[i]);
      s.add(s, tmp);
    }
} 

// Provided for compatibility, do not use
class Lexer {
public:
  Lexer() : is(&cin), fromFile(false) {};
  Lexer(const char* fileName) {
    is = new ifstream(fileName);
  }
  ~Lexer() {
    if (fromFile) delete is;
  }
  template<class T>
  Lexer& operator>>(T& x) {
    *is >> x;
    return *this;
  }
private:
  istream* is;
  bool fromFile;
};

#endif

FPLLL_END_NAMESPACE

#endif