Search For:

Displaying 1-16 out of 16 total
Evaluating the Hardware Performance of a Million-Bit Multiplier
Found in: 2013 Euromicro Conference on Digital System Design (DSD)
By Yarkin Doroz,Erdinc Ozturk,Berk Sunar
Issue Date:September 2013
pp. 955-962
In this work we present the first full and complete evaluation of a very large multiplication scheme in custom hardware. We designed a novel architecture to realize a million-bit multiplication architecture based on the Schönhage-Strassen Algorithm and the...
 
Multilinear codes for robust error detection
Found in: On-Line Testing Symposium, IEEE International
By Zhen Wang, Mark Karpovsky, Berk Sunar
Issue Date:June 2009
pp. 164-169
We propose an efficient technique for the detection of errors in cryptographic circuits introduced by strong adversaries. Previously a number of linear and non-linear error detection schemes were proposed. Linear codes provide protection only against primi...
 
Towards Robust Low Cost Authentication for Pervasive Devices
Found in: Pervasive Computing and Communications, IEEE International Conference on
By Erdinç Öztürk, Ghaith Hammouri, Berk Sunar
Issue Date:March 2008
pp. 170-178
Low cost devices such as RFIDs, sensor network nodes, and smartcards are crucial for building the next generation pervasive and ubiquitous networks. The inherent power and footprint limitations of such networks, prevent us from employing standard cryptogra...
 
Tate Pairing with Strong Fault Resiliency
Found in: Fault Diagnosis and Tolerance in Cryptography, Workshop on
By Erdinc Ozturk, Gunnar Gaubatz, Berk Sunar
Issue Date:September 2007
pp. 103-111
We present a novel non-linear error coding framework which incorporates strong adversarial fault detection capabilities into identity based encryption schemes built using Tate pairing computations. The presented algorithms provide quantifiable resilience i...
 
Trojan Detection using IC Fingerprinting
Found in: Security and Privacy, IEEE Symposium on
By Dakshi Agrawal, Selcuk Baktir, Deniz Karakoyunlu, Pankaj Rohatgi, Berk Sunar
Issue Date:May 2007
pp. 296-310
Hardware manufacturers are increasingly outsourcing their IC fabrication work overseas due to their much lower cost structure. This poses a significant security risk for ICs used for critical military and business applications. Attackers can exploit this l...
 
A Provably Secure True Random Number Generator with Built-In Tolerance to Active Attacks
Found in: IEEE Transactions on Computers
By Berk Sunar, William J. Martin, Douglas R. Stinson
Issue Date:January 2007
pp. 109-119
This paper is a contribution to the theory of true random number generators based on sampling phase jitter in oscillator rings. After discussing several misconceptions and apparently insurmountable obstacles, we propose a general model which, under mild as...
 
Energy Scalable Universal Hashing
Found in: IEEE Transactions on Computers
By Jens-Peter Kaps, Kaan Yüksel, Berk Sunar
Issue Date:December 2005
pp. 1484-1495
Message Authentication Codes (MACs) are valuable tools for ensuring the integrity of messages. MACs may be built around a universal hash function (NH) which was explored in the construction of UMAC. In this paper, we use a variation on NH called WH. WH rea...
 
An Efficient Basis Conversion Algorithm for Composite Fields with Given Representations
Found in: IEEE Transactions on Computers
By Berk Sunar
Issue Date:August 2005
pp. 992-997
We describe an efficient method for constructing the basis conversion matrix between two given finite field representations where one is composite. We are motivated by the fact that using certain representations, e.g., low-Hamming weight polynomial or comp...
 
Optimal Tower Fields
Found in: IEEE Transactions on Computers
By Selçuk Baktir, Berk Sunar
Issue Date:October 2004
pp. 1231-1243
We introduce a new tower field representation, optimal tower fields (OTFs), that facilitates efficient finite field operations. The recursive direct inversion method we present has significantly lower complexity than the known best method for inversion in ...
 
A Generalized Method for Constructing Subquadratic Complexity GF(2^k) Multipliers
Found in: IEEE Transactions on Computers
By Berk Sunar
Issue Date:September 2004
pp. 1097-1105
We introduce a generalized method for constructing subquadratic complexity multipliers for even characteristic field extensions. The construction is obtained by recursively extending short convolution algorithms and nesting them. To obtain the short convol...
 
Constructing Composite Field Representations for Efficient Conversion
Found in: IEEE Transactions on Computers
By Berk Sunar, Erkay Savas, Çetin K. Koç
Issue Date:November 2003
pp. 1391-1398
<p><b>Abstract</b>—This paper describes a method of construction of a composite field representation from a given binary field representation. We derive the conversion (change of basis) matrix. The special case of when the degree of the g...
 
Achieving NTRU with Montgomery Multiplication
Found in: IEEE Transactions on Computers
By Colleen O'Rourke, Berk Sunar
Issue Date:April 2003
pp. 440-448
<p><b>Abstract</b>—In this paper, we propose a new unified architecture that utilizes the Montgomery Multiplication algorithm to perform a modular multiplication for both integers and binary polynomials and NTRU's polynomial multiplicatio...
 
Accelerating Fully Homomorphic Encryption in Hardware
Found in: IEEE Transactions on Computers
By Yarkin Doroz,Erdinc Ozturk,Berk Sunar
Issue Date:August 2014
pp. 1
We present a custom architecture for realizing the Gentry-Halevi fully homomorphic encryption (FHE) scheme. This contribution presents the first full realization of FHE in hardware. The architecture features an optimized multi-million bit multiplier based ...
 
Evaluating the Hardware Performance of a Million-Bit Multiplier
Found in: 2013 Euromicro Conference on Digital System Design (DSD)
By Yarkin Doroz,Erdinc Ozturk,Berk Sunar
Issue Date:September 2013
pp. 955-962
In this work we present the first full and complete evaluation of a very large multiplication scheme in custom hardware. We designed a novel architecture to realize a million-bit multiplication architecture based on the Schönhage-Strassen Algorithm and the...
 
Exploring the Feasibility of Fully Homomorphic Encryption
Found in: IEEE Transactions on Computers
By Wei Wang,Yin Hu,Lianmu Chen,Xinming Huang,Berk Sunar
Issue Date:August 2013
pp. 1
In a major breakthrough, Gentry introduced the first plausible construction of a fully homomorphic encryption (FHE) scheme in 2009. FHE allows the evaluation of arbitrary functions directly on encrypted data on untrusted servers. Later, in 2010 Gentry-Hale...
 
A fast real-time memory authentication protocol
Found in: Proceedings of the 3rd ACM workshop on Scalable trusted computing (STC '08)
By Berk Sunar, Ghaith Hammouri, Yin Hu
Issue Date:October 2008
pp. 53-62
We propose a new real-time authentication scheme for memory. As in previous proposals the scheme uses a Merkle tree to guarantee dynamic protection of memory. We use the universal hash function family NH for speed and couple it with an AES encryption in or...
     
 1