Journal articles: 'AES-GCM'

1

Jankowski, Krzysztof, and Pierre Laurent. "Packed AES-GCM Algorithm Suitable for AES/PCLMULQDQ Instructions." IEEE Transactions on Computers 60, no. 1 (January 2011): 135–38. http://dx.doi.org/10.1109/tc.2010.147.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kim, Kyungho, Seungju Choi, Hyeokdong Kwon, Hyunjun Kim, Zhe Liu, and Hwajeong Seo. "PAGE—Practical AES-GCM Encryption for Low-End Microcontrollers." Applied Sciences 10, no. 9 (April 30, 2020): 3131. http://dx.doi.org/10.3390/app10093131.

Full text

Abstract:

An optimized AES (Advanced Encryption Standard) implementation of Galois Counter Mode of operation (GCM) on low-end microcontrollers is presented in this paper. Two optimization methods are applied to proposed implementations. First, the AES counter (CTR) mode of operation is speed-optimized and ensures constant timing. The main idea is replacing expensive AES operations, including AddRound Key, SubBytes, ShiftRows, and MixColumns, into simple look-up table access. Unlike previous works, the look-up table does not require look-up table updates during the entire encryption life-cycle. Second, the core operation of Galois Counter Mode (GCM) is optimized further by using Karatsuba algorithm, compact register utilization, and pre-computed operands. With above optimization techniques, proposed AES-GCM on 8-bit AVR (Alf and Vegard’s RISC processor) architecture from short-term, middle-term to long-term security levels achieved 415, 466, and 477 clock cycles per byte, respectively.

APA, Harvard, Vancouver, ISO, and other styles

3

S. Bader, Ahmad, and Ali Makki Sagheer. "Modification on AES-GCM to Increment Ciphertext Randomness." International Journal of Mathematical Sciences and Computing 4, no. 4 (November 8, 2018): 34–40. http://dx.doi.org/10.5815/ijmsc.2018.04.03.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Zhang, Yong, Ning Wu, Fang Zhou, Xiaoqiang Zhang, and Jinbao Zhang. "High performance AES-GCM implementation based on efficient AES and FR-KOA multiplier." IEICE Electronics Express 15, no. 14 (2018): 20180559. http://dx.doi.org/10.1587/elex.15.20180559.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Abdellatif, Karim M., Roselyne Chotin-Avot, and Habib Mehrez. "AES-GCM and AEGIS: Efficient and High Speed Hardware Implementations." Journal of Signal Processing Systems 88, no. 1 (January 29, 2016): 1–12. http://dx.doi.org/10.1007/s11265-016-1104-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Li, Xiaoming, and James Huang. "Cache-collision side-channel analysis and attacks against AES-GCM." International Journal of Big Data Intelligence 7, no. 4 (2020): 211. http://dx.doi.org/10.1504/ijbdi.2020.10036404.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Huang, James, and Xiaoming Li. "Cache-collision side-channel analysis and attacks against AES-GCM." International Journal of Big Data Intelligence 7, no. 4 (2020): 211. http://dx.doi.org/10.1504/ijbdi.2020.113875.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Sajjan, Rajani S., and Vijay R. Ghorpade. "GCM-AES-VR A Scheme for Cloud Data Confidentiality and Authenticity." International Journal of Computer Sciences and Engineering 6, no. 12 (December 31, 2018): 86–94. http://dx.doi.org/10.26438/ijcse/v6i12.8694.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Jamaluddin, Jamaluddin, Naikson Saragih, Roni Simamora, and Rimbun Siringoringo. "Konsep Pengamanan Video Conference Dengan Enkripsi AES-GCM Pada Aplikasi Zoom." METHOMIKA: Jurnal Manajemen Informatika dan Komputerisasi Akuntansi 4, no. 1 (October 17, 2020): 109–13. http://dx.doi.org/10.46880/jmika.v4i2.211.

Full text

Abstract:

The conditions of the Covid-19 pandemic, which began to plague at the end of 2019, brought about major changes to the patterns of interaction in society. Activities that have been carried out directly have begun to shift to activities carried out online. The use of technology, especially in applications for online interaction patterns such as video conferencing applications, is an alternative. The Zoom Cloud Meeting application is widely used by people who initially had doubts about its security system. By implementing end-to-end encryption with AES-256-GCM, it has been able to convince clients on the information security side to keep using the Zoom Cloud Meeting application.

