Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Fajar Yuliawan"'
Publikováno v:
Heliyon, Vol 10, Iss 15, Pp e35257- (2024)
In this paper, we define the derived category of weak chain U-complexes, and we give a characterization of any weak chain U-complex as an object in the right bounded homotopy category of weak chain U-complexes of projective modules. Then, we show tha
Externí odkaz:
https://doaj.org/article/d54334920df54279a67cc009b02da486
Publikováno v:
AIMS Mathematics, Vol 9, Iss 4, Pp 9508-9518 (2024)
This paper describes generalized Reed-Solomon (GRS) codes over number fields that are invariant under certain permutations. We call these codes generalized quasi-cyclic (GQC) GRS codes. Moreover, we describe an application of GQC GRS codes over numbe
Externí odkaz:
https://doaj.org/article/1ba4cf8d50ad49f7992fd734b0b3cf7c
Autor:
Marisa W. Paryasto, Budi Rahardjo, Fajar Yuliawan, Intan Muchtadi Alamsyah, Kuspriyanto Kuspriyanto
Publikováno v:
Journal of ICT Research and Applications, Vol 6, Iss 1, Pp 63-81 (2013)
Implementing a secure cryptosystem requires operations involving hundreds of bits. One of the most recommended algorithm is Elliptic Curve Cryptography (ECC). The complexity of elliptic curve algorithms and parameters with hundreds of bits requires s
Externí odkaz:
https://doaj.org/article/15455fa8cda74752ba038ed39cd1387a
Publikováno v:
European Journal of Pure and Applied Mathematics. 13:323-345
Motivated by a study of Davvaz and Shabbani which introduced the concept of U-complexes and proposed a generalization on some results in homological algebra, we study thecategory of U-complexes and the homotopy category of U-complexes. In [8] we said
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::542184968277f533d12e410e0ddd64fc
https://doi.org/10.29020/nybg.ejpam.v13i2.3673
https://doi.org/10.29020/nybg.ejpam.v13i2.3673
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d01fe60e8787758baf30dfab16a83993
https://doi.org/10.2139/ssrn.4166527
https://doi.org/10.2139/ssrn.4166527
Publikováno v:
AIP Conference Proceedings.
This paper gives a first glance at McEliece cryptosystem using permutation Low Density Parity Check (LDPC) code as its private and public keys.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::61cbc9036d4bd2334af79c5e26682dc9
https://doi.org/10.1063/1.5139131
https://doi.org/10.1063/1.5139131
Publikováno v:
AIP Conference Proceedings.
Elliptic Curve Cryptography (ECC) is a public key cryptosystem with a security level determined by discrete logarithm problem called Elliptic Curve Discrete Logarithm Problem (ECDLP). John M. Pollard proposed an algorithm for discrete logarithm probl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fb4ea9c4fe224c55f2d8bb483f1aeeb6
https://doi.org/10.1063/1.4930641
https://doi.org/10.1063/1.4930641
Publikováno v:
Proceedings of the International Conference on Algebra 2010.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16ef42a4a698299267c9353890214862
https://doi.org/10.1142/9789814366311_0034
https://doi.org/10.1142/9789814366311_0034