Çetin Kaya Koç

According to our database1, Çetin Kaya Koç authored at least 102 papers between 1989 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Parallel bitsliced AES through PHAST: a single-source high-performance library for multi-cores and GPUs.
J. Cryptographic Engineering, 2019

Distillation Strategies for Proximal Policy Optimization.
CoRR, 2019

Benchmarking Event-Driven Neuromorphic Architectures.
Proceedings of the International Conference on Neuromorphic Systems, 2019

2018
Guest Editors' Introduction to the Special Issue on Cryptographic Engineering in a Post-Quantum World: State of the Art Advances.
IEEE Trans. Computers, 2018

FFT-Based McLaughlin's Montgomery Exponentiation without Conditional Selections.
IEEE Trans. Computers, 2018

Montgomery inversion.
J. Cryptographic Engineering, 2018

Visual Diagnostics for Deep Reinforcement Learning Policy Development.
CoRR, 2018

Impacts of Mathematical Optimizations on Reinforcement Learning Policy Performance.
Proceedings of the 2018 International Joint Conference on Neural Networks, 2018

Reinforcement Learning and Trustworthy Autonomy.
Proceedings of the Cyber-Physical Systems Security., 2018

Mathematical Optimizations for Deep Learning.
Proceedings of the Cyber-Physical Systems Security., 2018

2017
Hiding Hardware Trojan Communication Channels in Partially Specified SoC Bus Functionality.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2017

Area-Time Efficient Architecture of FFT-Based Montgomery Multiplication.
IEEE Trans. Computers, 2017

A New Algorithm for Inversion mod pk.
IACR Cryptology ePrint Archive, 2017

2016
A Matrix Decomposition Method for Optimal Normal Basis Multiplication.
IEEE Trans. Computers, 2016

Parameter Space for the Architecture of FFT-Based Montgomery Modular Multiplication.
IEEE Trans. Computers, 2016

Trojans modifying soft-processor instruction sequences embedded in FPGA bitstreams.
Proceedings of the 26th International Conference on Field Programmable Logic and Applications, 2016

Continuous-Time Computational Aspects of Cyber-Physical Security.
Proceedings of the 2016 Workshop on Fault Diagnosis and Tolerance in Cryptography, 2016

Hardware Trojans in incompletely specified on-chip bus systems.
Proceedings of the 2016 Design, Automation & Test in Europe Conference & Exhibition, 2016

Bitsliced High-Performance AES-ECB on GPUs.
Proceedings of the New Codebreakers, 2016

2015
A Matrix Decomposition Method for Optimal Normal Basis Multiplication.
IACR Cryptology ePrint Archive, 2015

2014
Reducing the Complexity of Normal Basis Multiplication.
IACR Cryptology ePrint Archive, 2014

Reducing the Complexity of Normal Basis Multiplication.
Proceedings of the Arithmetic of Finite Fields - 5th International Workshop, 2014

True Random Number Generators.
Proceedings of the Open Problems in Mathematics and Computational Science, 2014

About Open Problems.
Proceedings of the Open Problems in Mathematics and Computational Science, 2014

2012
Analysis of performance versus security in hardware realizations of small elliptic curves for lightweight applications.
J. Cryptographic Engineering, 2012

Low complexity and hardware-friendly spectral modular multiplication.
Proceedings of the 2012 International Conference on Field-Programmable Technology, 2012

A Qualitative Security Analysis of a New Class of 3-D Integrated Crypto Co-processors.
Proceedings of the Cryptography and Security: From Theory to Applications, 2012

2011
Montgomery Arithmetic.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Introduction to the Journal of Cryptographic Engineering.
J. Cryptographic Engineering, 2011

2010
Reconfigurable Number Theoretic Transform architectures for cryptographic applications.
Proceedings of the International Conference on Field-Programmable Technology, 2010

2009
A High-Performance Hardware Architecture for Spectral Hash Algorithm.
Proceedings of the 20th IEEE International Conference on Application-Specific Systems, 2009

