Computing Cryptographic Algorithms in Portable and Embedded Devices

Ramachandran, Aswin; Zhou, Zhibin; Huang, Dijiang

doi:10.1109/portable.2007.47

Cited by 42 publications

(14 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In the implementation two libraries were used as tools to perform mathematical operations: MIRACL (Multiprecision Integer and Rational Arithmetic C/C++ Library) due to its application in other papers (Ramachandran et al, 2007), and RELIC 0.2.3 (Library for Efficient Cryptography) (Relic, 2011). The MIR-ACL library produced by Shamus Software is proprietary, but free for educational use.…”

Section: Elliptic Curve Cryptography (Ecc) and Developed Algorithmsmentioning

confidence: 99%

Performance Evaluation and Comparison of Algorithms for Elliptic Curve Cryptography with El-Gamal based on MIRACL and RELIC Libraries

Pigatto

Silva

Branco

2012

jacr

View full text Add to dashboard Cite

This paper presents a comparison between two implementations of the elliptic curve cryptography (ECC) algorithm based on El-Gamal. Each implementation uses different cryptographic libraries: MIRACL and RELIC. The application of this algorithm meets the common needs of most critical embedded systems, focusing on unmanned aerial and ground vehicles (UAVs and UGVs) and addressing the particularities of each scenario, such as limitations of computing resources and energy supply. One of the challenges is to study and evaluate the impact of the use of each library via a performance evaluation based on statistical techniques. The results have presented the best solution and the influences of each algorithm on response times for each experiment, varying the sizes of keys used by the algorithms.

show abstract

Section: Elliptic Curve Cryptography (Ecc) and Developed Algorithmsmentioning

confidence: 99%

Performance Evaluation and Comparison of Algorithms for Elliptic Curve Cryptography with El-Gamal based on MIRACL and RELIC Libraries

Pigatto

Silva

Branco

2012

jacr

View full text Add to dashboard Cite

show abstract

“…In ACP scheme, the author reports that the encryption needs O(N 2 ) finite field operations when the sub-group size if N ; in the BGW scheme, the encryption and decryption require O(N ) operations on the bilinear group, which are heavier than finite field operations [18,30]. In ABBE, each encryption requires log N operations on the G 0 , and the decryption requires 2 log N +1 pairings and log N (log N −1)+log N operations on G 0 and log N operations on G 1 .…”

Section: Computation Overheadmentioning

confidence: 99%

On efficient ciphertext-policy attribute based encryption and broadcast encryption

Zhou

Huang

2010

Proceedings of the 17th ACM Conference on Computer and Communications Security

Self Cite

View full text Add to dashboard Cite

Abstract. Ciphertext Policy Attribute Based Encryption (CP-ABE) enforces an expressive data access policy, which consists of a number of attributes connected by logical gates. Only those decryptors whose attributes satisfy the data access policy can decrypt the ciphertext. CP-ABE is very appealing since the ciphertext and data access policies are integrated together in a natural and effective way. However, all existing CP-ABE schemes incur very large ciphertext size, which increases linearly with respect to the number of attributes in the access policy. Large ciphertext prevents CP-ABE from being adopted in the communication constrained environments. In this paper, we proposed a new construction of CP-ABE, named Constant-size CP-ABE (denoted as CCP-ABE) that significantly reduces the ciphertext to a constant size for an AND gate access policy with any given number of attributes. Each ciphertext in CCP-ABE requires only 2 elements on a bilinear group. Based on CCP-ABE, we further proposed an Attribute Based Broadcast Encryption (ABBE) scheme. Compared to existing Broadcast Encryption (BE) schemes, ABBE is more flexible because a broadcasted message can be encrypted by an expressive access policy, either with or without explicit specifying the receivers. Moreover, ABBE significantly reduces the storage and communication overhead to the order of O(log N ), where N is the system size. Also, we proved, using information theoretical approaches, ABBE attains minimal bound on storage overhead for each user to construct all possible subgroups in the communication system.

show abstract

“…In [3] and [4] some temporal benchmarking tests are executed in PDAs of similar characteristics than ours. The first has a throughput for AES-256 of 149.5 KBps, and the second 1382.7 KBps.…”

Section: Symmetric Algorithmsmentioning

confidence: 99%

“…Our results are much better, 4761.9 KBps. We impute the differences with [3] to the algorithms implementation (we use plain C instead of C#), and with [4] to the fact that they tested the cipher with very small input data (128 bits) so the operational costs of the initialization are not amortized. Finally, we compare the results with [1] that used an optimized self implementation library of AES.…”

Section: Symmetric Algorithmsmentioning

confidence: 99%