Literatura académica sobre el tema "Extension field cryptosystem"

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Extension field cryptosystem".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Artículos de revistas sobre el tema "Extension field cryptosystem"

1

Chakraborty, Olive, Jean-Charles Faugère, and Ludovic Perret. "Cryptanalysis of the extension field cancellation cryptosystem." Designs, Codes and Cryptography 89, no. 6 (2021): 1335–64. http://dx.doi.org/10.1007/s10623-021-00873-9.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Rehman, Hafeez Ur, Mohammad Mazyad Hazzazi, Tariq Shah, Amer Aljaedi, and Zaid Bassfar. "Color image encryption by piecewise function and elliptic curve over the Galois field $ {G}{F}\left({2}^{{n}}\right) $." AIMS Mathematics 9, no. 3 (2024): 5722–45. http://dx.doi.org/10.3934/math.2024278.

Texto completo
Resumen
<abstract> <p>Elliptic curve (EC) cryptography supplies an efficient, secure, and lightweight method for executing computer cryptographic protocols. Its widespread use in various applications, including secure communications, digital signatures, and key agreement protocols, highlights its importance in modern computing. Moreover, EC-based image encryption is gaining popularity in cryptography as it offers strong protection with a relatively smaller key size than other famous cryptosystems. Inspired by this, we proposed a novel image encryption scheme that leverages ECs over a binar
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

El-Kassar, A. N., and Ramzi Haraty. "ElGamal Public-Key cryptosystem in multiplicative groups of quotient rings of polynomials over finite fields." Computer Science and Information Systems 2, no. 1 (2005): 63–77. http://dx.doi.org/10.2298/csis0501063e.

Texto completo
Resumen
The ElGamal encryption scheme is described in the setting of any finite cyclic group G. Among the groups of most interest in cryptography are the multiplicative group Zp of the ring of integers modulo a prime p, and the multiplicative groups F2m of finite fields of characteristic two. The later requires finding irreducible polynomials H(x) and constructing the quotient ring Z2[x]/ < h(x)>. El-Kassar et al. modified the ElGamal scheme to the domain of Gaussian integers. El-Kassar and Haraty gave an extension in the multiplicative group of Zp[x]/ < x2 >. Their major finding is that t
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

George, Kiernan, and Alan J. Michaels. "Designing a Block Cipher in Galois Extension Fields for IoT Security." IoT 2, no. 4 (2021): 669–87. http://dx.doi.org/10.3390/iot2040034.

Texto completo
Resumen
This paper focuses on a block cipher adaptation of the Galois Extension Fields (GEF) combination technique for PRNGs and targets application in the Internet of Things (IoT) space, an area where the combination technique was concluded as a quality stream cipher. Electronic Codebook (ECB) and Cipher Feedback (CFB) variations of the cryptographic algorithm are discussed. Both modes offer computationally efficient, scalable cryptographic algorithms for use over a simple combination technique like XOR. The cryptographic algorithm relies on the use of quality PRNGs, but adds an additional layer of s
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Saju, M. I., Renjith Varghese, and 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, no. 2 (2020): 459–63. http://dx.doi.org/10.26637/mjm0802/0022.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Ur Rehman, Hafeez, Mohammad Mazyad Hazzazi, Tariq Shah, Zaid Bassfar, and Dawood Shah. "An Efficient Audio Encryption Scheme Based on Elliptic Curve over Finite Fields." Mathematics 11, no. 18 (2023): 3824. http://dx.doi.org/10.3390/math11183824.

Texto completo
Resumen
Elliptic curve (EC) based cryptographic systems are more trustworthy than the currently used cryptographic approaches since they require less computational work while providing good security. This paper shows how to use an EC to make a good cryptosystem for encrypting digital audio. As a preliminary step, the system uses an EC of a particular type over a binary extension field to distort the digital audio pixel position. It reduces the inter-correlation between pixels in the original audio, making the system resistant to statistical attacks. In creating confusion in the data, an EC over a bina
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Hammami, Sonia. "Multi-switching combination synchronization of discrete-time hyperchaotic systems for encrypted audio communication." IMA Journal of Mathematical Control and Information 36, no. 2 (2018): 583–602. http://dx.doi.org/10.1093/imamci/dnx058.

Texto completo
Resumen
Abstract In this paper, encrypted audio communication based on original synchronization form is proposed for a class of discrete-time hyperchaotic systems. The new studied scheme of synchronization presents an extension of the multi-switching one to the combination synchronization, for which, the state variables of two driving systems synchronize with different state variables of the response system, simultaneously. With that in mind, at the outset, a theoretical approach for non-linear control, using aggregation techniques associated to one specific characteristic matrix description, namely,
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Li, Jiakun, and Wei Gao. "Hardware Optimization and System Design of Elliptic Curve Encryption Algorithm Based on FPGA." Journal of Sensors 2022 (October 11, 2022): 1–12. http://dx.doi.org/10.1155/2022/9074524.

Texto completo
Resumen
Since entering the era of big data, the degree of information sharing is getting higher and higher; the information exchange is becoming more and more convenient, but at the same time, personal information is also easy to be exposed to the network environment, if it is used by criminals to lead to information leakage, and then bring certain risks. Therefore, it is in the information age and do a good job of network information security and confidentiality. At present, the security and secrecy of network information are mainly realized by cryptography. Public key cryptography can encrypt inform
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Guang Gong and Lein Harn. "Public-key cryptosystems based on cubic finite field extensions." IEEE Transactions on Information Theory 45, no. 7 (1999): 2601–5. http://dx.doi.org/10.1109/18.796413.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Bessalov, Anatoliy V. "CALCULATION OF PARAMETERS OF CRYPTIC CRIVIAE EDWARDS OVER THE FIELDS OF CHARACTERISTICS 5 AND 7." Cybersecurity: Education, Science, Technique, no. 1 (2018): 94–104. http://dx.doi.org/10.28925/2663-4023.2018.1.94104.

Texto completo
Resumen
The method of search of cryptographic strong elliptic curves in the Edwards form (where parameter d is non square in the field) over the extended finite fields of small characteristics p ≠ 2.3 is proposed. For these curves is performed the completeness of the points addition law, so they are called as complete Edwards curve. In the first stage over a small prime fields and we find the parameters d of complete Edwards curves who have minimum orders . For both curves we obtain the same values d = 3, which are non square in the fields and . Next with help recurrent formulae for both curves we cal
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes
Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!