Gotowa bibliografia na temat „INVERSION-ENCRYPTION METHOD”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „INVERSION-ENCRYPTION METHOD”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "INVERSION-ENCRYPTION METHOD"
Khan, Sajid, Lansheng Han, Ghulam Mudassir, Bachira Guehguih i Hidayat Ullah. "3C3R, an Image Encryption Algorithm Based on BBI, 2D-CA, and SM-DNA". Entropy 21, nr 11 (2.11.2019): 1075. http://dx.doi.org/10.3390/e21111075.
Pełny tekst źródłaCheng, Peng, i Huai Xun Zhao. "A Novel Image Encryption Algorithm Based on Cellular Automata and Chaotic System". Advanced Materials Research 998-999 (lipiec 2014): 797–801. http://dx.doi.org/10.4028/www.scientific.net/amr.998-999.797.
Pełny tekst źródłaLokesh Reddy, B., i Anith Nelleri. "Single-Pixel Compressive Digital Holographic Encryption System Based on Circular Harmonic Key and Parallel Phase Shifting Digital Holography". International Journal of Optics 2022 (14.07.2022): 1–20. http://dx.doi.org/10.1155/2022/6298010.
Pełny tekst źródłaNaseer, Yasir, Tariq Shah, Dawood Shah i Sadam Hussain. "A Novel Algorithm of Constructing Highly Nonlinear S-p-boxes". Cryptography 3, nr 1 (16.01.2019): 6. http://dx.doi.org/10.3390/cryptography3010006.
Pełny tekst źródłaLi, Jiakun, i Wei Gao. "Hardware Optimization and System Design of Elliptic Curve Encryption Algorithm Based on FPGA". Journal of Sensors 2022 (11.10.2022): 1–12. http://dx.doi.org/10.1155/2022/9074524.
Pełny tekst źródłaZhang, Xing, Xiaoyu Jiang, Zhaolin Jiang i Heejung Byun. "Algorithms for solving a class of real quasi-symmetric Toeplitz linear systems and its applications". Electronic Research Archive 31, nr 4 (2023): 1966–81. http://dx.doi.org/10.3934/era.2023101.
Pełny tekst źródłaRatan, Ram, i Arvind Yadav. "Key Independent Image Deciphering using Neighbourhood Similarity Characteristics and Divide-And-Conquer Attack". Recent Patents on Engineering 14 (19.07.2020). http://dx.doi.org/10.2174/1872212114999200719144548.
Pełny tekst źródłaLi, Zhenqiang, Fei Gao, Sujuan Qin i Qiaoyan Wen. "New record in the number of qubits for a quantum implementation of AES". Frontiers in Physics 11 (24.03.2023). http://dx.doi.org/10.3389/fphy.2023.1171753.
Pełny tekst źródłaAlaverdyan, Y. Ts, i E. G. Satimova. "Fully Homomorphic Cipher Based on Finite Algebraic Structures". Earthline Journal of Mathematical Sciences, 18.01.2019, 97–103. http://dx.doi.org/10.34198/ejms.1119.97103.
Pełny tekst źródłaRozprawy doktorskie na temat "INVERSION-ENCRYPTION METHOD"
RANI, VIJETA. "PSEUDORANDOM BINARY SEQUENCE GENERATION FOR STREAM CIPHERS". Thesis, 2012. http://dspace.dtu.ac.in:8080/jspui/handle/repository/13961.
Pełny tekst źródłaPseudorandom binary sequences find their application in diverse fields but security and cryptography is probably the best known field of their application. One-Time Pad (OTP) is a simple, fast and the most secure encryption algorithm. It provides the perfect secrecy. The encryptiondecryption process of the OTP is based on exclusive-or function computed on the plaintext/ciphertext and the key bits. The requirements for the OTP key are that: it must be a cryptographically strong truly random or pseudorandom binary sequence; must be as long as plaintext size; and must not be reused. The difference between a truly random and a pseudorandom sequence is that the truly random sequence is generated with the help of nondeterministic physical phenomenon but the pseudorandom sequence is generated from some deterministic mechanism and a seed value. In case of pseudorandom binary sequences, given the same seed the pseudorandom number generator will always output the same sequence of numbers or bits. The fundamental difficulty with a truly random sequence is its generation and distribution. Therefore pseudorandom sequences are a popular choice for the practical implementation of the OTP scheme. Many researchers have devoted their time and effort to the family of shift register based pseudorandom sequence generators. But they could not gain a key sequence having very large period equal to the plaintext length. They also tried the complex versions of shift registers but it is yet not very useful and secure