APA, Harvard, Vancouver, ISO, and other styles

10

Mozaffari-Kermani, Mehran, and Arash Reyhani-Masoleh. "Efficient and High-Performance Parallel Hardware Architectures for the AES-GCM." IEEE Transactions on Computers 61, no. 8 (August 2012): 1165–78. http://dx.doi.org/10.1109/tc.2011.125.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Lu, Ye, Tao Feng, and Guohua Ma. "Secure DNP3 Services Scheme in Smart Grid Link Layer Based on GCM-AES." International Journal of Security and Its Applications 10, no. 8 (August 31, 2016): 131–44. http://dx.doi.org/10.14257/ijsia.2016.10.8.11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Abdalrahman, Alameen. "A Cloud Database based on AES 256 GCM Encryption Through Devolving Web application of Accounting Information System." International Journal of Recent Technology and Engineering 9, no. 5 (January 30, 2021): 216–21. http://dx.doi.org/10.35940/ijrte.e5269.019521.

Full text

Abstract:

The main objective of this research is to use AES 256 GCM encryption and decryption of a web application system database called Accounting Information System (AIS) for achieving more privacy and security in a cloud environment. A cloud environment provides many services such as software, platform, and infrastructure. AIS can use the cloud to store data to achieve accounting with more performance, efficiency, convenience, and cost reduction. On the other hand, cloud environment is not secure because data is kept away from the organization. This paper focuses on how we deal with secure sensitive data such as accounting data AIS web application at web level encryption by using AES 256 GCM encryption to store data as encrypted data at cloud in a secure manner? Accounting Information System (AIS) has very sensitive data and its need to be more secure and safe specially in cloud because it’s not saved at local servers but at another cloud service provider. The storage of encryption and decryption keys are stored in locations and devices different from those in which the database is stored in the cloud for ensuring more safety.

APA, Harvard, Vancouver, ISO, and other styles

13

Liu, Zhenglin, Qingchun Zhu, Dongfang Li, and Xuecheng Zou. "Off-Chip Memory Encryption and Integrity Protection Based on AES-GCM in Embedded Systems." IEEE Design & Test 30, no. 5 (October 2013): 54–62. http://dx.doi.org/10.1109/mdat.2013.2255912.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Zhang, Zhun, Xiang Wang, Qiang Hao, Dongdong Xu, Jinlei Zhang, Jiakang Liu, and Jinhui Ma. "High-Efficiency Parallel Cryptographic Accelerator for Real-Time Guaranteeing Dynamic Data Security in Embedded Systems." Micromachines 12, no. 5 (May 15, 2021): 560. http://dx.doi.org/10.3390/mi12050560.

Full text

Abstract:

Dynamic data security in embedded systems is raising more and more concerns in numerous safety-critical applications. In particular, the data exchanges in embedded Systems-on-Chip (SoCs) using main memory are exposing many security vulnerabilities to external attacks, which will cause confidential information leakages and program execution failures for SoCs at key points. Therefore, this paper presents a security SoC architecture with integrating a four-parallel Advanced Encryption Standard-Galois/Counter Mode (AES-GCM) cryptographic accelerator for achieving high-efficiency data processing to guarantee data exchange security between the SoC and main memory against bus monitoring, off-line analysis, and data tampering attacks. The architecture design has been implemented and verified on a Xilinx Virtex-5 Field Programmable Gate Array (FPGA) platform. Based on evaluation of the cryptographic accelerator in terms of performance overhead, security capability, processing efficiency, and resource consumption, experimental results show that the parallel cryptographic accelerator does not incur significant performance overhead on providing confidentiality and integrity protections for exchanged data; its average performance overhead reduces to as low as 2.65% on typical 8-KB I/D-Caches, and its data processing efficiency is around 3 times that of the pipelined AES-GCM construction. The reinforced SoC under the data tampering attacks and benchmark tests confirms the effectiveness against external physical attacks and satisfies a good trade-off between high-efficiency and hardware overhead.

APA, Harvard, Vancouver, ISO, and other styles

15

Kankara, Mahidhara Reddy. "Encrypted e-Voting System using IoT." International Journal for Research in Applied Science and Engineering Technology 9, no. 9 (September 30, 2021): 453–60. http://dx.doi.org/10.22214/ijraset.2021.37973.

Full text

