tag:blogger.com,1999:blog-46891821705118509742011-08-01T16:31:54.156-04:00Collection of Security/Cryptography related papers <br> (For research/educational use only) <br>Kirti Chawlahttp://www.blogger.com/profile/03389829614982080948noreply@blogger.comBlogger151100tag:blogger.com,1999:blog-4689182170511850974.post-56987391227315196442009-08-31T10:11:00.003-04:002009-08-31T10:18:59.792-04:00<span style="font-family:lucida grande;">1. "<span style="font-style: italic;">Vanish: Increasing Data Privacy with Self-Destructing Data</span>", Roxana Geambasu, Tadayoshi Kohno, Amit Levy, Henry M. Levy</span><br /><a style="font-family: lucida grande;" href="http://vanish.cs.washington.edu/pubs/usenixsec09-geambasu.pdf">Link</a><span style="font-family:lucida grande;"><br /><br /></span><span style="font-family:lucida grande;">2. "<span style="font-style: italic;">Overshadow: A Virtualization-Based Approach to Retrofitting Protection in Commodity Operating Systems</span>", Xiaoxin Chen, Tal Garfinkel, E. Christopher Lewis, Pratap Subrahmanyam, Carl A. Waldspurger, Dan Boneh, Jeffrey Dwoskin, and Dan R. K. Ports<br /></span><a style="font-family: lucida grande;" href="http://drkp.net/drkp/papers/overshadow-asplos08.pdf">Link</a><span style="font-family:lucida grande;"> | <a href="http://scholar.google.com/scholar?cites=14636613934886628443&amp;hl=en">Citations</a><br /></span><span style="font-family:lucida grande;"><br /></span><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/4689182170511850974-5698739122731519644?l=nanocrypto.blogspot.com' alt='' /></div>Kirti Chawlahttp://www.blogger.com/profile/03389829614982080948noreply@blogger.com0tag:blogger.com,1999:blog-4689182170511850974.post-80176972203596452092008-10-10T14:20:00.002-04:002009-10-10T11:47:37.507-04:00<span style="font-family: lucida grande;">1. "<span style="font-style: italic;">On Addition Chains l(mn) &lt;= l(n) - b and lower bounds for c(r)</span>", Edward G. Thurber</span><br /><a href="http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.dmj/1077310068" style="font-family: lucida grande;">Link</a><span style="font-family: lucida grande;"> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=17403519792858630627">Citations</a><br /></span><span style="font-family: lucida grande;"></span><span style="font-family: lucida grande;"><br /></span><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/4689182170511850974-8017697220359645209?l=nanocrypto.blogspot.com' alt='' /></div>Kirti Chawlahttp://www.blogger.com/profile/03389829614982080948noreply@blogger.com0tag:blogger.com,1999:blog-4689182170511850974.post-79719648746217177902008-08-27T15:10:00.006-04:002009-10-10T11:52:43.894-04:00<span style="font-family: lucida grande;">1. "<span style="font-style: italic;">Detecting Format String Vulnerabilities with Type Qualifiers</span>", Umesh Shankar, Kunal Talwar, Jeffrey S. Foster and David Wagner</span><br /><a href="http://www.eecs.berkeley.edu/%7Edaw/papers/fmtstr-use01.pdf" style="font-family: lucida grande;">Link</a><span style="font-family: lucida grande;"> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=303546120644348415">Citations</a><br /><br /></span><span style="font-family: lucida grande;">2. "<span style="font-style: italic;">EXE - Automatically Generating Inputs of Death</span>", Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, David L. Dill, Dawson R</span><br /><a href="http://stanford.edu/%7Eengler/exe-ccs-06.pdf" style="font-family: lucida grande;">Link</a><span style="font-family: lucida grande;"> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=9496506092803325813">Citations</a><br /><br /></span><span style="font-family: lucida grande;">3. "<span style="font-style: italic;">MOPS - an Infrastructure for Examining Security Properties of Software</span><span style="font-style: italic;"></span>", Hao Chen, David Wagner</span><br /><a href="http://www.eecs.berkeley.edu/%7Edaw/papers/mops-ccs02.pdf" style="font-family: lucida grande;">Link</a><span style="font-family: lucida grande;"> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=15163615016091413291">Citations</a><br /><br /></span><span style="font-family: lucida grande;">4. "<span style="font-style: italic;">SWATT - software based attestation for embedded devices</span>", Arvind Seshadri, Adrian Perrig, Leendert van Doorn and Pradeep Khosla</span><br /><a href="http://www.paramecium.org/%7Eleendert/publications/swatt.pdf" style="font-family: lucida grande;">Link</a><span style="font-family: lucida grande;"> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=388806716952992131">Citations</a><br /><br /></span><span style="font-family: lucida grande;">5. "<span style="font-style: italic;">Thorough Static Analysis of Device Drivers</span>", Thomas Ball, Ella Bounimova, Byron Cook, Vladimir Levin, Jakob Lichtenberg, Con McGarvey, Bohus Ondrusek, Sriram K. Rajamani, and Abdullah Ustuner</span><br /><a href="http://www.cs.kuleuven.be/conference/EuroSys2006/papers/p73-ball.pdf" style="font-family: lucida grande;">Link</a><span style="font-family: lucida grande;"> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=2516716288445545972">Citations</a><br /><br /></span><span style="font-family: lucida grande;">6. "<span style="font-style: italic;">Using Valgrind to detect undefined value errors with bit-precision</span>", Julian Seward and Nicholas Nethercote</span><br /><a href="http://valgrind.org/docs/memcheck2005.pdf" style="font-family: lucida grande;">Link</a><span style="font-family: lucida grande;"> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=17683752354701631123">Citations</a><br /></span><span style="font-family: lucida grande;"></span><span style="font-family: lucida grande;"><br /></span><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/4689182170511850974-7971964874621717790?l=nanocrypto.blogspot.com' alt='' /></div>Kirti Chawlahttp://www.blogger.com/profile/03389829614982080948noreply@blogger.com0tag:blogger.com,1999:blog-4689182170511850974.post-53111721029213490702008-08-22T15:01:00.006-04:002009-10-10T11:58:56.428-04:00<span style="font-family: lucida grande;">1. "<span style="font-style: italic;">A Complexity-Effective Version of Montgomery’s Algorihm</span>", Viktor Bunimov, Manfred Schimmler, Boris Tolg</span><br /><a href="http://www.ece.rochester.edu/%7Ealbonesi/wced02/papers/bunimov.pdf" style="font-family: lucida grande;">Link</a><span style="font-family: lucida grande;"> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=3158121452681751761">Citations</a><br /><br /></span><span style="font-family: lucida grande;">2. "<span style="font-style: italic;">A Hardware Algorithm for Modular Multiplication/Division</span>", Marcelo E. Kaihara and Naofumi Takagi</span><br /><a href="http://documents.epfl.ch/users/k/ka/kaihara/www/papers/ModMulDiv_Binary.pdf" style="font-family: lucida grande;">Link</a><span style="font-family: lucida grande;"> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=1909818936866975256">Citations</a><br /><br /></span><span style="font-family: lucida grande;">3. "<span style="font-style: italic;">An Energy-Efficient Reconfigurable Public-Key Cryptography Processor</span>", James Goodman and Anantha P. Chandrakasan</span><br /><a href="http://portal.acm.org/citation.cfm?id=752409" style="font-family: lucida grande;">Link</a><span style="font-family: lucida grande;"> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=5729258748508403600">Citations</a><br /><br /></span><span style="font-family: lucida grande;">4. "<span style="font-style: italic;">An Improved Montgomery’s Algorithm for High-Speed RSA Public-Key Cryptosystem</span><span style="font-style: italic;"></span>", Chih-Yuang Su, Shih-Arn Hwang, Po-Song Chen, and Cheng-Wen Wu</span><br /><a href="http://portal.acm.org/citation.cfm?id=310180" style="font-family: lucida grande;">Link</a><span style="font-family: lucida grande;"> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=16870536392090676357">Citations</a><br /><br /></span><span style="font-family: lucida grande;">5. "<span style="font-style: italic;">Comparison of three modular reduction functions</span>", Antoon Bosselaers, Rene Govaerts and Joos Vandewalle</span><br /><a href="http://portal.acm.org/citation.cfm?id=188147" style="font-family: lucida grande;">Link</a><span style="font-family: lucida grande;"> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=12661273017280586368">Citations</a><br /><br /></span><span style="font-family: lucida grande;">6. "<span style="font-style: italic;">Montgomery Algorithm for Modular Multiplication</span>", D. J Guan</span><br /><a href="http://guan.cse.nsysu.edu.tw/note/montg.pdf" style="font-family: lucida grande;">Link</a><span style="font-family: lucida grande;"> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=15932140987864610640">Citations</a><br /><br /></span><span style="font-family: lucida grande;">7. "<span style="font-style: italic;">On multiple precision based Montgomery Multiplication without Pre-computation of No’ = -Ni^(-1) mod W</span>", H. Ploog, D. Timmermann</span><br /><a href="http://www2.computer.org/portal/web/csdl/doi/10.1109/ICCD.2000.878350" style="font-family: lucida grande;">Link</a><span style="font-family: lucida grande;"><br /><br /></span><span style="font-family: lucida grande;">8. "<span style="font-style: italic;">Versatile Montgomery Multiplier Architectures</span>", Gunnar Gaubatz</span><br /><a href="http://www.crypto.wpi.edu/Publications/Documents/ms_gaubatz.pdf" style="font-family: lucida grande;">Link</a><span style="font-family: lucida grande;"> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=8711772746790199824">Citations</a><br /><br /></span><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/4689182170511850974-5311172102921349070?l=nanocrypto.blogspot.com' alt='' /></div>Kirti Chawlahttp://www.blogger.com/profile/03389829614982080948noreply@blogger.com0tag:blogger.com,1999:blog-4689182170511850974.post-9734879623236963882008-08-09T19:02:00.004-04:002009-10-10T12:00:13.067-04:00<span style="font-family: lucida grande;">1. "<span style="font-style: italic;">Instruction Set Extensions for Fast Arithmetic in Finite Fields GF(p) and GF(2m)</span>", Johann Großschädl and Erkay Savaş</span><br /><a href="http://www.hyperelliptic.org/ECRYPT/vampire/slides/JohannGroszschaedl.pdf"><span style="font-family: lucida grande;">Link</span></a><br /><span style="font-family: lucida grande;"></span><span style="font-family: lucida grande;"><br /></span><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/4689182170511850974-973487962323696388?l=nanocrypto.blogspot.com' alt='' /></div>Kirti Chawlahttp://www.blogger.com/profile/03389829614982080948noreply@blogger.com0tag:blogger.com,1999:blog-4689182170511850974.post-36223364421004654432008-08-09T18:49:00.005-04:002009-10-10T12:08:50.892-04:00<span style="font-family: lucida grande;">1. "<span style="font-style: italic;">Energy-Efficient Software Implementation of Long Integer Modular Arithmetic</span>", Johann Großschadl, Roberto M. Avanzi, Erkay Savas, and Stefan Tillich</span><br /><span style="font-family: lucida grande;"><a href="http://www.springerlink.com/content/aqn75d0rk3967gk2/">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=18284261066977482058">Citations</a></span><br /><br /><span style="font-family: lucida grande;">2. "<span style="font-style: italic;">Parallel Cryptographic Arithmetic Using a Redundant Montgomery Representation</span>", Daniel Page and Nigel P. Smart</span><br /><span style="font-family: lucida grande;"><a href="http://portal.acm.org/citation.cfm?id=1025037">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=14432902835253214878">Citations</a><br /><br /></span><span style="font-family: lucida grande;">3. "<span style="font-style: italic;">Fast Machine Code for Modular Multiplication</span>", Michael Scott</span><br /><span style="font-family: lucida grande;"><a href="ftp://ftp.compapp.dcu.ie/pub/resources/crypto/fast_mod_mult2.ps">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=3186978119772174847">Citations</a><br /><br /></span><span style="font-family: lucida grande;">4. "<span style="font-style: italic;">Comparison of Methods for Modular Exponentiation on 32-bit Intel 80x86 processors</span>", Michael Scott</span><br /><span style="font-family: lucida grande;"><a href="ftp://ftp.compapp.dcu.ie/pub/resources/crypto/timings.ps">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=13543996066973635488">Citations</a><br /></span><span style="font-family: lucida grande;"></span><span style="font-family: lucida grande;"><br /></span><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/4689182170511850974-3622336442100465443?l=nanocrypto.blogspot.com' alt='' /></div>Kirti Chawlahttp://www.blogger.com/profile/03389829614982080948noreply@blogger.com0tag:blogger.com,1999:blog-4689182170511850974.post-55659977743282718662008-07-11T20:13:00.006-04:002009-10-10T12:18:23.693-04:00<span style="font-family: lucida grande;">1. "<span style="font-style: italic;">Multi-Operand Modulo Addition Using Carry Save Adders</span>", C. K. Koc and C. Y. Hung</span><br /><span style="font-family: lucida grande;"><a href="http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=82665">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=12126499890756615874">Citations</a></span><br /><br /><span style="font-family: lucida grande;">2. "<span style="font-style: italic;">Carry-Save Adders for Computing the Product AB modulo N</span>", C. K. Koc and C. Y. Hung</span><br /><span style="font-family: lucida grande;"><a href="http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=82835">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=9743663213082566954">Citations</a><br /><br /></span><span style="font-family: lucida grande;">3. "<span style="font-style: italic;">An RNS Montgomery Modular Multiplication Algorithm</span>", Jean-Claude Bajard, Laurent-Stephane Didier and Peter Kornerup</span><br /><span style="font-family: lucida grande;"><a href="http://www2.computer.org/portal/web/csdl/doi/10.1109/12.709376">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=16161921657726630489">Citations</a><br /><br /></span><span style="font-family: lucida grande;">4. "<span style="font-style: italic;">Montgomery exponentiation needs no final subtractions</span>", C. D. Walter</span><br /><span style="font-family: lucida grande;"><a href="http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=810000">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=17145315874487161880">Citations</a><br /><br /></span><span style="font-family: lucida grande;">5. "<span style="font-style: italic;">A Computer Algorithm for Calculating the Product AB Modulo M</span>", G. R. Blakley</span><br /><span style="font-family: lucida grande;"><a href="http://portal.acm.org/citation.cfm?id=1310577">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=13970884490492052046">Citations</a><br /><br /></span><span style="font-family: lucida grande;">6. "<span style="font-style: italic;">Montgomery's multiplication technique - How to make it smaller and faster</span>", Colin D. Walter</span><br /><span style="font-family: lucida grande;"><a href="http://cat.inist.fr/?aModele=afficheN&amp;cpsidt=1169114">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=3897247118805692393">Citations</a><br /><br /></span><span style="font-family: lucida grande;">7. "<span style="font-style: italic;">Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs</span>", Nils Gura, Arun Patel, Arvinerpal Wander, Hans Eberle, Sheueling Chang Shantz</span><br /><span style="font-family: lucida grande;"><a href="http://research.sun.com/people/eberle/CHES_2004.pdf">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=16820251079723960132">Citations</a><br /><br /></span><span style="font-family: lucida grande;">8. "<span style="font-style: italic;">Enhanced Montgomery Multiplication</span>", Shay Gueron</span><br /><span style="font-family: lucida grande;"><a href="http://www.discretix.com/PDF/ches_paper_in_llcs15.pdf">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=143542656122264234">Citations</a><br /><br /></span><span style="font-family: lucida grande;">9. "<span style="font-style: italic;">Fast Modular Exponentiation</span>", Omer Egecioglu and Cetin K. Koc</span><br /><span style="font-family: lucida grande;"><a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.1430">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=9334845617450362148">Citations</a><br /><br /></span><span style="font-family: lucida grande;">10. "<span style="font-style: italic;">On the evaluation of Powers</span>", Andrew C. Yao</span><br /><span style="font-family: lucida grande;"><a href="http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal&amp;id=SMJCAT000005000001000100000001&amp;idtype=cvips&amp;gifs=yes">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=8390827943199692523">Citations</a><br /><br /></span><span style="font-family: lucida grande;">11. "<span style="font-style: italic;">Exponentiation cryptosystems on the IBM PC</span>", P. G. Comba</span><br /><span style="font-family: lucida grande;"><a href="http://portal.acm.org/citation.cfm?id=98683">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=4464736705335609904">Citations</a><br /><br /></span><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/4689182170511850974-5565997774328271866?l=nanocrypto.blogspot.com' alt='' /></div>Kirti Chawlahttp://www.blogger.com/profile/03389829614982080948noreply@blogger.com0tag:blogger.com,1999:blog-4689182170511850974.post-4901620337341554732008-07-11T19:03:00.004-04:002009-10-10T12:19:16.731-04:00<span style="font-family: lucida grande;">1. "<span style="font-style: italic;">Optimizing Multiprecision Multiplication for Public Key Cryptography</span>", Michael Scott and Piotr Szczechowiak<br /><a href="http://eprint.iacr.org/2007/299.pdf">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=699196219429305821">Citations</a><br /><br /></span><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/4689182170511850974-490162033734155473?l=nanocrypto.blogspot.com' alt='' /></div>Kirti Chawlahttp://www.blogger.com/profile/03389829614982080948noreply@blogger.com0tag:blogger.com,1999:blog-4689182170511850974.post-24079443160250039662008-06-27T15:55:00.005-04:002009-10-10T12:22:37.429-04:00<span style="font-family: lucida grande;">1. "<span style="font-style: italic;">Fast Software Exponentiation in GF(2k)</span>", C. K. Koc, T. Acar<br /><a href="http://www2.computer.org/portal/web/csdl/doi/10.1109/ARITH.1997.614899">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=11145490410839573557">Citations</a><br /><br />2. "<span style="font-style: italic;">Montgomery Multiplication in GF(2k)</span>", C. K. Koc, T. Acar<br /><a href="http://www.springerlink.com/content/g25q57w02h21jv71/">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=4269498636556393259">Citations</a><br /><br /><br /></span><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/4689182170511850974-2407944316025003966?l=nanocrypto.blogspot.com' alt='' /></div>Kirti Chawlahttp://www.blogger.com/profile/03389829614982080948noreply@blogger.com0tag:blogger.com,1999:blog-4689182170511850974.post-31461736531727181972008-06-13T01:15:00.007-04:002009-10-10T12:23:16.455-04:00<span style="font-family: lucida grande;">1. "<span style="font-style: italic;">Coarsely Integrated Operand Scanning (CIOS) Architecture For High-speed Montgomery Modular Multiplication</span>", Maire McLoone, Ciaran Mclvor, John V McCanny<br /><a href="http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1393267">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=14663464408252140345">Citations</a><br /><br /></span><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/4689182170511850974-3146173653172718197?l=nanocrypto.blogspot.com' alt='' /></div>Kirti Chawlahttp://www.blogger.com/profile/03389829614982080948noreply@blogger.com0tag:blogger.com,1999:blog-4689182170511850974.post-43727058286512824882008-06-07T16:15:00.005-04:002009-10-10T12:25:04.139-04:00<span style="font-family: lucida grande;">1. "<span style="font-style: italic;">Secure and Efficient Coprocessor Design for Cryptographic Applications on FPGAs</span>", Nele Mentens<br /><a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.112.3074&amp;rep=rep1&amp;type=pdf">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=3247766535495765846">Citations</a><br /><br />2. "<span style="font-style: italic;">Security on FPGAs: State-of-the-Art Implementations and Attacks</span>", Thomas Wollinger, Jorge Guajardo, Christof Paar<br /><a href="http://portal.acm.org/citation.cfm?id=1015047.1015052">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=10900757856998596795">Citations</a><br /><br />3. "<span style="font-style: italic;">FPGA Montgomery Multiplier Architectures – A Comparison</span>", Ciaran McIvor, Máire McLoone, John V McCanny<br /><a href="http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1364641">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=17915973709192099989">Citations</a><br /><br /></span><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/4689182170511850974-4372705828651282488?l=nanocrypto.blogspot.com' alt='' /></div>Kirti Chawlahttp://www.blogger.com/profile/03389829614982080948noreply@blogger.com0tag:blogger.com,1999:blog-4689182170511850974.post-14813447195186673352008-06-07T15:43:00.007-04:002009-10-10T12:27:05.544-04:00<span style="font-family: lucida grande;">1. "<span style="font-style: italic;">High-Speed RSA Implementation</span>", Cetin Kaya Koc<br /><a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.30.5457&amp;rep=rep1&amp;type=pdf">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=12192539793187796876">Citations</a><br /><br />2. "<span style="font-style: italic;">High-Speed Algorithms and Architectures For Number-Theoretic Cryptosystems</span>", Tolga Acar, Cetin Kaya Koc<br /><a href="http://portal.acm.org/citation.cfm?id=927003">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=11873312946767064940">Citations</a><br /><br />3. "<span style="font-style: italic;">Design and Implementation of high-speed algorithms for public key cryptography</span>", George Joseph<br /><a href="http://upetd.up.ac.za/thesis/submitted/trash/etd-06092005-121308/unrestricted/00dissertation.pdf">Link</a><br /><br /></span><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/4689182170511850974-1481344719518667335?l=nanocrypto.blogspot.com' alt='' /></div>Kirti Chawlahttp://www.blogger.com/profile/03389829614982080948noreply@blogger.com0tag:blogger.com,1999:blog-4689182170511850974.post-58300238012507269412008-05-30T12:39:00.009-04:002009-10-10T12:27:55.199-04:00<span style="font-family: lucida grande; font-size: 100%;">"<span style="font-style: italic;">Analyzing and Comparing Montgomery Multiplication Algorithms</span>", Cetin Kaya Koc, Tolga Acar et al<br /><a href="http://islab.oregonstate.edu/papers/j37acmon.pdf">Link</a> | <a href="http://scholar.google.com/scholar?hl=en&amp;lr=&amp;cites=6671159028189852693">Citations</a><br /><br /></span><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/4689182170511850974-5830023801250726941?l=nanocrypto.blogspot.com' alt='' /></div>Kirti Chawlahttp://www.blogger.com/profile/03389829614982080948noreply@blogger.com0tag:blogger.com,1999:blog-4689182170511850974.post-65287365345320820442008-02-23T01:23:00.010-05:002008-08-22T14:50:47.674-04:00<span style=";font-family:lucida grande;font-size:100%;" >"<span style="font-style: italic;">Optimization of Exponentiation Operation</span>", Montgomery, Brickell et al<br /><a href="http://www.cs.virginia.edu/%7Ekc5dm/repository/crypto/montgomery%20multiplication/OEO.ppt">Link</a><br /><br /></span><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/4689182170511850974-6528736534532082044?l=nanocrypto.blogspot.com' alt='' /></div>Kirti Chawlahttp://www.blogger.com/profile/03389829614982080948noreply@blogger.com0tag:blogger.com,1999:blog-4689182170511850974.post-66856597420011045902008-02-19T20:39:00.013-05:002009-10-10T12:32:19.311-04:00<div style="text-align: justify;"><span style="font-family: lucida grande;">1. "<span style="font-style: italic;">A Survey of fast exponentiation methods</span>", Daniel M. Gordon<br /><a href="http://www.ccrwest.org/gordon/jalg.pdf">Link</a> | <a href="http://scholar.google.com/scholar?num=100&amp;hl=en&amp;lr=&amp;cites=3106420263405072154">Citations</a><br /><br />2. "<span style="font-style: italic;">Addition Chain Heuristics</span>", Jurjen Bos, Matthijs Coster<br /><a href="http://eref.uqu.edu.sa/files/Others/Elliptic%20Curves/Scalar%20Multiplication/Addition%20chain%20heuristics.pdf">Link</a> | <a href="http://scholar.google.com/scholar?num=100&amp;hl=en&amp;lr=&amp;cites=13381197510289571435">Citations</a><br /><br />3. "<span style="font-style: italic;">Fast exponentiation with pre-computation: Algorithms and Lower bounds</span>", Ernest Brickell, Daniel Gordon, Kevin McCurley, David Wilson<br /><a href="http://www.ccrwest.org/gordon/fast.pdf">Link</a> | <a href="http://scholar.google.com/scholar?num=100&amp;hl=en&amp;lr=&amp;cites=15354833842212896948">Citations</a><br /><br />4. "<span style="font-style: italic;">More flexible exponentiation with pre-computation</span>", Chae Hoon Lim, Pil Joong Lee<br /><a href="http://dsns.csie.nctu.edu.tw/research/crypto/HTML/PDF/C94/95.PDF">Link</a> | <a href="http://scholar.google.com/scholar?num=100&amp;hl=en&amp;lr=&amp;cites=13026066213729204810">Citations</a><br /><br />5. "<span style="font-style: italic;">Modular multiplication without trial division</span>", Peter L. Montgomery<br /><a href="http://www2.itu.edu.tr/%7Eorssi/dersler/cryptography/Montgomery.pdf">Link</a> | <a href="http://scholar.google.com/scholar?num=100&amp;hl=en&amp;lr=&amp;cites=4487551971607108764">Citations</a><br /><br />6. "<span style="font-style: italic;">Speeding up secure sessions establishment on the Internet</span>", Yaron Sella<br /><a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.9974">Link</a> | <a href="http://scholar.google.com/scholar?num=100&amp;hl=en&amp;lr=&amp;cites=4306028612708743616">Citations</a><br /><br /></span><br /></div><div class="blogger-post-footer"><img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/4689182170511850974-6685659742001104590?l=nanocrypto.blogspot.com' alt='' /></div>Kirti Chawlahttp://www.blogger.com/profile/03389829614982080948noreply@blogger.com0