Chris Papachristou

Chris Papachristou

Auto-generated profile, based on publicly available information

Chris Papachristou

ECSE Department, Case Western Reserve University, Cleveland, USA

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2007
Verified
Conference Paper
Open access
AOAl-Khaleel Osama
Al-Khaleel Osama
CPChris Papachristou
Chris Papachristou
FWFrancis Wolff
Francis Wolff
KPKiamal Pekmestzi
Kiamal Pekmestzi
In this paper we present an efficient design technique for implementing the elliptic curve cryptographic (ECC) scheme in FPGAs. Our technique is based on a novel and efficient implementation of modular multiplication which is the core operation of ECC. To implement large bit-length multiplications we used a novel partitioning and pipeline folding scheme to fit at least 256-bit modular multiplications on a single Virtex-4 FPGA. Comparisons to several other schemes are presented.

11 February 2025 in IEEE Access
Verified
Journal Article
Open access
ASAbdelsalam Al Share
Abdelsalam Al Share
AOAl-Khaleel Osama
Al-Khaleel Osama
FZFadi Nessir Zghoul
Fadi Nessir Zghoul
MAMohammad Al-Khaleel
Mohammad Al-Khaleel
CPChris Papachristou
Chris Papachristou
Decimal arithmetic is gaining more attention by researchers due to their importance in many human-centric applications. Hardware implementations of decimal arithmetic are preferable over their software counterparts as the former leads in performance especially when it comes to real-time applications. Decimal addition is a main decimal operation as most of the other decimal operation can be implemented using decimal addition. Complementary Metal Oxide Semiconductor (CMOS) technology has the advantage of reducing the average power consumption and the propagation delay in digital systems. Decimal adders can be designed as a ripple carry addition (RCA) structure or as a carry look-ahead addition (CLA) structure with the latter being faster with extra hardware cost. This work proposes two CMOS-based carry look-ahead decimal adders (CLDAs) that can be used within any decimal arithmetic unit. Operands of 1-digit size, 2-digit size, 3-digit size, and 4-digit size are investigated. The Boolean logic for each of the proposed CLDAs is developed and the CMOS realization is provided. The circuit of each of the proposed CLDAs is simulated with 45 nm technology library using the LT-SPICE spice simulation tool. The simulation shows promising results in terms of speed, power, and power delay product (PDP).

1 October 2006 in 2006 International Conference on Computer Design
Verified
Conference Paper
Closed access
AOAl-Khaleel Osama
Al-Khaleel Osama
CPChris Papachristou
Chris Papachristou
FWFrancis Wolff
Francis Wolff
KPKiamal Pekmestzi
Kiamal Pekmestzi
High secure cryptographic systems require large bit-length encryption keys which presents a challenge to their efficient hardware implementation especially in embedded devices. Modular multiplication is the core operation in well known cryptosystems like RSA and elliptic curve (ECC). Therefore, it is important to employ efficient modular multiplications techniques to improve the overall performance of the cryptographic system. We present a modular multiplier based on the ordinary Montgomery's multiplication algorithm and a new array multiplication scheme to perform the multiplication. The new modular multiplier is scalable and can be used for large bit-lengths. We also implement the modular multiplier into the Virtex4 FPGA devices and we show that our technique has better performance when compared with other schemes. To implement large bit-length multiplications we used a novel partitioning and pipeline folding scheme to fit at least 512-bit modular multiplications on a single FPGA.

1 January 2009
Verified
Conference Paper
Closed access
HAHuthaifa Al-Omari
Huthaifa Al-Omari
FWFrancis Wolff
Francis Wolff
CPChristos Papachristou
Christos Papachristou
DMDavid McIntyre
David McIntyre
Delay jitter is a critical factor that must be considered in networked real-time applications that require accurate prediction of packet delivery times. Delay jitter can be smoothed by holding packets in a play-back buffer for a certain time called a play-back delay. In this paper, we propose a scheme to enhance the prediction of the play-back delay in Networked Control Systems (NCSs) with no need for clock synchronization. Our newly proposed scheme differs from previous schemes by using the one way delay variation. We have studied the behavior of one way delay variation by conducting extensive measurements between 50 strategically located wired and wireless connected hosts. The advantage of our scheme is that it significantly improves handling of sudden delay spikes, provides a closer approximation to the round trip time (RTT), and exhibits less frequent outliers.

24 August 2005
Verified
Conference Paper
Closed access
MKM.J. Knieser
M.J. Knieser
CPC.A. Papachristou
C.A. Papachristou

18 May 2026
Verified
Conference Paper
Open access
ABAnas Bsoul
Anas Bsoul
MAMohammad Al-Khaleel
Mohammad Al-Khaleel
AOAl-Khaleel Osama
Al-Khaleel Osama
CPChris Papachristou
Chris Papachristou