Gotowa bibliografia na temat „Extension field cryptosystem”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Extension field cryptosystem”.
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 "Extension field cryptosystem"
Chakraborty, Olive, Jean-Charles Faugère i Ludovic Perret. "Cryptanalysis of the extension field cancellation cryptosystem". Designs, Codes and Cryptography 89, nr 6 (18.04.2021): 1335–64. http://dx.doi.org/10.1007/s10623-021-00873-9.
Pełny tekst źródłaRehman, Hafeez Ur, Mohammad Mazyad Hazzazi, Tariq Shah, Amer Aljaedi i Zaid Bassfar. "Color image encryption by piecewise function and elliptic curve over the Galois field $ {G}{F}\left({2}^{{n}}\right) $". AIMS Mathematics 9, nr 3 (2024): 5722–45. http://dx.doi.org/10.3934/math.2024278.
Pełny tekst źródłaEl-Kassar, A. N., i Ramzi Haraty. "ElGamal Public-Key cryptosystem in multiplicative groups of quotient rings of polynomials over finite fields". Computer Science and Information Systems 2, nr 1 (2005): 63–77. http://dx.doi.org/10.2298/csis0501063e.
Pełny tekst źródłaGeorge, Kiernan, i Alan J. Michaels. "Designing a Block Cipher in Galois Extension Fields for IoT Security". IoT 2, nr 4 (5.11.2021): 669–87. http://dx.doi.org/10.3390/iot2040034.
Pełny tekst źródłaSaju, M. I., Renjith Varghese i E. F. Antony John. "A design of public key Cryptosystem in an algebraic extension field over a finite field using the difficulty of solving DLP". Malaya Journal of Matematik 8, nr 2 (kwiecień 2020): 459–63. http://dx.doi.org/10.26637/mjm0802/0022.
Pełny tekst źródłaUr Rehman, Hafeez, Mohammad Mazyad Hazzazi, Tariq Shah, Zaid Bassfar i Dawood Shah. "An Efficient Audio Encryption Scheme Based on Elliptic Curve over Finite Fields". Mathematics 11, nr 18 (6.09.2023): 3824. http://dx.doi.org/10.3390/math11183824.
Pełny tekst źródłaHammami, Sonia. "Multi-switching combination synchronization of discrete-time hyperchaotic systems for encrypted audio communication". IMA Journal of Mathematical Control and Information 36, nr 2 (29.01.2018): 583–602. http://dx.doi.org/10.1093/imamci/dnx058.
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łaGuang Gong i Lein Harn. "Public-key cryptosystems based on cubic finite field extensions". IEEE Transactions on Information Theory 45, nr 7 (1999): 2601–5. http://dx.doi.org/10.1109/18.796413.
Pełny tekst źródłaBessalov, Anatoliy V. "CALCULATION OF PARAMETERS OF CRYPTIC CRIVIAE EDWARDS OVER THE FIELDS OF CHARACTERISTICS 5 AND 7". Cybersecurity: Education, Science, Technique, nr 1 (2018): 94–104. http://dx.doi.org/10.28925/2663-4023.2018.1.94104.
Pełny tekst źródłaRozprawy doktorskie na temat "Extension field cryptosystem"
Abu-Mahfouz, Adnan Mohammed. "Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices". Diss., University of Pretoria, 2004. http://hdl.handle.net/2263/25330.
Pełny tekst źródłaDissertation (MEng (Computer Engineering))--University of Pretoria, 2006.
Electrical, Electronic and Computer Engineering
unrestricted
Chakraborty, Olive. "Design and Cryptanalysis of Post-Quantum Cryptosystems". Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS283.
Pełny tekst źródłaPolynomial system solving is one of the oldest and most important problems incomputational mathematics and has many applications in computer science. Itis intrinsically a hard problem with complexity at least single exponential in the number of variables. In this thesis, we focus on cryptographic schemes based on the hardness of this problem. In particular, we give the first known cryptanalysis of the Extension Field Cancellation cryptosystem. We work on the scheme from two aspects, first we show that the challenge parameters don’t satisfy the 80 bits of security claimed by using Gröbner basis techniques to solve the underlying algebraic system. Secondly, using the structure of the public keys, we develop a new technique to show that even altering the parameters of the scheme still keeps the scheme vulnerable to attacks for recovering the hidden secret. We show that noisy variant of the problem of solving a system of equations is still hard to solve. Finally, using this new problem to design a new multivariate key-exchange scheme as a candidate for NIST Post Quantum Cryptographic Standards
Abu, Mahfouz Adnan Mohammed I. "Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices". Pretoria : [s.n.], 2004. http://upetd.up.ac.za/thesis/available/etd-06082005-144557.
Pełny tekst źródłaCzęści książek na temat "Extension field cryptosystem"
Zhiyong, Zheng, Liu Fengxia i Chen Man. "On the High Dimensional RSA Algorithm—A Public Key Cryptosystem Based on Lattice and Algebraic Number Theory". W Financial Mathematics and Fintech, 169–89. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-2366-3_9.
Pełny tekst źródłaStreszczenia konferencji na temat "Extension field cryptosystem"
Guimarães, Antonio, Diego Aranha i Edson Borin. "Secure and efficient software implementation of QC-MDPC code-based cryptography". W XX Simpósio em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/wscad_estendido.2019.8710.
Pełny tekst źródła