Maintaining Secure Level on Symmetric Encryption under Quantum Attack
نویسندگان
چکیده
Quantum computing is currently being researched in many countries, and if implemented the near future, it may pose a threat to existing encryption standards. In quantum computer environment, asymmetric can be solved by Shor’s Algorithm polynomial time, difficulty of breaking symmetric using brute force reduced from N times square root Grover’s Algorithm. We take Advanced Encryption Standard as theme increase key length original standard 192 bits 256 384 512 bits, respectively, order maintain security level AES 192/256 under environment computing, so we propose schedule 384/512, write software C++ on FPGA. The experimental results show that our scheme achieve Level III V levels attack environment. addition increasing key, use LUT method process writing SubBytes replace array speed up computation optimize execution speed. addition, proposed still based 128-bit blocks, rather than blocks larger blocks.
منابع مشابه
Encryption Schemes Secure under Selective Opening Attack
We provide the first public key encryption schemes proven secure against selective opening attack (SOA). This means that if an adversary obtains a number of ciphertexts and then corrupts some fraction of the senders, obtaining not only the corresponding messages but also the coins under which they were encrypted then the security of the other messages is guaranteed. Whether or not schemes with ...
متن کاملUC-Secure Searchable Symmetric Encryption
For searchable symmetric encryption schemes (or symmetrickey encryption with keyword search), the security against passive adversaries (i.e. privacy) has been mainly considered so far. In this paper, we first define its security against active adversaries (i.e. reliability as well as privacy). We next formulate its UC-security. We then prove that the UCsecurity against non-adaptive adversaries ...
متن کاملLecture 10 : Secure Symmetric Encryption
All the constructions we have shown so far are quite sequential. In order to derive pseudorandom generators of output length m we composed one-way permutations m times; to build PRFFs on length n strings from pseudorandom generators we composed generators n times. The total amount of work is an issue but more important is the delay before values are produced. (Recall that DES was particularly f...
متن کاملOn Statistically-Secure Quantum Homomorphic Encryption
Homomorphic encryption is an encryption scheme that allows computations to be evaluated on encrypted inputs without knowledge of their raw messages. Recently Ouyang et al. constructed a quantum homomorphic encryption (QHE) scheme for Clifford circuits with statistical security (or information-theoretic security (IT-security)). It is desired to see whether an informationtheoretically-secure (ITS...
متن کاملGroup-oriented Encryption Secure against Collude Attack
A group oriented encryption scheme is presented in this paper. In this scheme, a sender is allowed to encrypt a message using the group public key and send the ciphertext to the group. Any user in the group can independently decrypt the ciphertext via his private key. The scheme is secure against adaptively chosen ciphertext attack and collude attack.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied sciences
سال: 2023
ISSN: ['2076-3417']
DOI: https://doi.org/10.3390/app13116734