Abstract:

Abstract: Elections make a fundamental contribution to democratic governance but a lack of trust among citizens on their electoral system is a hindrance to satisfy the legal requirements of legislators. Even the world’s largest democratic countries suffer from issues like vote rigging, election manipulation and hacking of the electronic voting machines in the current voting system. To provide data security for e-Voting systems, the advanced encryption standard (AES) algorithm has been proposed, but traditional AES gives the same ciphertext for every similar pair of key and plaintext. So, to eliminate these disadvantages, AES in Galois-counter mode (GCM) has been used to obtain different ciphertexts all the time by using Initialization Vector. The fingerprint data from each user is verified using Internet of Things (IoT) based Biometric system which also helps to avoid Plural Voting. The whole data is encrypted and stored in the cloud, and it can be decrypted by authorized personnel to obtain the final vote count. So, the proposed model will enhance transparency and maintain anonymity of the voters alongside providing an easily accessible secured voting system. Keywords: Advanced encryption standard, initialization vector, additional authenticated data, galois-counter mode, biometrics, security, ciphertext, authtag

APA, Harvard, Vancouver, ISO, and other styles

16

Murali, A., and K. Hari Kishore. "Efficient and high speed key-independent AES-based authenticated encryption architecture using FPGAs." International Journal of Engineering & Technology 7, no. 1.5 (December 31, 2017): 230. http://dx.doi.org/10.14419/ijet.v7i1.5.9152.

Full text

Abstract:

Data manipulations are made with the use of communication and networking systems. But at the same time, data integrity is also a needed and important property that must be maintained in every data communicating systems. For this, the security levels are provided with cryptographic primitives like hash functions and block ciphers which are deployed into the systems. For efficient architectures, FPGA-based systems like AES-GCM and AEGIS-128 plays in the best part of the re-configurability, which supports the security services of such communication and networking systems. We possibly focus on the performance of the systems with the high security of the FPGA bit streams. GF (2128) multiplier is implemented for authentication tasks for high-speed targets. And also, the implementations were evaluated by using vertex 4.5 FPGA’s

APA, Harvard, Vancouver, ISO, and other styles

17

Sovyn, Yaroslav, Volodymyr Khoma, and Michal Podpora. "Comparison of Three CPU-Core Families for IoT Applications in Terms of Security and Performance of AES-GCM." IEEE Internet of Things Journal 7, no. 1 (January 2020): 339–48. http://dx.doi.org/10.1109/jiot.2019.2953230.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Diehl, William, Abubakr Abdulgadir, Farnoud Farahmand, Jens-Peter Kaps, and Kris Gaj. "Comparison of Cost of Protection against Differential Power Analysis of Selected Authenticated Ciphers." Cryptography 2, no. 3 (September 19, 2018): 26. http://dx.doi.org/10.3390/cryptography2030026.

Full text

Abstract:

Authenticated ciphers, which combine the cryptographic services of confidentiality, integrity, and authentication into one algorithmic construct, can potentially provide improved security and efficiencies in the processing of sensitive data. However, they are vulnerable to side-channel attacks such as differential power analysis (DPA). Although the Test Vector Leakage Assessment (TVLA) methodology has been used to confirm improved resistance of block ciphers to DPA after application of countermeasures, extension of TVLA to authenticated ciphers is non-trivial, since authenticated ciphers have expanded input and output requirements, complex interfaces, and long test vectors which include protocol necessary to describe authenticated cipher operations. In this research, we upgrade the FOBOS test architecture with capability to perform TVLA on authenticated ciphers. We show that FPGA implementations of the CAESAR Round 3 candidates ACORN, Ascon, CLOC (with AES and TWINE primitives), SILC (with AES, PRESENT, and LED primitives), JAMBU (with AES and SIMON primitives), and Ketje Jr.; as well as AES-GCM, are vulnerable to 1st order DPA. We then use threshold implementations to protect the above cipher implementations against 1st order DPA, and verify the effectiveness of countermeasures using the TVLA methodology. Finally, we compare the unprotected and protected cipher implementations in terms of area, performance (maximum frequency and throughput), throughput-to-area (TP/A) ratio, power, and energy per bit (E/bit). Our results show that ACORN consumes the lowest number of resources, has the highest TP/A ratio, and is the most energy-efficient of all DPA-resistant implementations. However, Ketje Jr. has the highest throughput.

