Joan-Josep Climent | University of Alicante / Universidad de Alicante (original) (raw)
Uploads
Papers by Joan-Josep Climent
Linear Algebra and its Applications, Sep 1, 2008
Linear Algebra and its Applications, Sep 1, 2007
Esta red de investigacion en docencia es una continuacion natural de una labor que comenzo ya en ... more Esta red de investigacion en docencia es una continuacion natural de una labor que comenzo ya en el curso academico 2015-2016 por parte de los profesores responsables de las asignaturas de Algebra Lineal y Geometria Lineal del Grado en Matematicas de la Facultad de Ciencias de la Universidad de Alicante y cuyo objetivo principal era analizar el desarrollo de las asignaturas Algebra Lineal I, Algebra Lineal II y Geometria Lineal. Durante este curso academico 2017-2018 el Grado en Fisica de la Universidad de Alicante tambien ha alcanzado su segundo ano de imparticion. Aunque este grado sigue siendo muy joven y no ha completado un ciclo completo, hasta el segundo curso comparte una cantidad importante de asignaturas y contenidos con el Grado en Matematicas. Mas concretamente, estos dos grados comparten las asignaturas de Algebra Lineal I, Algebra Lineal II y Geometria Lineal, que son de las que nos ocupamos en esta red. Durante este curso hemos continuado con el minucioso analisis inic...
International Journal of Control, 2018
Starting with a basis of F2k2, we define some sets in F2k2 that are the supports of bent function... more Starting with a basis of F2k2, we define some sets in F2k2 that are the supports of bent functions of 2k variables. We also establish some results in order to count the number of bent functions we can construct, and we provide a complete classification of all bases of F2k2 (for k = 2) providing the same supports of bent functions.
Applicable Algebra in Engineering Communication and Computing, 2011
For a prime number p, Bergman (Israel J Math 18:257–277, 1974) established that [FORMULA] is a se... more For a prime number p, Bergman (Israel J Math 18:257–277, 1974) established that [FORMULA] is a semilocal ring with p 5 elements that cannot be embedded in matrices over any commutative ring. We identify the elements of [FORMULA] with elements in a new set, denoted by E p , of matrices of size 2 × 2, whose elements in the first row belong to [FORMULA] and the elements in the second row belong to [FORMULA]; also, using the arithmetic in [FORMULA] and [FORMULA], we introduce the arithmetic in that ring and prove that the ring [FORMULA] is isomorphic to the ring E p . Finally, we present a Diffie-Hellman key interchange protocol using some polynomial functions over E p defined by polynomials in [FORMULA].
Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas, 2019
Journal of Computational and Applied Mathematics, 1997
In this paper we present a public key cryptosystem based on the McEliece scheme, but using a conv... more In this paper we present a public key cryptosystem based on the McEliece scheme, but using a convolutional code, instead of a block code. Firstly we present some conditions about the convolutional code C to construct the public key cryptosystem and then, starting with the parity check matrix H of a good block code, we find an input-state-output representation of C such that the controllability matrix of C is H t. This cryptosystem is constructed so that any user can encrypt a message by introducing the largest number of possible errors.
Abstract: The objective of this paper is to develop a method to hide information inside a binary ... more Abstract: The objective of this paper is to develop a method to hide information inside a binary image. An algorithm to embed data in scanned text or figures is proposed, based on the detection of suitable pixels, which verify some conditions in order to be not detected. In broad terms, the algorithm locates those pixels placed at the contours of the figures or in those areas where some scattering of the two colors can be found. The hidden information is independent from the values of the pixels where this information is embedded. Notice that, depending on the sequence of bits to be hidden, around half of the used pixels to keep bits of data will not be modified. The other basic characteristic of the proposed scheme is that it is necessary to take into consideration the bits that are modified, in order to perform the recovering process of the information, which consists on recovering the sequence of bits placed in the proper positions. An application to banking sector is proposed fo...
Applicable Algebra in Engineering, Communication and Computing, 2014
Lecture Notes in Computer Science, 2003
International Journal of Computer Mathematics, 2012
Applied Mathematics and Computation, 2004
Applied Mathematics and Computation, 2005
Linear Algebra and its Applications, Sep 1, 2008
Linear Algebra and its Applications, Sep 1, 2007
Esta red de investigacion en docencia es una continuacion natural de una labor que comenzo ya en ... more Esta red de investigacion en docencia es una continuacion natural de una labor que comenzo ya en el curso academico 2015-2016 por parte de los profesores responsables de las asignaturas de Algebra Lineal y Geometria Lineal del Grado en Matematicas de la Facultad de Ciencias de la Universidad de Alicante y cuyo objetivo principal era analizar el desarrollo de las asignaturas Algebra Lineal I, Algebra Lineal II y Geometria Lineal. Durante este curso academico 2017-2018 el Grado en Fisica de la Universidad de Alicante tambien ha alcanzado su segundo ano de imparticion. Aunque este grado sigue siendo muy joven y no ha completado un ciclo completo, hasta el segundo curso comparte una cantidad importante de asignaturas y contenidos con el Grado en Matematicas. Mas concretamente, estos dos grados comparten las asignaturas de Algebra Lineal I, Algebra Lineal II y Geometria Lineal, que son de las que nos ocupamos en esta red. Durante este curso hemos continuado con el minucioso analisis inic...
International Journal of Control, 2018
Starting with a basis of F2k2, we define some sets in F2k2 that are the supports of bent function... more Starting with a basis of F2k2, we define some sets in F2k2 that are the supports of bent functions of 2k variables. We also establish some results in order to count the number of bent functions we can construct, and we provide a complete classification of all bases of F2k2 (for k = 2) providing the same supports of bent functions.
Applicable Algebra in Engineering Communication and Computing, 2011
For a prime number p, Bergman (Israel J Math 18:257–277, 1974) established that [FORMULA] is a se... more For a prime number p, Bergman (Israel J Math 18:257–277, 1974) established that [FORMULA] is a semilocal ring with p 5 elements that cannot be embedded in matrices over any commutative ring. We identify the elements of [FORMULA] with elements in a new set, denoted by E p , of matrices of size 2 × 2, whose elements in the first row belong to [FORMULA] and the elements in the second row belong to [FORMULA]; also, using the arithmetic in [FORMULA] and [FORMULA], we introduce the arithmetic in that ring and prove that the ring [FORMULA] is isomorphic to the ring E p . Finally, we present a Diffie-Hellman key interchange protocol using some polynomial functions over E p defined by polynomials in [FORMULA].
Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas, 2019
Journal of Computational and Applied Mathematics, 1997
In this paper we present a public key cryptosystem based on the McEliece scheme, but using a conv... more In this paper we present a public key cryptosystem based on the McEliece scheme, but using a convolutional code, instead of a block code. Firstly we present some conditions about the convolutional code C to construct the public key cryptosystem and then, starting with the parity check matrix H of a good block code, we find an input-state-output representation of C such that the controllability matrix of C is H t. This cryptosystem is constructed so that any user can encrypt a message by introducing the largest number of possible errors.
Abstract: The objective of this paper is to develop a method to hide information inside a binary ... more Abstract: The objective of this paper is to develop a method to hide information inside a binary image. An algorithm to embed data in scanned text or figures is proposed, based on the detection of suitable pixels, which verify some conditions in order to be not detected. In broad terms, the algorithm locates those pixels placed at the contours of the figures or in those areas where some scattering of the two colors can be found. The hidden information is independent from the values of the pixels where this information is embedded. Notice that, depending on the sequence of bits to be hidden, around half of the used pixels to keep bits of data will not be modified. The other basic characteristic of the proposed scheme is that it is necessary to take into consideration the bits that are modified, in order to perform the recovering process of the information, which consists on recovering the sequence of bits placed in the proper positions. An application to banking sector is proposed fo...
Applicable Algebra in Engineering, Communication and Computing, 2014
Lecture Notes in Computer Science, 2003
International Journal of Computer Mathematics, 2012
Applied Mathematics and Computation, 2004
Applied Mathematics and Computation, 2005