
Citation: | Yi-Nan Lin, Gwo-Jen Chiou, Victor R. L. Shen. Multimedia Encryption with Multiple Modes Product Cipher for Mobile Devices[J]. Journal of Electronic Science and Technology, 2018, 16(2): 184-190. DOI: 10.11989/JEST.1674-862X.70524018 |
In the wireless networks, the confidentiality of private information is protected[1]-[3]. A block cipher itself only allows the encryption to be performed with a single data set in the cipher’s block length. Block encryption may be vulnerable to ciphertext searching, replaying, insertion, and deletion because it encrypts each block independently. Its disadvantage is that identical plaintext blocks are encrypted into the identical ciphertext blocks.
Unfortunately, non-feedback conventional block ciphers do not hide data patterns well. Non-feedback conventional block ciphers have plaintext-ciphertext pair problems with the disadvantages of limiting block region scrambles. A crack can use it to perform a known-plaintext attack. In some senses, it cannot provide serious message confidentiality. A non-feedback conventional block cipher is not recommended at all for use in cryptographic protocols.
As the images are shown in Fig. 1, the original image in a pixel-map version in Fig. 1 (a) is encrypted with a electronic codebook (ECB) mode to create the encrypted image in Fig. 1 (b). Following the original image or the encrypted image is the number of colors used in the image and the image’s histogram. Fig. 1 (b) represents the ECB DES encryption of the original image using the key 1234567890ABCDEF.
The non-feedback ECB mode can leave plaintext data patterns in the ciphertext. In Fig. 1, a striking example of the degree can be seen when the electronic codebook mode is used to encrypt a bitmap image which contains large areas of uniform color. The overall image may still be discerned as the pattern of identically-colored pixels in the original image remained in the encrypted version while the color of each individual pixel is encrypted. Block cipher modes of encryption different from the non-feedback ECB mode have been suggested to remedy these drawbacks. The straightforward block ciphering mode of operation (also called ECB mode) is not considered to be secure, because it is vulnerable to statistical attacks[4].
The standard modes of operation are described in the literatures[5] such as non-feedback electronic codebook (ECB) mode, cipher block chaining (CBC) mode, output feedback (OFB) mode, and cipher feedback (CFB) mode. They can all provide confidentiality. But how to choose an appropriate operation mode becomes an important issue. Different modes have different characters. For example, both CFB and OFB can be designed to operate without padding with bit-based size keystream output. BothCBCand CFB can self-synchronize to avoid the channel noise error propagation.For CFB and OFB, their encryption and decryption need only one encryption module to reach both usages. In addition, only the forward cipher function of the block cipher algorithm is used in both encryption and decryption, without the need for the inverse cipher function[1].
The rest of this paper is organized as follows. Section 2 contains the review of ciphers and video encryption algorithm (VEA). Section 3 describes how to make multiple modes ciphering with a secured mode sequence and the multiple modes product cipher (MMPC). Section 4 is the security analysis. Section 5 contains the practical implementation of mobile devices and performance evaluation. Finally, the conclusion is remarked in Section 6.
Currently, data confidentiality is one of the security services in cryptography. The major concept in information security is to continue to improve encryption algorithms. There are two major types of encryption algorithms in cryptography, namely, symmetric-key algorithms[6],[7] and public-key algorithms[8],[9]. Symmetric-key algorithms also referred to as conventional encryption algorithms or single-key encryption algorithms are a class of algorithms that use the same cryptographic keys for both encryption of plaintext and decryption of ciphertext. So far, it has remained the above two types of encryption algorithms most widely used.
Symmetric-key ciphers are a class of ciphers in cryptography. They use trivially related cryptographic secret keys for both encryption of plaintext and decryption of ciphertext. Symmetric-key cryptography is here to be contrasted with asymmetric-key cryptography. Symmetric-key cryptography is the only one type of encryption in use prior to the development of asymmetric-key cryptography[10],[11]. The advanced encryption standard (AES)[12]-[14] algorithm approved by National Institute of Standards and Technology (NIST) in December 2001 uses 128-bit blocks.
Multimedia data sets have special characteristics, such as coding structure, large amount of data, and real-time constraints. A multimedia stream is quite different from the traditional textual data because it has a special data structure and is also compressed[15],[16]. To provide the security requirements of confidentiality, multimedia security often uses encryption software to ensure the safety of computational complexity in the multimedia. Notice that the common thing between compression and encryption is that both try to remove redundant information[17].
There are several encryption algorithms, such as the naive algorithm and selective algorithm to secure multimedia contents. The naive method is to encrypt the entire multimedia contents using standard encryption methods such as DES and AES. Each of them has its strength and weakness in terms of the security level, speed, and resulting stream size metrics. For example, in the Moving Picture Experts Group (MPEG) contents, the basic selective algorithm is based on the MPEG IPB frames structure. Encrypting only I-frames does not provide a satisfactory secure level, because great portions of the video are visible, partly dependent on the inter-frame correlation and mainly dependent on the unencrypted I-blocks in P-frames and B-frames[18].
Zigzag-permutation algorithm[19], where the encryption is an integral part of the MPEG compression process, uses a random permutation list to map the individual 8×8 block to a 1×64 vector in “zigzag”. It consists of three steps: Step 1, generate a permutation list with cardinality of 64. Step 2, do the splitting procedure. Step 3, apply the random permutation list to the split block.
In 1998, [17] described, evaluated, and compared five representative MPEG encryption algorithms with respect to the encryption speed, security level, and stream size. It indicates that there are trade-offs among performance evaluation metrics. The choice of encryption algorithm will depend on the security requirements of the multimedia applications. Study on MPEG properties and its statistical behavior lead to the video encryption algorithm (VEA). In Fig. 2, VEA is mainly interested in dealing with the MPEG stream in a byte-by-byte fashion due to the following reasons: 1) It is easier to handle data byte-wise; 2) a single byte is meaningless in multimedia stream because, normally, the multimedia content is encoded in several bytes. This is different from text information where one byte or character has its own meaning. Therefore, VEA is used to convert an MPEG bit stream into a byte stream. And each unit has an integer between 0 and 255.
The idea of using multiple confidentiality modes with a secured mode sequence to increase the security level of multimedia is described in this Section, . The traditional block ciphers have a plaintext-ciphertext pair problem with the disadvantages of limiting block region scrambles. In the literature[5],[20], standard operational modes for data confidentiality are specified using any approved block cipher, such as the AES algorithm[12]-[14]. The operational modes are ECB, cipher block chaining (CBC), cipher feedback (CFB), output feedback (OFB), and counter (CTR). These standard operational modes are used to provide the data confidentiality function. An initialization vector (IV) or initial counter value must be required for CBC, CFB, OFB, and CTR modes, performing the encryption operation at the beginning of any communication session and the decryption operation at the end. The detailed descriptions are shown in the following formulas.
ECB:ECBe:Ci=EK(Pi)fori=1,2,⋯,nECBd:Pi=DK(Ci)fori=1,2,⋯,n. |
CBC:CBCe:C1=EK(P1⊕IV)Ci=EK(Pi⊕Ci−1)fori=2,3,⋯,n(2)CBCd:P1=DK(C1⊕IV)Pi=DK(Ci⊕Ci−1)fori=2,3,⋯,n. |
CFB:CFBe:O1=EK(IV)Oi=EK(Ci−1)fori=2,3,⋯,nCi=Pi⊕Oifori=1,2,⋯,n−1C∗n=P∗n⊕MSBu(On)CFBd:O1=EK(IV)Oi=EK(Ci−1)fori=2,3,⋯,nPi=Ci⊕Oifori=1,2,⋯,n−1P∗n=C∗n⊕MSBu(On). |
OFB:OFBe:O1=EK(IV)Oi=EK(Oi−1)fori=2,3,⋯,nCi=Pi⊕Oifori=1,2,⋯,n−1C∗n=P∗n⊕MSBu(On)OFBd:O1=EK(IV)Oi=EK(Oi−1)fori=2,3,⋯,nPi=Ci⊕Oifori=1,2,⋯,n−1P∗n=C∗n⊕MSBu(On). |
CTR:CTRe:Oi=EK(Counteri−1)fori=1,2,⋯,nCi=Pi⊕Oifori=1,2,⋯,n−1C∗n=P∗n⊕MSBu(On)(5)CTRd:Oi=EK(Counteri−1)fori=1,2,⋯,nPi=Ci⊕Oifori=1,2,⋯,n−1P∗n=C∗n⊕MSBu(On). |
The above cipher modes of operation can dynamically switch among them. We use a finite state machine (FSM) to explain the state between block operations in Fig. 3. The FSM means that a block cycle is changed. In general, the ECB operation mode continues to be used in a session. CBC, CFB OFB, and CTR are the same as shown in Fig. 3 (a). Fig. 3 (b) shows the multiple modes ciphering, which is proposed to achieve dynamic changes. The outside looking is as simple as the upper part although the inside operations are all busy and dynamic.
We take a mode sequence as an example in Table 1 and Fig. 4. The control sequence is synchronous between encryption and decryption. It is pre-shared as secret and secure information. However, the additional cost of a target control sequence can be flexibly reduced according to the practical requirements of security. Our idea can extend to contain and spread to other confidentiality modes which are not yet included in the standards[5],[20].
Block #i | 1 | 2 | 3 | 4 | 5 | 6 | 7 | ··· |
Mode | CFB | CBC | OFB | CTR | ECB | CTR | CFB | ··· |
The improvement of multimedia security is based on a secure secret. This secret of mode sequence can be created by a synchronous pseudo-random number generator.
Two schemes are designed for mode selection. The current mode change depends on three choice bits of the last plaintext. For example, if the choice bits are 0012, then we make the current mode changed to the CBC mode. Therefore, 0002 denotes ECB, 0012 denotes CBC, 0102 denotes CFB, 0112 denotes OFB, and 1002 denotes CTR. The proposed exchange mechanism is to choose 3 bits obtained from the last block plaintext before operating the current block. The mode change depends on the 3 choice bits S, i.e. S0S1S2.
First, an easy change is done by using three bits of plaintext from the previous block plaintext before operating the current block. We define the current mode change, which depends on the msb./lsb./middle three bits of the last plaintext. The mode change depends on the partial 3-bit message:
cS=S0S1S2=filter(Pi−1)=MSB3−bit(Pi−1)orMID3−bit(Pi−1). |
(6) |
We can improve the easy change by using the Hash functions. This case results in hard scrambled performance and an extra cost of the resource.
cS=S0S1S2=f(Pi−1)=Hash3−bit(Pi−1)=LSB3−bit(MD5(Pi−1))orLSB3−bit(SHA−1(Pi−1)). |
(7) |
Also, we use a synchronous pseudo random number generator (PRNG) as a synchronizer of multiple modes ciphering. Here, we can use another PRNG as the keystream generator of a stream cipher. A stream cipher can be a second cipher of a product cipher, and the first cipher of this product cipher is the multiple modes cipher. A synchronous PRNG is used as a synchronizer of multiple modes ciphering and the keystream generator of a stream cipher for product ciphering.
The idea of block ciphering modes is depicted in Fig. 5. Crossing the horizontal axis “time”, MMPC makes ciphering modes between the previous and the next block ciphering procedures different.
The improvement of security is based on a secure secret. The extra secure mode sequence can be created by a synchronous PRNG, which is used as a synchronizer of multiple modes ciphering and the keystream generator for product ciphering together with MMPC.
As we all know, combining #w confidentiality modes with an MMPC which has #n ciphering blocks, there are wn kinds of multimode combinations. Therefore, combining all five standard confidentiality modes with n ciphering blocks, there are 5n kinds of multimode combinations.
When the PRNG with a maximum b bits of period is used as a synchronizer of multiple modes ciphering and the keystream generator for product ciphering, the increasing security range of MMPC with multiple modes ciphering and product ciphering has 5n×2b kinds of resulting combinations. The increasing security level of MMPC has log2(5n×2b)=log2(5n)+b bits.
w=numberofsuppurtingconfidentialitymodes |
(8) |
n=numberofcipheringblocks |
(9) |
#(MMC)=numberofmultiplemodesciphering=wn |
(10) |
b=numberbitsofperiodofPRNG |
(11) |
#(MMPC)=numberofincreasingsecurityrangeofMMPC=2bwn |
(12) |
log2(#(MMPC))=numberofincreasingsecuritylevelofMMPC=log2(2bwn)=log2(wn)+b. |
(13) |
In wireless networks, the confidentiality of private information is protected by the algorithms[1]-[3]. A block cipher itself only allows the encryption to be performed with a single data set in the cipher’s block length. Block encryption may be vulnerable to ciphertext searching, replaying, insertion, and deletion because it encrypts each block independently.
We have programed a multiple modes AES-128 ciphering App on the IDE platform in eclipse JUNO 64-bit version[21]. There are comparison results from three different mobile devices, which are running this Android App. The testing performance and specifications of each mobile device are described in Table 2. We use two multimedia files as the test samples. The characteristics of our multimedia test files are shown in Table 3.
DMA-6410L | HTC | ||
Specifications | Platform | Desire S | Nexusi S 9023 |
Processor | S3C6410XH 66 | MSM8255 | Exynos 3110 |
Instruction | ARMv6 | ARMv7 | ARMv7 |
Core | ARM11 | Cortex-A8 | Cortex-A8 |
Manufacturer | Samsung | Qualcomm | Samsung |
Frequency | 667 MHz | 1 GHz | 1 GHz |
ROM | 128 MB | 1.1 GB | 16 GB |
RAM | 256 MB | 768 MB | 512 MB |
Android | 1.6 up to 2.1 | 2.3 | 2.3 up to 4.1.2 |
Battery | none (DC 5V) | 1450 mAh | 1500 mAh |
(a) VIDEO | |||
File Name | Elephants 1800k.3gp | ||
URL | http://download.wavetlan.com/SVV/Media/HTTP/H264/OtherMedia/elephants1800k.3gp | ||
File size | 60.6 MB | ||
Length | 4 min 48 s | ||
Video format | AVC-baseline | ||
Audio format | AAC-LC | ||
Overall bit rate | 1762 kbps | ||
Frames | 24 fps | ||
(b) IMAGE | |||
File name | 4.2.04.jpgf | ||
URL | http://en.wikipedia.org/wiki/File:Lenna.png | ||
File size | 786572 bytes | ||
File type | TIFF | ||
Image size | 512×512 pixels | ||
Compression | Uncompressed | ||
Photometric interpretation | RGB | ||
Bits per sample | 8, 8, 8 | ||
We test one hundred times on each file and calculate the average processing time. The processing results from straightforward ciphering are shown in Table 4. The processing results from multiple modes ciphering are shown in Table 5. Fig. 6 shows that the multiple modes ciphering throughputs are set between 2.5 Mbps and 53.7 Mbps on the current general class of mobile devices. Fig. 7 shows the MMPC encryption results.
Samples | DMA-6410L platform | HTC Desire S | Google Nexus S i9023 |
Elephants 1800k.3gp (s) | 189.799 | 22.543 | 8.902 |
4.2.04.jpgf (ms) | 2463.275 | 293.932 | 115.939 |
Processing time (s/MB) | ~3.132 | ~0.372 | ~0.147 |
Samples | DMA-6410L platform | HTC Desire S | Google Nexus S i9023 |
Elephants 1800k.3gp (s) | 193.627 | 22.906 | 9.090 |
4.2.04.jpgf (ms) | 2514.206 | 297.118 | 117.932 |
Processing time (s/MB) | ~3.199 | ~0.378 | ~0.149 |
Symmetric-key encryption algorithms can use either stream ciphers or block ciphers. Block ciphers take a number of bits to be encrypted as a single unit, padding the plaintext so that it can be a multiple of block size. A block with 64 bits has been commonly used. The AES[12]-[14] algorithm approved by NIST in December 2001 uses a block with 128 bits. Many modern block ciphers have invertible functions different from other non-invertible functions.
We have implemented the encryption and decryption schemes on the IDE platform in the eclipse JUNO 64-bit version[21]: i) the straightforward ECB mode AES, ii) the CBC mode AES, and iii) our MMPC AES. Then, the encryption and decryption schemes with two samples are tested. And three same kinds of mobile devices are used for running the implemented Android App. Our encryption results are better than those from the existing triple-DES and AES.
As shown in Table 6, the straightforward ECB mode AES has the maximum execution time. The CBC mode has a 101.1% speed overhead if it is compared with the straightforward ECB mode AES. Our MMPC AES increases speed overhead only by 0.2% on average if it is compared with the CBC mode AES. The secret key expansion overhead of our scheme is a mode operation key, which can be a secret mode sequence, a constant secret with 128 bits of pseudo random number seed, or just a secret initial vector (IV) with any digital content size.
Encryption scheme | Straightforward ECB mode AES | CBC mode AES | MMPC AES |
Secret key1 | AES algorithm key | AES algorithm key | AES algorithm key |
Secret key2 | 0 | 0 | Mode operation key |
Initial vector (IV) overhead | 0 | 1 | 1 |
Product cipher character | No | No | Yes |
One step character | Yes | Yes | Yes |
Performance (relative CPU time) | 1.000 | 1.011 | 1.013 |
Most of the contents in wireless networks are the products obtained from social applications or multimedia applications. Therefore, people can frequently share their information with one another, especially including large scale data sets, such as video streaming. In this paper, we have proposed an approach to improve multimedia security with multiple modes ciphering for mobile devices. The contributions of this paper are stated as follows:
1) The seamless changing confidentiality modes of ciphering operation are easily used to selectthe standard modes.
2) In the multimedia encryption software, our Android App system has shown that an overhead of multiple modes ciphering is estimated from 1.3% to 2%. It is just a certain decreasing throughputs if it is compared with the straight for ward ciphering.
3) MMPC can increase an acceptable security level in wireless multimedia networks.
In order to increase the feasibility of our approach, e.g. more tested mobile devices, the proposed App system needs to be further improved in the future.
[1] |
M. Dener, " Security analysis in wireless sensor networks,” Intl. Journal of Distributed Sensor Networks, pp. 1-9, 2014, DOI: 10.1155/2014/303501
|
[2] |
M. A. Tawhid and H. Mahmood, " Recent trends in wireless sensor networks with applications,” Intl. Journal of Distributed Sensor Networks, pp. 1-4, 2014, DOI: 10.1155/2014/912574
|
[3] |
R. V. Sampangi and S. Sampalli, " Metamorphic framework for key management and authentication in resource-constrained wireless networks,” Intl. Journal of Network Security, vol. 19, no. 3, pp. 430-442, 2017.
|
[4] |
S. Rashid, Q. Ayub, and A. H. Abdullah, " Reactive weight based buffer management policy for DTN routing protocols,” Wireless Personal Communications, vol. 80, no. 3, pp. 993-1010, 2015.
|
[5] |
M. J. Dworkin, " Recommendation for block cipher modes of operation methods and techniques,” National Institute of Standard & Technology, vol. 5, no. 6, pp. 669-675, 2003.
|
[6] |
C.-S. Chen, X. Yu, Y.-X. Xiang, X. Li, and T. Li, " An improved DPA attack on DES with forth and back random round algorithm,” Intl. Journal of Network Security, vol. 19, no. 2, pp. 285-294, 2017.
|
[7] |
I.-C. Lin, M.-S. Hwang, and C.-C. Chang, " A new key assignment scheme for enforcing complicated access control policies in hierarchy,” Future Generation Computer Systems, vol. 19, no. 4, pp. 457-462, 2003.
|
[8] |
G. Sharma, S. Bala, and A. K. Verma, " An improved RSA-based certificateless signature scheme for wireless sensor networks,” Intl. Journal of Network Security, vol. 18, no. 1, pp. 82-89, 2016.
|
[9] |
C.-C. Chang, C.-Y. Sun, and S.-C. Chang, " A strong RSA-based and certificateless-based signature scheme,” Intl. Journal of Network Security, vol. 18, no. 2, pp. 201-208, 2016.
|
[10] |
H. Toral-Cruz, A. D. Mihovska, M. Voznak, K. I. Lakhtaria, and R. Bestak, " Research trends and challenges for network-based ICT systems,” Wireless Personal Communications, vol. 85, no. 1, pp. 1-7, 2015.
|
[11] |
W. Stallings and L. V. Brown, Computer Security, Boston: Prentice-Hall, 2008.
|
[12] |
Advanced Encryption Standard, Federal Information Processing Standard, FIPS-197.
|
[13] |
A. Mirsaid and T. Gulom, " The encryption algorithm AES-RFWKIDEA32-1 based on network RFWKIDEA32-1,” Intl. Journal of Electronics and Information Engineering, vol. 4, no. 1, pp. 1-11, 2016.
|
[14] |
A. Mirsaid and T. Gulom, " The encryption algorithm AES-RFWKPES32-4,” Intl. Journal of Electronics and Information Engineering, vol. 5, no. 1, pp. 20-29, 2016.
|
[15] |
F. Jiang, P. Salama, and B. King, " A public-key approach of selective encryption for images,” Intl. Journal of Network Security, vol. 19, no. 1, pp. 118-126, 2017.
|
[16] |
C. Jin and H. Liu, " A color image encryption scheme based on arnold scrambling and quantum chaotic,” Intl. Journal of Network Security, vol. 19, no. 3, pp. 347-357, 2017.
|
[17] |
L. Qiao and K. Nahrstedt, " Comparison of MPEG encryption algorithms,” Computers & Graphics, vol. 22, no. 4, pp. 437-448, 1998.
|
[18] |
L. Yuan, H. Li, and Y. Wan, " A novel UEP fountain coding scheme for scalable multimedia transmission,” IEEE Trans. on Multimedia, vol. 18, no. 7, pp. 1389-1400, 2016.
|
[19] |
L. Tang, " Methods for encrypting and decrypting MPEG video data efficiently,” in Proc. of the 4th ACM Intl. Conf. on Multimedia, Orlando, 1997, pp. 219-229.
|
[20] |
Information Technology-Security Techniques-Modes of Operation for an n-bit Block Cipher, ISO/IEC 10116, 2006.
|
[21] |
Google Android developers. [Online]. Available: http://developer.android.com
|
[1] | Jau-Ling Shih, Chang-Hsing Lee, Yao-Wen Hou, Po-Ting Yeh. Three-Dimensional Model Retrieval Using Dynamic Multi-Descriptor Fusion[J]. Journal of Electronic Science and Technology, 2017, 15(2): 169-177. DOI: 10.11989/JEST.1674-862X.6071527 |
[2] | Min-Sung Koh, Esteban Rodriguez-Marek. Perfect Reconstructable Decimated One-Dimensional Empirical Mode Decomposition Filter Banks[J]. Journal of Electronic Science and Technology, 2014, 12(2): 196-200. DOI: 10.3969/j.issn.1674-862X.2014.02.011 |
[3] | Guo-Dong Shi, Qiu-Juan Cao, Bo-Cheng Bao, Zheng-Hua Ma. Dynamics and Operation-State Estimation of Current-Mode Controlled Flyback Converter[J]. Journal of Electronic Science and Technology, 2013, 11(3): 306-311. DOI: 10.3969/j.issn.1674-862X.2013.03.013 |
[4] | Rui Liu, Hong-Fu Li. Study of Mode Coupling on Coaxial Resonators[J]. Journal of Electronic Science and Technology, 2011, 9(3): 221-226. DOI: 10.3969/j.issn.1674-862X.2011.03.005 |
[5] | Ai-Ling He, De-Guo Zeng, Jun Wang, Bin Tang. Multi-Parameter Signal Sorting Algorithm Based on Dynamic Distance Clustering[J]. Journal of Electronic Science and Technology, 2009, 7(3): 249-253. |
[6] | Kevin Cook, John Canning, John Holdsworth, Chris Dewhurst. Stable CW Single-Mode Photonic Crystal Fiber DFB Ring Laser[J]. Journal of Electronic Science and Technology, 2008, 6(4): 442-444. |
[7] | Bo-Cheng Bao, Jian-Ping Xu, Yan Liang. Inductor Current Sampled Feedback Control of Chaos in Current-Mode Boost Converter[J]. Journal of Electronic Science and Technology, 2008, 6(1): 52-55. |
[8] | Li-Li Ma, Sheng-Xiang Bao, De-Chun Lu, Zhi-Bo Du. IC Surface Corrosion Inspection by C-mode Scanning Acoustic Microscopy[J]. Journal of Electronic Science and Technology, 2007, 5(4): 336-339. |
[9] | YAN Yong-ming, ZENG Yun. USB Dual-Mode Function IP Core Development[J]. Journal of Electronic Science and Technology, 2006, 4(1): 59-62,76. |
[10] | ZHANG Li, QIU Shui-sheng. Analysis and Experimental Study of Proportional-Integral Sliding Mode Control for DC/DC Converter[J]. Journal of Electronic Science and Technology, 2005, 3(2): 140-143. |
Block #i | 1 | 2 | 3 | 4 | 5 | 6 | 7 | ··· |
Mode | CFB | CBC | OFB | CTR | ECB | CTR | CFB | ··· |
DMA-6410L | HTC | ||
Specifications | Platform | Desire S | Nexusi S 9023 |
Processor | S3C6410XH 66 | MSM8255 | Exynos 3110 |
Instruction | ARMv6 | ARMv7 | ARMv7 |
Core | ARM11 | Cortex-A8 | Cortex-A8 |
Manufacturer | Samsung | Qualcomm | Samsung |
Frequency | 667 MHz | 1 GHz | 1 GHz |
ROM | 128 MB | 1.1 GB | 16 GB |
RAM | 256 MB | 768 MB | 512 MB |
Android | 1.6 up to 2.1 | 2.3 | 2.3 up to 4.1.2 |
Battery | none (DC 5V) | 1450 mAh | 1500 mAh |
(a) VIDEO | |||
File Name | Elephants 1800k.3gp | ||
URL | http://download.wavetlan.com/SVV/Media/HTTP/H264/OtherMedia/elephants1800k.3gp | ||
File size | 60.6 MB | ||
Length | 4 min 48 s | ||
Video format | AVC-baseline | ||
Audio format | AAC-LC | ||
Overall bit rate | 1762 kbps | ||
Frames | 24 fps | ||
(b) IMAGE | |||
File name | 4.2.04.jpgf | ||
URL | http://en.wikipedia.org/wiki/File:Lenna.png | ||
File size | 786572 bytes | ||
File type | TIFF | ||
Image size | 512×512 pixels | ||
Compression | Uncompressed | ||
Photometric interpretation | RGB | ||
Bits per sample | 8, 8, 8 | ||
Samples | DMA-6410L platform | HTC Desire S | Google Nexus S i9023 |
Elephants 1800k.3gp (s) | 189.799 | 22.543 | 8.902 |
4.2.04.jpgf (ms) | 2463.275 | 293.932 | 115.939 |
Processing time (s/MB) | ~3.132 | ~0.372 | ~0.147 |
Samples | DMA-6410L platform | HTC Desire S | Google Nexus S i9023 |
Elephants 1800k.3gp (s) | 193.627 | 22.906 | 9.090 |
4.2.04.jpgf (ms) | 2514.206 | 297.118 | 117.932 |
Processing time (s/MB) | ~3.199 | ~0.378 | ~0.149 |
Encryption scheme | Straightforward ECB mode AES | CBC mode AES | MMPC AES |
Secret key1 | AES algorithm key | AES algorithm key | AES algorithm key |
Secret key2 | 0 | 0 | Mode operation key |
Initial vector (IV) overhead | 0 | 1 | 1 |
Product cipher character | No | No | Yes |
One step character | Yes | Yes | Yes |
Performance (relative CPU time) | 1.000 | 1.011 | 1.013 |