APA, Harvard, Vancouver, ISO, and other styles

19

Campagna, Matthew, and Shay Gueron. "Key Management Systems at the Cloud Scale." Cryptography 3, no. 3 (September 5, 2019): 23. http://dx.doi.org/10.3390/cryptography3030023.

Full text

Abstract:

This paper describes a cloud-scale encryption system. It discusses the constraints that shaped the design of Amazon Web Services’ Key Management Service, and in particular, the challenges that arise from using a standard mode of operation such as AES-GCM while safely supporting huge amounts of encrypted data that is (simultaneously) generated and consumed by a huge number of users employing different keys. We describe a new derived-key mode that is designed for this multi-user-multi-key scenario typical at the cloud scale. Analyzing the resulting security bounds of this model illustrates its applicability for our setting. This mode is already deployed as the default mode of operation for the AWS key management service.

APA, Harvard, Vancouver, ISO, and other styles

20

Mobilon, Eduardo, and Dalton Soares Arantes. "100 Gbit/s AES-GCM Cryptography Engine for Optical Transport Network Systems: Architecture, Design and 40 nm Silicon Prototyping." Microelectronics Journal 116 (October 2021): 105229. http://dx.doi.org/10.1016/j.mejo.2021.105229.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Seo, Seog Chung, and Donggeun Kwon. "Highly Efficient SCA-Resistant Binary Field Multiplication on 8-Bit AVR Microcontrollers." Applied Sciences 10, no. 8 (April 19, 2020): 2821. http://dx.doi.org/10.3390/app10082821.

Full text

Abstract:

Binary field ( B F ) multiplication is a basic and important operation for widely used crypto algorithms such as the GHASH function of GCM (Galois/Counter Mode) mode and NIST-compliant binary Elliptic Curve Cryptosystems (ECCs). Recently, Seo et al. proposed a novel SCA-resistant binary field multiplication method in the context of GHASH optimization in AES GCM mode on 8-bit AVR microcontrollers (MCUs). They proposed a concept of Dummy XOR operation with a kind of garbage registers and a concept of instruction level atomicity ( I L A ) for resistance against Timing Analysis (TA) and Simple Power Analysis (SPA) and used a Karatsuba Block-Comb multiplication approach for efficiency. Even though their method achieved a large performance improvement compared with previous works, it still has room for improvement on the 8-bit AVR platform. In this paper, we propose a more improved binary field multiplication method on 8-bit AVR MCUs. Our method basically adopts a Dummy XOR technique using a set of garbage registers for TA and SPA security; however, we save the number of used garbage registers from eight to one by using the fact that the number of used garbage registers does not affect TA and SPA security. In addition, we apply a multiplier encoding approach so as to decrease the number of required registers when accessing the multiplier, which enables the use of extended block size in the Karatsuba Block-Comb multiplication technique. Actually, the proposed technique extends the block size from four to eight and the proposed binary field multiplication method can compute a 128-bit B F multiplication with only 3816 clock cycles ( c c ) (resp. 3490 c c ) with (resp. without) the multiplier encoding process, which is almost a 32.8% (resp. 38.5%) improvement compared with 5675 c c of the best previous work. We apply the proposed technique to the GHASH function of the GCM mode with several additional optimization techniques. The proposed GHASH implementation provides improved performance by over 42% compared with the previous best result. The concept of the proposed B F method can be extended to other MCUs, including 16-bit MSP430 MCUs and 32-bit ARM MCUs.

APA, Harvard, Vancouver, ISO, and other styles

22

Teh, Je Sen, and Azman Samsudin. "A Chaos-Based Authenticated Cipher with Associated Data." Security and Communication Networks 2017 (2017): 1–15. http://dx.doi.org/10.1155/2017/9040518.

Full text

Abstract:

In recent years, there has been a rising interest in authenticated encryption with associated data (AEAD) which combines encryption and authentication into a unified scheme. AEAD schemes provide authentication for a message that is divided into two parts: associated data which is not encrypted and the plaintext which is encrypted. However, there is a lack of chaos-based AEAD schemes in recent literature. This paper introduces a new 128-bit chaos-based AEAD scheme based on the single-key Even-Mansour and Type-II generalized Feistel structure. The proposed scheme provides both privacy and authentication in a single-pass using only one 128-bit secret key. The chaotic tent map is used to generate whitening keys for the Even-Mansour construction, round keys, and random s-boxes for the Feistel round function. In addition, the proposed AEAD scheme can be implemented with true random number generators to map a message to multiple possible ciphertexts in a nondeterministic manner. Security and statistical evaluation indicate that the proposed scheme is highly secure for both the ciphertext and the authentication tag. Furthermore, it has multiple advantages over AES-GCM which is the current standard for authenticated encryption.

