- 112 August 2001/Vol. 44, No. 8 COMMUNICATIONS OF THE ACM t is easy to create bogus email with someone
- CONSEPP: CONvenient and Secure Electronic Payment Protocol Based on X9.59 Albert Levi
- A Less Recursive Variant of Karatsuba-Ofman Algorithm for Multiplying Operands of Size a Power of Two
- A Reduction Method for Multiplication in Finite Fields C. K. Koc and A. Halbutogullari
- Electronics Letters, 32(22):2063-2065, 24th October 1996. Parallel Canonical Recoding
- Brief Contributions________________________________________________________________________________ Mastrovito Multiplier for
- High-Speed Implementation of an ECC-based Wireless Authentication Protocol
- Algorithm Name: Spectral Hash
- Proceedings of the 12th European Conference on Circuit Theory and Design, Vol. 2, pages 901-904, Istanbul, Turkey, August 27-31, 1995.
- Improving Brumley and Boneh Timing Attack on Unprotected SSL Implementations
- Elliptic and Hyperelliptic Curves on Embedded P
- Parallel Multipliers Based on Special Irreducible Pentanomials
- Communication, Control, and Signal Processing: Proceedings of 1990 Bilkent International Conference on New Trends in Communication, Control, and Signal Processing, E. Arikan, editor,
- International Journal of Network Security, Vol.4, No.2, PP.235239, Mar. 2007 235 Vulnerabilities in the Adachi-Aoki-Komano-Ohta
- Parallel Computing, 23(13):2067-2074, December 15, 1997. Parallel p-adic Method for Solving Linear Systems of Equations
- Proceedings of Eight SIAM Conference on Parallel Processing for Scientific Computing, 10 pages, CD-ROM Format, Minneapolis, Minnesota, March 14-17, 1997.
- FPGA Implementation of an Elliptic Curve Cryptosystem over GF(3m Ilker Yavuz1,2
- Parallel Multiplication in GF(2k using Polynomial Residue Arithmetic
- A Scalable Architecture for Montgomery Multiplication
- IEEE Micro, 16(3):26-33, June 1996. Analyzing and Comparing Montgomery Multiplication Algorithms
- International Journal of Network Security, Vol.1, No.2, PP.7780, Sep. 2005 (http://isrc.nchu.edu.tw/ijns/) 77 A Simple Attack on a Recently Introduced
- Guest Editors' Introduction to the Special Section on Special-Purpose Hardware for
- International Journal of High Speed Computing, 9(3):223-236, 1997. THREE DIMENSIONAL MONTE CARLO DEVICE SIMULATION WITH
- Constructing Composite Field Representations for Efficient Conversion
- The Security NewsletterN5 / Spring 2007 In this issue
- 40 IEEE CIRCUITS AND SYSTEMS MAGAZINE 1531-636X/10/$26.002010 IEEE SECOND QUARTER 2010 Digital Object Identifier 10.1109/MCAS.2010.936785
- Reconfigurable Number Theoretic Transform Architectures for Cryptographic Applications
- MATHEMATICS OF COMPUTATION VOLUME 53, NUMBER 187
- IEEE Transactions on Automatic Control, 40(5):944-948, May 1995. Halley's Method for the Matrix Sector Function
- Parallel Algorithms and Applications, 11(1-2):61-69, 1997. A Parallelization of Parlett's Algorithm
- IEE Proceedings: Computers and Digital Techniques, 144(5):279-284, September 1997. Inversion of Cellular Automata Iterations
- VLSI Design, 6(1-4):273-276, 1998. 3D Parallel Monte Carlo Simulation of GaAs MESFETs
- IEEE TRANSACTIONS ON COMPUTERS, VOL. 47, NO. 3, MARCH 1998 353 Low-Complexity Bit-Parallel
- Designs, Codes and Cryptography, 14(1), 5769 (April 1998) c April 1998 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- A Fast Algorithm for Modular Reduction C. K. Koc
- Brief Contributions________________________________________________________________________________ Mastrovito Multiplier for All Trinomials
- IEEE TRANSACTIONS ON COMPUTERS, VOL. 49, NO. 7, JULY 2000 763 [1] M.A. Cornea-Hasegan, R.A. Golliver, and P. Markstein, Correctness
- Incomplete Reduction in Modular Arithmetic T. Yanik, E. Savas, and C. K. Koc
- Guest Editors' Introduction to the Special Section on Cryptographic Hardware
- Novel Multiplier Architectures for GF(p) and GF(2n , A. F. Tenca2
- ADESIGN FRAMEWORK FOR SCALABLE AND UNIFIED MULTIPLIERS IN GF(p)AND GF(2m
- Efficient Unified Montgomery Inversion with Multibit Shifting , M. Naseer1
- A Radix-4 Design of a Scalable Modular Multiplier With Recoding Lo'ai A. Tawalbeh, Alexandre F. Tenca and C. K. Koc
- IJCSNS International Journal of Computer Science and Network Security, VOL.6 No.5B, May 2006 157 Manuscript received May 5, 2006.
- JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 1213-1227 (2008) Short Paper_________________________________________________
- Proceedings of the 33rd Annual Allerton Conference on Communication, Control, and Computing pages 440-446, Urbana, Illinois, October 4-6, 1995
- Proceedings of Third Annual Workshop on Selected Areas in Cryptography, pages 95-106, Queen's University, Kingston, Ontario, Canada, August 15-16, 1996.
- A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m
- An High-Speed ECC-based Wireless Authentication Protocol on an ARM Microprocessor
- Generating Elliptic Curves of Prime Order Erkay Savas1
- Reducing Certificate Revocation Cost using NPKI Albert Levi and etin Kaya Ko
- Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2n
- Architectures for Unified Field Inversion with Applications in Elliptic Curve Cryptography
- On fully parallel Karatsuba Multipliers for F. Rodriguez-Henriquez
- Dual-Field Multiplier Architecture for Cryptographic Applications E. Savas A. F. Tenca and C. K. Koc
- C. Aykanat et al. (Eds.): ISCIS 2004, LNCS 3280, pp. 278-288, 2004. Springer-Verlag Berlin Heidelberg 2004
- Trace-Driven Cache Attacks on AES (Short Paper)
- Predicting Secret Keys Via Branch Prediction Onur Aciicmez1
- On the Power of Simple Branch Prediction Analysis Onur Aciicmez
- RSA Hardware Implementation Cetin Kaya Koc
- A Divide-and-Conquer Algorithm for Functions of Triangular Matrices
- A Tutorial on p-adic Arithmetic C. K. Koc
- Spectral Modular Exponentiation Gokay Saldamli
- Cache Based Remote Timing Attack on the AES Onur Aciicmez1
- Proceedings of 1998 IEEE International Symposium on Information Theory, pages 294-294, MIT, Cambridge, Massachusetts, August 16-21, 1998.
- An Efficient Hardware Architecture of a Scalable Elliptic Curve Crypto-Processor Over GF(2n
- Computers and Mathematics with Applications, 30(10):17-24, 1995. Analysis of Sliding Window Techniques for Exponentiation
- Proceedings, 13th Symposium on Computer Arithmetic, T. Lang, J.-M. Muller, and N. Takagi, editors, pages 225-231, Asilomar, California, July 6-9, 1997, Los Alamitos, CA: IEEE Computer Society Press.
- A Dual-field Modular Division Algorithm and Architecture for Application Specific Hardware
- Use of Nested Certificates for Efficient, Dynamic and Trust Preserving Public Key Infrastructure
- Computing, 57(1)85-92, 1996. A Parallel Algorithm for Functions of Triangular Matrices
- A Scalable Architecture for Modular Multiplication Based on
- An Efficient Hardware Architecture for Spectral Hash Algorithm Ray C.C. Cheung
- Mastrovito Multiplier for General Irreducible Polynomials
- A Methodology for High-Speed Software Implementations of Number-Theoretic Cryptosystems
- SETTING INITIAL SECRET KEYS IN A MOBILE AD HOC NETWORK
- High-Speed RSA Implementation Cetin Kaya Koc
- Efficient Methods for Composite Field Arithmetic E. Savas and C. K. Koc
- Scalable VLSI Architecture for GF(p) Montgomery Modular Inverse Computation Adnan Abdul-Aziz Gutub, Alexandre Ferreira Tenca, and etin Kaya Ko
- Crypto Corner Editors: Peter Gutmann, pgut001@cs.auckland.ac.nz
- Automatica, 33(9):1735-1738, September 1997. A Parallel Algorithm for Principal nth Roots of Matrices
- On Ubiquitous Network Security and Anomaly Detection* Colin Van Dyke etin K. Ko
- Implementing Network Security Protocols based on Elliptic Curve Cryptography
- Brief Contributions________________________________________________________________________________ An Efficient Optimal Normal Basis
- High-Radix Design of a Scalable Modular Multiplier
