Application/OS Security

1. "Vanish: Increasing Data Privacy with Self-Destructing Data", Roxana Geambasu, Tadayoshi Kohno, Amit Levy, Henry M. Levy
Link

2. "Overshadow: A Virtualization-Based Approach to Retrofitting Protection in Commodity Operating Systems", Xiaoxin Chen, Tal Garfinkel, E. Christopher Lewis, Pratap Subrahmanyam, Carl A. Waldspurger, Dan Boneh, Jeffrey Dwoskin, and Dan R. K. Ports
Link | Citations

Addition Chains [Lower bounds]

1. "On Addition Chains l(mn) <= l(n) - b and lower bounds for c(r)", Edward G. Thurber
Link | Citations

Bug Finding [Format String, EXE, MOPS, SWATT, Static Analysis, Undefined Value Errors]

1. "Detecting Format String Vulnerabilities with Type Qualifiers", Umesh Shankar, Kunal Talwar, Jeffrey S. Foster and David Wagner
Link | Citations

2. "EXE - Automatically Generating Inputs of Death", Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, David L. Dill, Dawson R
Link | Citations

3. "MOPS - an Infrastructure for Examining Security Properties of Software", Hao Chen, David Wagner
Link | Citations

4. "SWATT - software based attestation for embedded devices", Arvind Seshadri, Adrian Perrig, Leendert van Doorn and Pradeep Khosla
Link | Citations

5. "Thorough Static Analysis of Device Drivers", Thomas Ball, Ella Bounimova, Byron Cook, Vladimir Levin, Jakob Lichtenberg, Con McGarvey, Bohus Ondrusek, Sriram K. Rajamani, and Abdullah Ustuner
Link | Citations

6. "Using Valgrind to detect undefined value errors with bit-precision", Julian Seward and Nicholas Nethercote
Link | Citations

Montgomery Multiplication [Version, Hardware algorithm, Improved, Comparison, Multi-precision, Versatile]

1. "A Complexity-Effective Version of Montgomery’s Algorihm", Viktor Bunimov, Manfred Schimmler, Boris Tolg
Link | Citations

2. "A Hardware Algorithm for Modular Multiplication/Division", Marcelo E. Kaihara and Naofumi Takagi
Link | Citations

3. "An Energy-Efficient Reconfigurable Public-Key Cryptography Processor", James Goodman and Anantha P. Chandrakasan
Link | Citations

4. "An Improved Montgomery’s Algorithm for High-Speed RSA Public-Key Cryptosystem", Chih-Yuang Su, Shih-Arn Hwang, Po-Song Chen, and Cheng-Wen Wu
Link | Citations

5. "Comparison of three modular reduction functions", Antoon Bosselaers, Rene Govaerts and Joos Vandewalle
Link | Citations

6. "Montgomery Algorithm for Modular Multiplication", D. J Guan
Link | Citations

7. "On multiple precision based Montgomery Multiplication without Pre-computation of No’ = -Ni^(-1) mod W", H. Ploog, D. Timmermann
Link

8. "Versatile Montgomery Multiplier Architectures", Gunnar Gaubatz
Link | Citations

Multiplication Method [Classical, Comba]

1. "Instruction Set Extensions for Fast Arithmetic in Finite Fields GF(p) and GF(2m)", Johann Großschädl and Erkay Savaş
Link

Montgomery multiplication [Optimization, Approaches]

1. "Energy-Efficient Software Implementation of Long Integer Modular Arithmetic", Johann Großschadl, Roberto M. Avanzi, Erkay Savas, and Stefan Tillich
Link | Citations

2. "Parallel Cryptographic Arithmetic Using a Redundant Montgomery Representation", Daniel Page and Nigel P. Smart
Link | Citations

3. "Fast Machine Code for Modular Multiplication", Michael Scott
Link | Citations

4. "Comparison of Methods for Modular Exponentiation on 32-bit Intel 80x86 processors", Michael Scott
Link | Citations

Efficient Multiplication [Comba, Montgomery, RNS, Carry-Save Adders, Exponentiation]

1. "Multi-Operand Modulo Addition Using Carry Save Adders", C. K. Koc and C. Y. Hung
Link | Citations

2. "Carry-Save Adders for Computing the Product AB modulo N", C. K. Koc and C. Y. Hung
Link | Citations

3. "An RNS Montgomery Modular Multiplication Algorithm", Jean-Claude Bajard, Laurent-Stephane Didier and Peter Kornerup
Link | Citations

4. "Montgomery exponentiation needs no final subtractions", C. D. Walter
Link | Citations

5. "A Computer Algorithm for Calculating the Product AB Modulo M", G. R. Blakley
Link | Citations

6. "Montgomery's multiplication technique - How to make it smaller and faster", Colin D. Walter
Link | Citations

7. "Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs", Nils Gura, Arun Patel, Arvinerpal Wander, Hans Eberle, Sheueling Chang Shantz
Link | Citations

8. "Enhanced Montgomery Multiplication", Shay Gueron
Link | Citations

9. "Fast Modular Exponentiation", Omer Egecioglu and Cetin K. Koc
Link | Citations

10. "On the evaluation of Powers", Andrew C. Yao
Link | Citations

11. "Exponentiation cryptosystems on the IBM PC", P. G. Comba
Link | Citations