Coding theory and cryptography

Channel estimation techniques for OFDM systems based on a pilot arrangement are investigated. Channel estimation based on a comb type pilot arrangement is studied through different algorithms for both estimating the channel at pilot frequencies and interpolating the channel. Channel estimation at pilot frequencies is…

• SİNEM ÇÖLERİ

Channel estimation techniques for OFDM systems based on a pilot arrangement are investigated. Channel estimation based on a comb type pilot arrangement is studied through different algorithms for both estimating the channel at pilot frequencies and interpolating the channel. Channel estimation at pilot frequencies is…

• MUSTAFA ERGEN

Montgomery multiplication methods constitute the core of modular exponentiation, the most popular operation for encrypting and signing digital data in public-key cryptography. In this article, we study the operations involved in computing the Montgomery product, describe several high-speed, space-efficient algorithms…

• ÇETİN KAYA KOÇ

No abstract yet.

• ÇETİN KAYA KOÇ

No abstract yet.

The authors provide an analysis of the performance of optical orthogonal codes in an optical code division multiple access (CDMA) network by considering the probability distribution of the interference patterns. It is shown that the actual performance is close to a previous estimate. A less structured temporal code in…

This paper presents a scalable architecture for the computation of modular multiplication, based on the Montgomery multiplication (MM) algorithm. A word-based version of MM is presented and used to explain the main concepts in the hardware design. The proposed multiplier is able to work with any precision of the input…

• ÇETİN KAYA KOÇ

We present a new low-complexity bit-parallel canonical basis multiplier for the field GF(2m) generated by an all-one-polynomial. The proposed canonical basis multiplier requires m/sup 2/-1 XOR gates and m/sup 2/ AND gates. We also extend this canonical basis multiplier to obtain a new bit-parallel normal basis multipl…

• ÇETİN KAYA KOÇ

An efficient algorithm for the multiplication in GF(2/sup m/) was introduced by Mastrovito. The space complexity of the Mastrovito multiplier for the irreducible trinomial x/sup m/+x+1 was given as m/sup 2/-1 XOR and m/sup 2/ AND gales. In this paper, we describe an architecture based on a new formulation of the multi…

• ÇETİN KAYA KOÇ

No abstract yet.

• AHMET ZENGİN
• İHSAN PEHLİVAN
• SEZGİN KAÇAR

No abstract yet.

• AHMET ZENGİN
• İHSAN PEHLİVAN
• ÜNAL ÇAVUŞOĞLU

No abstract yet.

• AHMET ZENGİN
• İHSAN PEHLİVAN