APA, Harvard, Vancouver, ISO, and other styles

23

Gudodagi, Raveendra, and R. Venkata Siva Reddy. "Security Provisioning and Compression of Diverse Genomic Data based on Advanced Encryption Standard (AES) Algorithm." International Journal of Biology and Biomedical Engineering 15 (May 14, 2021): 104–12. http://dx.doi.org/10.46300/91011.2021.15.14.

Full text

Abstract:

Compression of genomic data has gained enormous momentum in recent years because of advances in technology, exponentially growing health concerns, and government funding for research. Such advances have driven us to personalize public health and medical care. These pose a considerable challenge for ubiquitous computing in data storage. One of the main issues faced by genomic laboratories is the 'cost of storage' due to the large data file of the human genome (ranging from 30 GB to 200 GB). Data preservation is a set of actions meant to protect data from unauthorized access or changes. There are several methods used to protect data, and encryption is one of them. Protecting genomic data is a critical concern in genomics as it includes personal data. We suggest a secure encryption and decryption technique for diverse genomic data (FASTA / FASTQ format) in this article. Since we know the sequenced data is massive in bulk, the raw sequenced file is broken into sections and compressed. The Advanced Encryption Standard (AES) algorithm is used for encryption, and the Galois / Counter Mode (GCM) algorithm, is used to decode the encrypted data. This approach reduces the amount of storage space used for the data disc while preserving the data. This condition necessitates the use of a modern data compression strategy. That not only reduces storage but also improves process efficiency by using a k-th order Markov chain. In this regard, no efforts have been made to address this problem separately, from both the hardware and software realms. In this analysis, we support the need for a tailor-made hardware and software ecosystem that will take full advantage of the current stand-alone solutions. The paper discusses sequenced DNA, which may take the form of raw data obtained from sequencing. Inappropriate use of genomic data presents unique risks because it can be used to classify any individual; thus, the study focuses on the security provisioning and compression of diverse genomic data using the Advanced Encryption Standard (AES) Algorithm.

APA, Harvard, Vancouver, ISO, and other styles

24

Iwata, Tetsu, and Yannick Seurin. "Reconsidering the Security Bound of AES-GCM-SIV." IACR Transactions on Symmetric Cryptology, December 15, 2017, 240–67. http://dx.doi.org/10.46586/tosc.v2017.i4.240-267.

Full text

Abstract:

We make a number of remarks about the AES-GCM-SIV nonce-misuse resistant authenticated encryption scheme currently considered for standardization by the Crypto Forum Research Group (CFRG). First, we point out that the security analysis proposed in the ePrint report 2017/168 is incorrect, leading to overly optimistic security claims. We correct the bound and re-assess the security guarantees offered by the scheme for various parameters. Second, we suggest a simple modification to the key derivation function which would improve the security of the scheme with virtually no efficiency penalty.

APA, Harvard, Vancouver, ISO, and other styles

25

"Data Privacy Preservation using AES-GCM Encryption in Heroku Cloud." International Journal of Recent Technology and Engineering 8, no. 3 (September 30, 2019): 7544–48. http://dx.doi.org/10.35940/ijrte.c6131.098319.

Full text

Abstract:

The increasing popularity of cloud data storage and its ever-rising versatility, shows that cloud computing is one of the most widely excepted phenomena. It not only helps with powerful computing facilities but also reduce a huge amount of computational cost. And with such high demand for storage has raised the growth of the cloud service industry that provides an affordable, easy-to-use and remotely-accessible services. But like every other emerging technology it carries some inherent security risks associated and cloud storage is no exception. The prime reason behind it is that users have to blindly trust the third parties while storing the useful information, which may not work in the best of interest. Hence, to ensure the privacy of sensitive information is primarily important for any public, third-party cloud. In this paper, we mainly focus on proposing a secure cloud framework with encrypting sensitive data’s using AES-GCM cryptographic techniques in HEROKU cloud platform. Here we tried to implement Heroku as a cloud computing platform, used the AES-GCM algorithm and evaluate the performance of the said algorithm. Moreover, analyses the performance of AES/GCM execution time with respect to given inputs of data

