Entity

Time filter

Source Type

Bucharest, Romania

Olteanu A.,Polytechnic University of Bucharest | Cernian A.,Polytechnic University of Bucharest | Stamatescu Gr.,Polytechnic University of Bucharest | Mateescu G.,Polytechnic University of Bucharest | And 9 more authors.
IFAC Proceedings Volumes (IFAC-PapersOnline) | Year: 2012

This paper presents an experimental information system for the secure and efficient medical services based on PKI infrastructures and smart-cards. The introduction offers a global view of the current context in Romania and emphasizes the necessity of a new approach in the medical area. The second section presents the platform architecture - from both software and hardware point of view. Afterward, we introduce and explain the stages of the card and how the system was tested and the experimental validation of the system. In the end, there are a few main talking points that conclude all presented above. © 2012 IFAC. Source


Cernian A.,Polytechnic University of Bucharest | Olteanu A.,Polytechnic University of Bucharest | Mateescu G.,Polytechnic University of Bucharest | Vladescu M.,Polytechnic University of Bucharest | And 9 more authors.
IFAC Proceedings Volumes (IFAC-PapersOnline) | Year: 2012

This paper presents an experimental information system for the management of personal data and citizen identification, called PLATSEC, based on multi-application smartcards technologies and on PKI infrastructures. The introduction offers a global view of the current context in Romania and emphasizes the necessity of a new approach in the public sector - which addresses both the public sectors services and the public information security. The second section presents the platform architecture - from both software and hardware point of view. Afterward, we introduce and explain a use-case scenario, which aims to prove our system efficiency and advantages, which have also been confirmed by the quality assurance tests performed. In the end, there are a few main talking points that conclude all presented above. © 2012 IFAC. Source


Togan M.,certSIGN | Lupascu C.,Military Technical Academy | Plesca C.,certSIGN
Proceedings of the Romanian Academy Series A - Mathematics Physics Technical Sciences Information Science | Year: 2015

In this paper we make some considerations regarding the homomorphic evaluation of the SPECK lightweight cipher. Firstly, we show a reduced form (in terms of the homomorphic circuit-depth) for the corresponding boolean circuit of the 32-bits integers adder. This result leads to the possibility of performing more efficient homomorphic implementations for other applications which are based on the 32-bits integers addition. Secondly, we present a bit-sliced implementation for the homomorphic evaluation of the SPECK cipher encryption round. The proposed implementation offers good results in terms of time costs and memory required to process the algorithm's rounds. With our implementation we completed 11 of 22 rounds of the SPECK32/64. From our knowledge, this is the first research of its kind for this cipher. Source


Togan M.,certSIGN | Morogan L.,Military Technical Academy | Plesca C.,certSIGN
Proceedings of the Romanian Academy Series A - Mathematics Physics Technical Sciences Information Science | Year: 2015

The cloud computing providers need to offer security warranties. As we all know, one of the critical points is the confidentiality and access to customer data which, these days, is migrated and managed in cloud environments. In this sense, one solution is based on encrypting data before its upload in cloud. But this approach sets a limit regarding data processing. In this article we present a practical application of the homomorphic encryption schemes, namely the problem of finding maximum/minimum from a collection of encrypted integers. First, we present our algorithm that can be run directly in cloud without the need for an intermediate data exchange with the client. Second, our experimental results show the time resources necessary to evaluate the proposed algorithm. Source


Rosia N.,Advanced Technology Institute | Rosia N.,Military Technical Academy | Cervicescu V.,Military Technical Academy | Togan M.,certSIGN
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2015

Public-key cryptosystems and algorithms, including RSA [20], EC and Diffie-Hellman key exchange [5], require efficient large integer arithmetic in finite fields. Contemporary processors are not designed to support such operations in a productive manner, since most of them natively work on 8 to 64 bit word sizes. Thus, an expensive cryptographic accelerator is frequently required to offload the computational burden. In this paper, we focus on a highly parallel architecture which is commonly found in commodity computers, i.e. the Graphical Processing Unit (GPU). Recently, GPUs have known an exponential growth in terms of computing power, becoming a cost-effective option for offloading computationally intensive tasks. This paper describes a parallel implementation of the Montgomery Multiplication, as well as optimizations that enable efficient exploitation of the CUDA GPU architecture. © Springer International Publishing Switzerland 2015. Source

Discover hidden collaborations