Zobrazeno 1 - 5
of 5
pro vyhledávání: '"J. K. M. Sadique Uz Zaman"'
Publikováno v:
2023 4th International Conference on Computing and Communication Systems (I3CS).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97d1fe1d9c1925928f2fb54629a76d2f
https://doi.org/10.1109/i3cs58314.2023.10127232
https://doi.org/10.1109/i3cs58314.2023.10127232
Publikováno v:
International Journal of Advanced Research in Computer Science. :760-766
Multiplicative inverses under an irreducible polynomial over Galois Field GF(p^m) play important role in cryptography. The substitution box of Advanced Encryption Standard is designed in 1999 with multiplicative inverses under the first irreducible p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f17d1ba574cde5f48514b2ee7546522f
https://doi.org/10.26483/ijarcs.v8i7.4397
https://doi.org/10.26483/ijarcs.v8i7.4397
Publikováno v:
Journal of The Institution of Engineers (India): Series B. 97:193-208
In Advanced Encryption Standard (AES), the standard S-Box is conventionally generated by using a particular irreducible polynomial {11B} in GF(28) as the modulus and a particular additive constant polynomial {63} in GF(2), though it can be generated
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54355ef3a9799ecce2c89e6adf1d3eb1
https://doi.org/10.1007/s40031-014-0173-1
https://doi.org/10.1007/s40031-014-0173-1
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9788132226482
ACSS (1)
ACSS (1)
A new stream ciphering technique based on multiplicative polynomial inverses over Galois Field GF(73) is proposed, where a set of randomly generated key-bytes, between 1 and 15, is dynamically permuted and XORed with the identical number of message b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89d6a628af2d063e9c9ee64954b18aa1
https://doi.org/10.1007/978-81-322-2650-5_3
https://doi.org/10.1007/978-81-322-2650-5_3
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9788132219873
ACSS (2)
ACSS (2)
The multiplicative polynomial inverses of all elemental polynomials exist under each of all irreducible polynomials over the finite field GF(p m ) where p is a prime integer and both p and m ≥ 2. For GF(28), the Extended Euclidean Algorithm (EEA) s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8bbfa6d9661915c75aa56a1ea1e42744
https://doi.org/10.1007/978-81-322-1988-0_6
https://doi.org/10.1007/978-81-322-1988-0_6