APA, Harvard, Vancouver, ISO, and other styles

26

Mennink, Bart, and Samuel Neves. "Optimal PRFs from Blockcipher Designs." IACR Transactions on Symmetric Cryptology, September 19, 2017, 228–52. http://dx.doi.org/10.46586/tosc.v2017.i3.228-252.

Full text

Abstract:

Cryptographic modes built on top of a blockcipher usually rely on the assumption that this primitive behaves like a pseudorandom permutation (PRP). For many of these modes, including counter mode and GCM, stronger security guarantees could be derived if they were based on a PRF design. We propose a heuristic method of transforming a dedicated blockcipher design into a dedicated PRF design. Intuitively, the method consists of evaluating the blockcipher once, with one or more intermediate state values fed-forward. It shows strong resemblance with the optimally secure EDMD construction by Mennink and Neves (CRYPTO 2017), but the use of internal state values make their security analysis formally inapplicable. In support of its security, we give the rationale of relying on the EDMD function (as opposed to alternatives), and present analysis of simplified versions of our conversion method applied to the AES. We conjecture that our main proposal AES-PRF, AES with a feed-forward of the middle state, achieves close to optimal security. We apply the design to GCM and GCM-SIV, and demonstrate how it entails significant security improvements. We furthermore demonstrate how the technique extends to tweakable blockciphers and allows for security improvements in, for instance, PMAC1.

APA, Harvard, Vancouver, ISO, and other styles

27

Marshall, Ben, G. Richard Newell, Dan Page, Markku-Juhani O. Saarinen, and Claire Wolf. "The design of scalar AES Instruction Set Extensions for RISC-V." IACR Transactions on Cryptographic Hardware and Embedded Systems, December 3, 2020, 109–36. http://dx.doi.org/10.46586/tches.v2021.i1.109-136.

Full text

Abstract:

Secure, efficient execution of AES is an essential requirement on most computing platforms. Dedicated Instruction Set Extensions (ISEs) are often included for this purpose. RISC-V is a (relatively) new ISA that lacks such a standardized ISE. We survey the state-of-the-art industrial and academic ISEs for AES, implement and evaluate five different ISEs, one of which is novel. We recommend separate ISEs for 32 and 64-bit base architectures, with measured performance improvements for an AES-128 block encryption of 4x and 10x with a hardware cost of 1.1K and 8.2K gates respectively, when compared to a software-only implementation based on use of T-tables. We also explore how the proposed standard bit-manipulation extension to RISC-V can be harnessed for efficient implementation of AES-GCM. Our work supports the ongoing RISC-V cryptography extension standardisation process.

APA, Harvard, Vancouver, ISO, and other styles

28

"Implementation of AES-GCM encryption algorithm for high performance and low power architecture Using FPGA." International Journal of Research and Applications 1, no. 3 (September 15, 2014): 120–31. http://dx.doi.org/10.17812/ijra.1.3(26)2014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Sakamoto, Kosei, Fukang Liu, Yuto Nakano, Shinsaku Kiyomoto, and Takanori Isobe. "Rocca: An Efficient AES-based Encryption Scheme for Beyond 5G." IACR Transactions on Symmetric Cryptology, June 11, 2021, 1–30. http://dx.doi.org/10.46586/tosc.v2021.i2.1-30.

Full text

Abstract:

In this paper, we present an AES-based authenticated-encryption with associated-data scheme called Rocca, with the purpose to reach the requirements on the speed and security in 6G systems. To achieve ultra-fast software implementations, the basic design strategy is to take full advantage of the AES-NI and SIMD instructions as that of the AEGIS family and Tiaoxin-346. Although Jean and Nikolić have generalized the way to construct efficient round functions using only one round of AES (aesenc) and 128-bit XOR operation and have found several efficient candidates, there still seems to exist potential to further improve it regarding speed and state size. In order to minimize the critical path of one round, we remove the case of applying both aesenc and XOR in a cascade way for one round. By introducing a cost-free block permutation in the round function, we are able to search for candidates in a larger space without sacrificing the performance. Consequently, we obtain more efficient constructions with a smaller state size than candidates by Jean and Nikolić. Based on the newly-discovered round function, we carefully design the corresponding AEAD scheme with 256-bit security by taking several reported attacks on the AEGIS family and Tiaxion-346 into account. Our AEAD scheme can reach 138Gbps which is 4 times faster than the AEAD scheme of SNOW-V. Rocca is also much faster than other efficient schemes with 256-bit key length, e.g. AEGIS-256 and AES-256-GCM. As far as we know, Rocca is the first dedicated cryptographic algorithm targeting 6 systems, i.e., 256-bit key length and the speed of more than 100 Gbps.