Polynomial Multiplication over Finite Fields Using Field Extensions and Interpolation.
Proceedings of the 19th IEEE Symposium on Computer Arithmetic, 2009

Efficient Unified Arithmetic for Hardware Cryptography.
Proceedings of the Cryptographic Engineering, 2009

Spectral Modular Arithmetic for Cryptography.
Proceedings of the Cryptographic Engineering, 2009

About Cryptographic Engineering.
Proceedings of the Cryptographic Engineering, 2009

Fast Finite Field Multiplication.
Proceedings of the Cryptographic Engineering, 2009

Microarchitectural Attacks and Countermeasures.
Proceedings of the Cryptographic Engineering, 2009

2008
A Secure Hash-Based Strong-Password Authentication Protocol Using One-Time Public-Key Cryptography.
J. Inf. Sci. Eng., 2008

Improving the Novikov and Kiselev User Authentication Scheme.
I. J. Network Security, 2008

FPGA Implementation of an Elliptic Curve Cryptosystem over GF(3^m).
Proceedings of the ReConFig'08: 2008 International Conference on Reconfigurable Computing and FPGAs, 2008

2007
Vulnerabilities in the Adachi-Aoki-Komano-Ohta Micropayment Scheme.
I. J. Network Security, 2007

Micro-Architectural Cryptanalysis.
IEEE Security & Privacy, 2007

Cache Based Remote Timing Attack on the AES.
Proceedings of the Topics in Cryptology, 2007

Predicting Secret Keys Via Branch Prediction.
Proceedings of the Topics in Cryptology, 2007

Spectral Modular Exponentiation.
Proceedings of the 18th IEEE Symposium on Computer Arithmetic (ARITH-18 2007), 2007

2006
Predicting Secret Keys via Branch Prediction.
IACR Cryptology ePrint Archive, 2006

On the Power of Simple Branch Prediction Analysis.
IACR Cryptology ePrint Archive, 2006

Trace-Driven Cache Attacks on AES.
IACR Cryptology ePrint Archive, 2006

Trace-Driven Cache Attacks on AES (Short Paper).
Proceedings of the Information and Communications Security, 8th International Conference, 2006

2005
Montgomery Arithmetic.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Modular Arithmetic.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

A Simple Attack on a Recently Introduced Hash-based Strong-password Authentication Scheme.
I. J. Network Security, 2005

Improving Brumley and Boneh timing attack on unprotected SSL implementations.
Proceedings of the 12th ACM Conference on Computer and Communications Security, 2005

2004
Use of nested certificates for efficient, dynamic, and trust preserving public key infrastructure.
ACM Trans. Inf. Syst. Secur., 2004

Elliptic and hyperelliptic curves on embedded µP.
ACM Trans. Embedded Comput. Syst., 2004

Relay Attacks on Bluetooth Authentication and Solutions.
Proceedings of the Computer and Information Sciences, 2004

2003
A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm.
IEEE Trans. Computers, 2003

Constructing Composite Field Representations for Efficient Conversion.
IEEE Trans. Computers, 2003

Parallel Multipliers Based on Special Irreducible Pentanomials.
IEEE Trans. Computers, 2003

Guest Editors' Introduction to the Special Section on Cryptographic Hardware and Embedded Systems.
IEEE Trans. Computers, 2003

On Ubiquitous Network Security and Anomaly Detection.
Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT 2003), 27-31 January 2003, 2003

A Less Recursive Variant of Karatsuba-Ofman Algorithm for Multiplying Operands of Size a Power of Two.
Proceedings of the 16th IEEE Symposium on Computer Arithmetic (Arith-16 2003), 2003

2002
Scalable VLSI Architecture for GF(p) Montgomery Modular Inverse Computation.
Proceedings of the 2002 IEEE Computer Society Annual Symposium on VLSI (ISVLSI 2002), 2002

Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2).
Proceedings of the Cryptographic Hardware and Embedded Systems, 2002

2001
An Efficient Optimal Normal Basis Type II Multiplier.
IEEE Trans. Computers, 2001

