text: /* Copyright 2016 Brian Smith.
   *
   * Permission to use, copy, modify, and/or distribute this software for any
   * purpose with or without fee is hereby granted, provided that the above
   * copyright notice and this permission notice appear in all copies.
   *
   * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES
   * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
   * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY
   * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
   * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
   * OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
   * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */
  
  #include "./p256_shared.h"
  
  #include "../../limbs/limbs.h"
  
  #if !defined(OPENSSL_USE_NISTZ256)
  
  typedef Limb ScalarMont[P256_LIMBS];
  typedef Limb Scalar[P256_LIMBS];
  
  #include "../bn/internal.h"
  
  void p256_scalar_mul_mont(ScalarMont r, const ScalarMont a,
                                const ScalarMont b) {
    static const BN_ULONG N[] = {
      TOBN(0xf3b9cac2, 0xfc632551),
      TOBN(0xbce6faad, 0xa7179e84),
      TOBN(0xffffffff, 0xffffffff),
      TOBN(0xffffffff, 0x00000000),
    };
    static const BN_ULONG N_N0[] = {
      BN_MONT_CTX_N0(0xccd1c8aa, 0xee00bc4f)
    };
    /* XXX: Inefficient. TODO: optimize with dedicated multiplication routine. */
    bn_mul_mont(r, a, b, N, N_N0, P256_LIMBS);
  }
  
  /* XXX: Inefficient. TODO: optimize with dedicated squaring routine. */
  void p256_scalar_sqr_rep_mont(ScalarMont r, const ScalarMont a, Limb rep) {
    dev_assert_secret(rep >= 1);
    p256_scalar_mul_mont(r, a, a);
    for (Limb i = 1; i < rep; ++i) {
      p256_scalar_mul_mont(r, r, r);
    }
  }
  
  #endif
  