APA, Harvard, Vancouver, ISO, and other styles

30

Nawal, Aishwarya, Harish Soni, Shweta Arewar, and Varshita Gangadhara. "Secure File Storage On Cloud Using Hybrid Cryptography." International Journal of Advanced Research in Science, Communication and Technology, May 6, 2021, 79–83. http://dx.doi.org/10.48175/ijarsct-1101.

Full text

Abstract:

The servers that are accessed over the web and the software and databases that run on those servers are together known as "The Cloud". The amount of data needing storage is increasing every day and thus, there is a requirement for increased storage space. Cloud allows us to do the same. Storage of data on the cloud is done for various companies, colleges, for military purposes, etc. The data on the cloud is susceptible to various risks such as lack of backup services, data leakage, lack of control over your data being stored, etc. To provide a solution to these risks over cloud storage there are several ways, which include Cryptography and Steganography. Cryptography is quite popular for data security. The Cryptography technique translates original data into an unreadable form known as ciphertext. Text is converted into an unreadable form using keys. This ensures that only an authorized entity with the right key, can access the data from the cloud server. Ciphertext data is visible for everyone. There are two types of cryptography algorithms namely Symmetric Key cryptography and Asymmetric Key Cryptography. The use of a single cryptography algorithm provides basic security. In this paper, we have suggested the use of a combination of symmetric key cryptography algorithms namely: AES-GCM, Fernet, AES-CCM, CHACHA20_POLY1305 algorithm, which help to provide high-level security to the data. Here, the key is also secured using the Fernet algorithm. The file is split into N parts. Each part is encrypted simultaneously. For the file decryption purpose reverse process of encryption is applied.

APA, Harvard, Vancouver, ISO, and other styles

31

Bhattacharya, Srimanta, and Mridul Nandi. "Revisiting Variable Output Length XOR Pseudorandom Function." IACR Transactions on Symmetric Cryptology, March 1, 2018, 314–35. http://dx.doi.org/10.46586/tosc.v2018.i1.314-335.

Full text

Abstract:

Let σ be some positive integer and C ⊆ {(i, j) : 1 ≤ i < j ≤ σ}. The theory behind finding a lower bound on the number of distinct blocks P1, . . . , Pσ ∈ {0, 1}n satisfying a set of linear equations {Pi ⊕Pj = ci,j : (i, j) ∈ C} for some ci,j ∈ {0, 1}n, is called mirror theory. Patarin introduced the mirror theory and provided a proof for this. However, the proof, even for a special class of equations, is complex and contains several non-trivial gaps. As an application of mirror theory, XORP[w] (known as XOR construction) returning (w−1) block output, is a pseudorandom function (PRF) for some parameter w, called width. The XOR construction can be seen as a basic structure of some encryption algorithms, e.g., the CENC encryption and the CHM authenticated encryption, proposed by Iwata in 2006. Due to potential application of XORP[w] and the nontrivial gaps in the proof of mirror theory, an alternative simpler analysis of PRF-security of XORP[w] would be much desired. Recently (in Crypto 2017) Dai et al. introduced a tool, called the χ2 method, for analyzing PRF-security. Using this tool, the authors have provided a proof of PRF-security of XORP[2] without relying on the mirror theory. In this paper, we resolve the general case; we apply the χ2 method to obtain a simpler security proof of XORP[w] for any w ≥ 2. For w = 2, we obtain a tighter bound for a wider range of parameters than that of Dai et al.. Moreover, we consider variable width construction XORP[∗] (in which the widths are chosen by adversaries adaptively), and also provide variable output length pseudorandom function (VOLPRF) security analysis for it. As an application of VOLPRF, we propose an authenticated encryption which is a simple variant of CHM or AES-GCM and provides much higher security than those at the cost of one extra blockcipher call for every message.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'AES-GCM'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles