Note: After being posted here, most technical reports go through revisions for publications in conference proceedings and/or journals.

• J. Adikari, M. A. Hasan and C. Negre, “Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over F_{2^{1223}},” CACR 2012-23, November 2012.

• M. Cenk, A. Alrefai, C. Negre and M. Anwar Hasan, “A New Approach to Low Complexity Binary Elliptic Curve Arithmetic,” CACR 2012-16, August 2012.

• M. A. Hasan and C. Negre, “Sequential Multiplier with Sub-linear Complexity,” CACR 2012-13, June 2012.

• A. Barsoum and M. A. Hasan, “Enabling Data Dynamic and Indirect Mutual Trust for Cloud Computing Storage Systems,” CACR 2012-05, May 2012.

• P. Tysowski and M. A. Hasan, “Towards Secure Communication for Highly Scalable Mobile Applications in Cloud Computing Systems,” CACR 2011-33, October 2011.

• M. Cenk, C. Negre and M. A. Hasan, "Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products, CACR 2011-30, August 2011.

• A. Barsoum and M. A. Hasan, “On Verifying Dynamic Multiple Data Copies over Cloud Servers,” CACR 2011-28, August 2011.

• A. Alkhoraidly and M. A. Hasan, “Adaptive Error Recovery for Transient Faults in Elliptic Curve Scalar Multiplication,” CACR 2011-23, August 2011.

• C. Moreno and M. A. Hasan, “Fast SPA-Resistant Exponentiation Through Simultaneous Processing of Half-Exponents,” CACR 2011-13, May 2011.

• C. Moreno and M. A. Hasan, “SPA-Resistant Binary Exponentiation with Optimal Execution Time,” CACR 2011-03, February 2011.

• A. Barsoum and M. A. Hasan, “On Data Replication and Storage Security over Cloud Computing: Are we getting what we are paying for?” CACR 2010-32, Dec. 2010.

• M. A. Hasan, A. H. Namin and C. Negre, “New Complexity Results for Field Multiplication using Optimal Normal Bases and Block Recombination,” CACR 2010-19, Aug. 2010.

• C. Moreno and M. A. Hasan, “An Adaptive Idle-Wait Countermeasure against Timing Attacks on Public-Key Cryptography,” CACR 2010-16, June 2010.

• A. Barsoum and M. A. Hasan, “On Implementation of Quadratic and Sub-Quadratic Complexity Multipliers using Type II Optimal Normal Bases,” CACR 2010-13, June 2010.

• M. A. Hasan, N. Meloni, A. Namin and C. Negre, “Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication based on Toeplitz Matrix-Vector Product ,” CACR 2010-12, May 2010.

• A. Namin, G. Li, J. Wu, J. Xu, Y. Huang, O. Nam, R. Elbaz and M. A. Hasan, “FPGA Implementation of CubeHash, Grostel, JH, and SHAvite-3 Hash Functions ,” CACR 2010-04, Feb. 2010.

• N. Méloni, C. Négre and M. A. Hasan, “High Performance GHASH Function for Long Messages,” CACR 2010-02, Jan. 2010.

• A. Dominguez-Oviedo, M. A. Hasan and B. Ansari, “Fault-Based Attack on Montgomery's Ladder ECSM Algorithm,” 35 pages, CACR 2009-32, 2009.

• A.H. Namin and M.A. Hasan, "Hardware implementation of the compression function for selected SHA-3 candidates," CACR 2009-28, July 2009. Addendum: Appendix B

• N. Méloni and M. A. Hasan, "Exponentiation Using a Large-Digit Representation and ECC Applications," CACR 2009-14, Mar. 2009.

• N. Méloni and M. A. Hasan, "Elliptic Curve Point Scalar Multiplication Combining Yao's Algorithm and Double Bases," CACR 2009-13, Mar. 2009.

• M. A. Hasan and C. Negre, "Subquadratic Space Complexity Multiplier for a Class of Binary Fields using Toepliz Matrix Approach," CACR 2009-11, March 2009.

• A. Alkhoraidly and M. A. Hasan, "Error Detection and Recovery for Transient Faults in Elliptic Curve Cryptosystems," CACR 2009-06 , Jan. 2009.

• A. Dominguez-Oviedo and M. A. Hasan, “Algorithm-level Error Detection for ECSM,” CACR 2009-05, Jan. 2009.

Click here for earlier reports.