PEARL: A PErformance evaluAtor of cRyptographic aLgorithms for Mobile Devices

Author(s):  
Bringel Filho ◽  
Windson Viana ◽  
Rossana Andrade ◽  
André Jalles Monteiro
2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Binbin Huang ◽  
Zhongjin Li ◽  
Yunqiu Xu ◽  
Linxuan Pan ◽  
Shangguang Wang ◽  
...  

Mobile edge computing (MEC) enables to provide relatively rich computing resources in close proximity to mobile users, which enables resource-limited mobile devices to offload workloads to nearby edge servers, and thereby greatly reducing the processing delay of various mobile applications and the energy consumption of mobile devices. Despite its advantages, when a large number of mobile users simultaneously offloads their computation tasks to an edge server, due to the limited computation and communication resources of edge server, inefficiency resource allocation will not make full use of the limited resource and cause waste of resource, resulting in low system performance (the weighted sum of the number of processed tasks, the number of punished tasks, and the number of dropped tasks). Therefore, it is a challenging problem to effectively allocate the computing and communication resources to multiple mobile users. To cope with this problem, we propose a performance-aware resource allocation (PARA) scheme, the goal of which is to maximize the long-term system performance. More specifically, we first build the multiuser resource allocation architecture for computing workloads and transmitting result data to mobile devices. Then, we formulate the multiuser resource allocation problem as a Markova Decision Process (MDP). To achieve this problem, a performance-aware resource allocation (PARA) scheme based on a deep deterministic policy gradient (DDPG) is adopted to derive optimal resource allocation policy. Finally, extensive simulation experiments demonstrate the effectiveness of the PARA scheme.


2021 ◽  
Vol 16 ◽  
pp. 1563-1578
Author(s):  
Ruitao Feng ◽  
Sen Chen ◽  
Xiaofei Xie ◽  
Guozhu Meng ◽  
Shang-Wei Lin ◽  
...  

2014 ◽  
Vol 20 (5) ◽  
Author(s):  
J. Toldinas ◽  
R. Damasevicius ◽  
A. Venckauskas ◽  
T. Blazauskas ◽  
J. Ceponis

1970 ◽  
Vol 108 (2) ◽  
pp. 11-14 ◽  
Author(s):  
J. Toldinas ◽  
V. Stuikys ◽  
R. Damasevicius ◽  
G. Ziberkas ◽  
M. Banionis

We analyse energy efficiency vs. cipher strenth of AES/Rijndael crypto algorithms in a mobile device with respect to block and key size. The experimental results show that Pareto-optimal solutions have equal block and key sizes. We also propose three energy/security profiles for the users of mobile devices. As decryption operation requires 14% more energy than encryption, the results of energy consumption measurements when performing data encrypion can be used to predict energy consumption of decryption operation. Ill. 5, bibl. 10, tabl. 2 (in English; abstracts in English and Lithuanian).http://dx.doi.org/10.5755/j01.eee.108.2.134


2009 ◽  
Vol 18 (01) ◽  
pp. 133-150 ◽  
Author(s):  
JOSÉ MARÍA GRANADO-CRIADO ◽  
MIGUEL ÁNGEL VEGA-RODRÍGUEZ ◽  
JUAN MANUEL SÁNCHEZ-PÉREZ ◽  
JUAN ANTONIO GÓMEZ-PULIDO

Cryptographic algorithms are a fundamental tool nowadays, and information networks continue to grow exponentially every year. Moreover, these algorithms need to be very fast due to the new standards. In order to achieve this characteristic, a good choice is to use FPGAs, which mix the advantages of software flexibility and hardware performance. In this work, we present a super-pipelined and parallel implementation of the IDEA cryptographic algorithm by using partial and dynamic reconfiguration. Our implementation reaches a performance of 26.028 Gb/s, and therefore, it obtains better results than those found in the literature.


Sign in / Sign up

Export Citation Format

Share Document