Zobrazeno 1 - 10 of 229 pro vyhledávání: '"Palash Sarkar"'
1
Akademický článek
A Direct Construction of Inter-Group Complementary Code Set
Autor: Palash Sarkar, Sudhan Majhi, Hamsakutty Vettikalladi, Abu Syed Mahajumi
Publikováno v: IEEE Access, Vol 6, Pp 42047-42056 (2018)
Complete complementary codes (CCCs) is a collection of mutually orthogonal complementary codes and Inter-group complementary (IGC) code set consists of multiple disjoint groups of 2-D codes. IGC code set has large set size than CCC and both can be ap
Externí odkaz: https://doaj.org/article/88f17821ca3d4171aedd291d60842152
Zobrazit plný text záznamu
2
Akademický článek
A Fast Single-Key Two-Level Universal Hash Function
Autor: Debrup Chakraborty, Sebati Ghosh, Palash Sarkar
Publikováno v: IACR Transactions on Symmetric Cryptology, Pp 106-128 (2017)
Universal hash functions based on univariate polynomials are well known, e.g. Poly1305 and GHASH. Using Horner’s rule to evaluate such hash functionsrequire l − 1 field multiplications for hashing a message consisting of l blocks where each block
Externí odkaz: https://doaj.org/article/2d244daa290145068462d149ac59d60d
Zobrazit plný text záznamu
3
Akademický článek
Data-Reconciliation Based Fault-Tolerant Model Predictive Control for a Biomass Boiler
Autor: Palash Sarkar, Jukka Kortela, Alexandre Boriouchkine, Elena Zattoni, Sirkka-Liisa Jämsä-Jounela
Publikováno v: Energies, Vol 10, Iss 2, p 194 (2017)
This paper presents a novel, effective method to handle critical sensor faults affecting a control system devised to operate a biomass boiler. In particular, the proposed method consists of integrating a data reconciliation algorithm in a model predi
Externí odkaz: https://doaj.org/article/949ac530c8db4bb1a5091c9d28b91c1f
Zobrazit plný text záznamu
4
Classical reduction of gap SVP to LWE: A concrete security analysis
Autor: Palash Sarkar, Subhadip Singha
Publikováno v: Advances in Mathematics of Communications. 17:484-499
Regev (2005) introduced the learning with errors (LWE) problem and showed a quantum reduction from a worst case lattice problem to LWE. Building on the work of Peikert (2009), a classical reduction from the gap shortest vector problem to LWE was obta
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e166463a03c09d59da466c4c17ad7813
https://doi.org/10.3934/amc.2021004
Zobrazit plný text záznamu
6
Kummer versus Montgomery Face-off over Prime Order Fields
Autor: Kaushik Nath, Palash Sarkar
Publikováno v: ACM Transactions on Mathematical Software. 48:1-28
This paper makes a comprehensive comparison of the efficiencies of vectorized implementations of Kummer lines and Montgomery curves at various security levels. For the comparison, nine Kummer lines are considered, out of which eight are new, and new
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::aab445e4043ab2f22800b26687b67d8f
https://doi.org/10.1145/3503536
Zobrazit plný text záznamu
8
Efficient 4-Way Vectorizations of the Montgomery Ladder
Autor: Palash Sarkar, Kaushik Nath
Publikováno v: IEEE Transactions on Computers. 71:712-723
We propose two new algorithms for 4-way vectorization of the well known Montgomery ladder over elliptic curves of Montgomery form. The first algorithm is suitable for variable base scalar multiplication. In comparison to the previous work by Hisil et
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::d56e1e5dc20dc68166823adffc54408e
https://doi.org/10.1109/tc.2021.3060505
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje