Search

Your search keyword '"Hasan, M. Anwar"' showing total 270 results
Start Over Author "Hasan, M. Anwar"

Refine your results

more »

more »

more »

more »
270 results on '"Hasan, M. Anwar"'

1. On efficient normal bases over binary fields

Author

Sall, Mohamadou and Hasan, M. Anwar

Subjects
Computer Science - Information Theory, Computer Science - Cryptography and Security
Abstract

Binary field extensions are fundamental to many applications, such as multivariate public key cryptography, code-based cryptography, and error-correcting codes. Their implementation requires a foundation in number theory and algebraic geometry and necessitates the utilization of efficient bases. The continuous increase in the power of computation, and the design of new (quantum) computers increase the threat to the security of systems and impose increasingly demanding encryption standards with huge polynomial or extension degrees. For cryptographic purposes or other common implementations of finite fields arithmetic, it is essential to explore a wide range of implementations with diverse bases. Unlike some bases, polynomial and Gaussian normal bases are well-documented and widely employed. In this paper, we explore other forms of bases of $\mathbb{F}_{2^n}$ over $\mathbb{F}_2$ to demonstrate efficient implementation of operations within different ranges. To achieve this, we leverage results on fast computations and elliptic periods introduced by Couveignes and Lercier, and subsequently expanded upon by Ezome and Sall. This leads to the establishment of new tables for efficient computation over binary fields.

Published
2024

2. A code-based hybrid signcryption scheme

Author

Klamti, Jean Belo and Hasan, M. Anwar

Subjects
Computer Science - Cryptography and Security, Computer Science - Information Theory, Mathematics - Number Theory, 11T71
Abstract

A key encapsulation mechanism (KEM) that takes as input an arbitrary string, i.e., a tag, is known as tag-KEM, while a scheme that combines signature and encryption is called signcryption. In this paper, we present a code-based signcryption tag-KEM scheme. We utilize a code-based signature and an IND-CCA2 (adaptive chosen ciphertext attack) secure version of McEliece's encryption scheme. The proposed scheme uses an equivalent subcode as a public code for the receiver, making the NPcompleteness of the subcode equivalence problem to be one of our main security assumptions. We then base the signcryption tag-KEM to design a code-based hybrid signcryption scheme. A hybrid scheme deploys asymmetric- as well as symmetric-key encryption. We give security analyses of both our schemes in the standard model and prove that they are secure against IND-CCA2 (indistinguishability under adaptive chosen ciphertext attack) and SUF-CMA (strong existential unforgeability under chosen message attack)., Comment: We made some improvment in the paper

Published
2021

3. A New Class of Trapdoor Verifiable Delay Functions

Author

Zawia, Ahmed, Hasan, M. Anwar, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Jourdan, Guy-Vincent, editor, Mounier, Laurent, editor, Adams, Carlisle, editor, Sèdes, Florence, editor, and Garcia-Alfaro, Joaquin, editor

Published
2023
Full Text
View/download PDF

4. Speeding-Up Parallel Computation of Large Smooth-Degree Isogeny Using Precedence-Constrained Scheduling

Author

Phalakarn, Kittiphon, Suppakitpaisarn, Vorapong, Hasan, M. Anwar, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Nguyen, Khoa, editor, Yang, Guomin, editor, Guo, Fuchun, editor, and Susilo, Willy, editor

Published
2022
Full Text
View/download PDF

7. A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes

Author

Bajard, Jean-Claude, Eynard, Julien, Hasan, M. Anwar, Zucca, Vincent, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Avanzi, Roberto, editor, and Heys, Howard, editor

Published
2017
Full Text
View/download PDF

12. Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over

Author

Adikari, Jithra, Hasan, M. Anwar, Negre, Christophe, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Knudsen, Lars R., editor, and Wu, Huapeng, editor

Published
2013
Full Text
View/download PDF

14. Improved Three-Way Split Formulas for Binary Polynomial Multiplication

Author

Cenk, Murat, Negre, Christophe, Hasan, M. Anwar, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Miri, Ali, editor, and Vaudenay, Serge, editor

Published
2012
Full Text
View/download PDF

15. High Performance GHASH Function for Long Messages

Author

Méloni, Nicolas, Négre, Christophe, Hasan, M. Anwar, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Zhou, Jianying, editor, and Yung, Moti, editor

Published
2010
Full Text
View/download PDF

16. Elliptic Curve Scalar Multiplication Combining Yao’s Algorithm and Double Bases

Author

Méloni, Nicolas, Hasan, M. Anwar, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Clavier, Christophe, editor, and Gaj, Kris, editor

Published
2009
Full Text
View/download PDF

17. Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation

Author

Hasan, M. Anwar, Negre, Christophe, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, von zur Gathen, Joachim, editor, Imaña, José Luis, editor, and Koç, Çetin Kaya, editor

Published
2008
Full Text
View/download PDF

20. On Randomizing Private Keys to Counteract DPA Attacks

Author

Ebeid, Nevine, Hasan, M. Anwar, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Matsui, Mitsuru, editor, and Zuccherato, Robert J., editor

Published
2004
Full Text
View/download PDF

37. A digital rights management system based on a scalable blockchain

Author

Garba, Abba, Dwivedi, Ashutosh Dhar, Kamal, Mohsin, Srivastava, Gautam, Tariq, Muhammad, Hasan, M. Anwar, Chen, Zhong, Garba, Abba, Dwivedi, Ashutosh Dhar, Kamal, Mohsin, Srivastava, Gautam, Tariq, Muhammad, Hasan, M. Anwar, and Chen, Zhong

Abstract

Even though the Internet promotes data sharing and transparency, however it does not protect digital content. In today’s digital world, it has become a difficult task to release a DRM (Digital Rights Management) system that can be considered well-protected. Digital content that becomes easily available in open-source environments will in time be worthless to the creator. There may only be a one-time payment to creators upon initial upload to a given platform after which time the rights of the intellectual property are shifted to the platform itself. However, due to the online availability of content, anyone can download content and make copies. The value of digital content slowly decreases, because the value of content can usually be determined through the difficulty of it’s accessibility. There is no way to track the leakage or copyright for the spread of digital material. In this paper, a distributed media transaction framework for DRM is proposed, which is based on the digital watermarking and a scalable blockchain model. In this paper, our focus is on improving the classic blockchain systems to make it suitable for a DRM model. The DRM model in this paper allows only authorized users to use online content and provide original multimedia content. While the digital watermarking is used to reclaim the copyright ownership of offline contents in the event when the contents are leaked.

Published
2020

39. Fast bit parallel-shifted polynomial basis multipliers in GF([2.sup.n])

Author

Fan, Haining and Hasan, M. Anwar

Subjects
Multipliers (Electronics) -- Design and construction, Polynomials -- Usage, Business, Computers and office automation industries, Electronics, Electronics and electrical industries
Abstract

A new nonpipelined bit-parallel-shifted polynomial basis multiplier for GF([2.sup.n]) is presented. For some irreducible trinomials, the space complexity of the multiplier matches the best results avaliable in the literature, and its gate delay is equal to [T.sub.A] + [[log.sub.2] n] [T.sub.X], where [T.sub.A] and [T.sub.x] are the delay of one two-input AND and XOR gates, respectively. To the best of our knowledge, this is the first time that the gate delay bound [T.sub.A] + [[log.sub.2] n] [T.sub.X] is reached. For some irreducible pentanomials, its gate delay is equal to [T.sub.A] + (1 + [[log.sub.2] n])[T.sub.X]. NIST has recommended five binary fields for the elliptic curve digital signature algorithm applications: GF([2.sup.163]), GF([2.sup.233]), GF([2.sup.283]), GF([2.sup.409]), and GF([2.sup.571]), but no irreducible trinomials exist for three degrees, viz., 163, 283 and 571. For the three corresponding binary fields, we show that the gate delay of the proposed multiplier is [T.sub.A] + (1 + [[log.sub.2] n] )[T.sub.X]. This result outperforms the previously known results. Index Terms--Finite field, irreducible polynomial, multiplication, polynomial basis, shifted polynomial basis.

Published
2006

Catalog

Books, media, physical & digital resources
See catalog results