Survey on hardware implementation of random number generators on FPGA: Theory and experimental analyses

M Bakiri, C Guyeux, JF Couchot, AK Oudjida - Computer Science Review, 2018 - Elsevier
Random number generation refers to many applications such as simulation, numerical
analysis, cryptography etc. Field Programmable Gate Array (FPGA) are reconfigurable …

Radix-2w Arithmetic for Scalar Multiplication in Elliptic Curve Cryptography

AK Oudjida, A Liacha - … Transactions on Circuits and Systems I …, 2021 - ieeexplore.ieee.org
Elliptic curve scalar multiplication k. P, where k is a nonnegative constant and P is a point on
the elliptic curve, requires two distinct operations: addition (ADD) and doubling (DBL). To …

Multiple constant multiplication algorithm for high-speed and low-power design

AK Oudjida, A Liacha, M Bakiri… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
In this brief, Radix-2 r arithmetic is applied to the multiple constant multiplication (MCM)
problem. Given a number M of nonnegative constants with a bit length N, we determine the …

Design of high‐speed, low‐power, and area‐efficient FIR filters

A Liacha, AK Oudjida, F Ferguene… - IET Circuits, Devices …, 2018 - Wiley Online Library
In a recent work, we have introduced a new multiple constant multiplication (MCM)
algorithm, denoted as RADIX‐2r. The latter exhibits the best results in speed and power …

Hardware implementation of a pseudo random number generator based on chaotic iteration

M Bakiri - 2018 - theses.hal.science
Security and cryptography are key elements in constrained devices such as IoT, smart card,
embedded system, etc. Their hardware implementations represent a challenge in terms of …

[PDF][PDF] Deriving optimal multiplication-by-constant circuits with a SAT-based constraint engine

V Lagoon, A Metodi - Proc. ModRef 19th Workshop Constraint …, 2020 - modref.github.io
Constant multiplication circuits can be realized using additions, subtractions and leftshifts.
The problem of finding a multiplication circuit with minimum number of adders and …

Radix‐2r recoding with common subexpression elimination for multiple constant multiplication

A Liacha, AK Oudjida, M Bakiri… - IET Circuits, Devices …, 2020 - Wiley Online Library
In a recent work on multiple constant multiplication (MCM) problems, a fully predictable sub‐
linear runtime heuristic was introduced, called Radix‐2r MCM. This method shows …

[PDF][PDF] 通用二进制乘法的新概念及其在现场可编程门阵列上的实现

UB MULTIPLICATION - 西南交通大学学报, 2021 - researchgate.net
摘要本文提出了有符号二进制乘法方程, 有符号乘法器和通用乘法器的新改进.
所提出的乘法器算法复杂度低, 易于实现到软件和硬件中. 通过优化查找表(6-查找表和5 …

Efficient implementation of modular division by input bit splitting

D Gorodecky, T Villa - 2019 IEEE 26th Symposium on …, 2019 - ieeexplore.ieee.org
Arithmetic operations, such as addition, multiplication, division and modular division, impact
on the quality of arithmetic logic units and of the whole processor, with respect to area and …

Area and power efficient fused floating-point dot product unit based on radix-2r multiplier & pipeline feedforward-cutset-free carry-lookahead adder

MM Babu, KR Naidu - Information Technology in Industry, 2021 - it-in-industry.org
Fused floating point operations play a major role in many DSP applications to reduce
operational area & power consumption. Radix-2r multiplier (using 7-bit encoder technique) …