pcpmontred.c 2.5 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364
  1. /*
  2. * Copyright (C) 2016 Intel Corporation. All rights reserved.
  3. *
  4. * Redistribution and use in source and binary forms, with or without
  5. * modification, are permitted provided that the following conditions
  6. * are met:
  7. *
  8. * * Redistributions of source code must retain the above copyright
  9. * notice, this list of conditions and the following disclaimer.
  10. * * Redistributions in binary form must reproduce the above copyright
  11. * notice, this list of conditions and the following disclaimer in
  12. * the documentation and/or other materials provided with the
  13. * distribution.
  14. * * Neither the name of Intel Corporation nor the names of its
  15. * contributors may be used to endorse or promote products derived
  16. * from this software without specific prior written permission.
  17. *
  18. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  19. * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  20. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  21. * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  22. * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  23. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  24. * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  25. * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  26. * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  27. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  28. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  29. *
  30. */
  31. #include "owncp.h"
  32. #include "pcpbnuarith.h"
  33. void cpMontRedAdc_BNU(BNU_CHUNK_T* pR,
  34. BNU_CHUNK_T* pProduct,
  35. const BNU_CHUNK_T* pModulus, cpSize nsM, BNU_CHUNK_T m0)
  36. {
  37. BNU_CHUNK_T carry;
  38. BNU_CHUNK_T extension;
  39. cpSize n;
  40. for(n=0, carry = 0; n<(nsM-1); n++) {
  41. BNU_CHUNK_T u = pProduct[n]*m0;
  42. BNU_CHUNK_T t = pProduct[nsM +n +1] + carry;
  43. extension = cpAddMulDgt_BNU(pProduct+n, pModulus, nsM, u);
  44. ADD_AB(carry, pProduct[nsM+n], pProduct[nsM+n], extension);
  45. t += carry;
  46. carry = t<pProduct[nsM+n+1];
  47. pProduct[nsM+n+1] = t;
  48. }
  49. m0 *= pProduct[nsM-1];
  50. extension = cpAddMulDgt_BNU(pProduct+nsM-1, pModulus, nsM, m0);
  51. ADD_AB(extension, pProduct[2*nsM-1], pProduct[2*nsM-1], extension);
  52. carry |= extension;
  53. carry -= cpSub_BNU(pR, pProduct+nsM, pModulus, nsM);
  54. /* condition copy: R = carry? Product+mSize : R */
  55. MASKED_COPY_BNU(pR, carry, pProduct+nsM, pR, nsM);
  56. }