Risks in email security.
Commun. ACM, 2001

Reducing Certificate Revocating Cost using NPKI.
Proceedings of the Trusted Information: The New Decade Challenge, 2001

High-Radix Design of a Scalable Modular Multiplier.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2001

Generating Elliptic Curves of Prime Order.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2001

CONSEPP: CONvenient and Secure Electronic Payment Protocol Based on X9.59.
Proceedings of the 17th Annual Computer Security Applications Conference (ACSAC 2001), 2001

2000
The Montgomery Modular Inverse-Revisited.
IEEE Trans. Computers, 2000

Mastrovito Multiplier for General Irreducible Polynomials.
IEEE Trans. Computers, 2000

Parallel Multiplication in using Polynomial Residue Arithmetic.
Des. Codes Cryptogr., 2000

A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m).
Proceedings of the Cryptographic Hardware and Embedded Systems, 2000

An High-Speed ECC-based Wireless Authentication Protocol on an ARM Microprocessor.
Proceedings of the 16th Annual Computer Security Applications Conference (ACSAC 2000), 2000

1999
Mastrovito Multiplier for All Trinomials.
IEEE Trans. Computers, 1999

A Scalable Architecture for Montgomery Multiplication.
Proceedings of the Cryptographic Hardware and Embedded Systems, 1999

Mastrovito Multiplier for General Irreducible Polynomials.
Proceedings of the Applied Algebra, 1999

1998
3D Parallel Monte Carlo Simulation of GaAs MESFETs.
VLSI Design, 1998

Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields.
IEEE Trans. Computers, 1998

Montgomery Multplication in GF(2k).
Des. Codes Cryptogr., 1998

1997
Parallel p-Adic Method for Solving Linear Systems of Equations.
Parallel Computing, 1997

A Parllelization of Parlett's Algorithm for Functions of Triangular Matrices.
Parallel Algorithms Appl., 1997

A Parallel algorithm for principal nth roots of matrices.
Automatica, 1997

Fast Software Exponentiation in GF(2^k).
Proceedings of the 13th Symposium on Computer Arithmetic (ARITH-13 '97), 1997

1996
Analyzing and comparing Montgomery multiplication algorithms.
IEEE Micro, 1996

1994
Exponentiation Using Canonical Recoding.
Theor. Comput. Sci., 1994

Exact Solution of Linear Equations on Distributed-memory Multiprocessors.
Parallel Algorithms Appl., 1994

1993
Systolic Arrays for Integer Chinese Remaindering.
Parallel Computing, 1993

1992
A parallel algorithm for generating discrete orthogonal polynomials.
Parallel Computing, 1992

1991
Bit-level systolic arrays for modular multiplication.
VLSI Signal Processing, 1991

Comments on 'Residue arithmetic VLSI array architecture for manipulator pseudo-inverse Jacobian computation' [with reply].
IEEE Trans. Robotics and Automation, 1991

A Fast Algorithm for Gaussian Elimination over GF(2) and Its Implementation on the GAPP.
J. Parallel Distrib. Comput., 1991

Decomposing polynomial interpolation for systolic arrays.
Int. J. Comput. Math., 1991

Parallel algorithms for nevanlinna-pick interpolation: the scalar case.
Int. J. Comput. Math., 1991

High-radix and bit recoding techniques for modular exponentiation.
Int. J. Comput. Math., 1991

A Parallel Algorithm for Exact Solution of Linear Equations.
Proceedings of the International Conference on Parallel Processing, 1991

1990
Systolic computation of interpolating polynomials.
Computing, 1990

1989
Schwarz-Christoffel transformation for the simulation of two-dimensional capacitance [VLSI circuits].
IEEE Trans. on CAD of Integrated Circuits and Systems, 1989

Fast computation of divided differences and parallel hermite interpolation.
J. Complexity, 1989

Parallel Hermite interpolation: An algebraic approach.
Computing, 1989

Systolic arrays for integer Chinese remaindering.
Proceedings of the 9th Symposium on Computer Arithmetic, 1989


  Loading...