Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Pranjal Dutta"'
Publikováno v:
Scientific Reports, Vol 12, Iss 1, Pp 1-14 (2022)
Abstract In this paper, we study NIST lightweight 3rd round candidate $$\text{ TinyJAMBU }$$ TinyJAMBU . The core component of $$\text{ TinyJAMBU }$$ TinyJAMBU is the keyed permutation $$\mathcal {P}_n$$ P n , which is based on a non-linear feedback
Externí odkaz:
https://doaj.org/article/16a6746844f34998a9f6f9b67eaecf6f
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783031252105
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d0c6617257cc27fcea772794eb49b86
https://doi.org/10.1007/978-3-031-25211-2_1
https://doi.org/10.1007/978-3-031-25211-2_1
Autor:
Pranjal Dutta, Nitin Saxena
Publikováno v:
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a9a7e0e589505091e2fd851a8f5320a
https://doi.org/10.1109/focs54457.2022.00026
https://doi.org/10.1109/focs54457.2022.00026
In this paper, we study NIST lightweight 3 rd round candidate TinyJAMBU. The core component of TinyJAMBU is the keyed permutation P n , which which is based on a non-linear feedback shift register. By analysing this permutation carefully, we are able
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a51fa9d0dc2db2817c7916f4ee4ba57
https://doi.org/10.21203/rs.3.rs-1646044/v1
https://doi.org/10.21203/rs.3.rs-1646044/v1
Publikováno v:
Scientific reports. 12(1)
In this paper, we study NIST lightweight 3rd round candidate [Formula: see text]. The core component of [Formula: see text] is the keyed permutation [Formula: see text], which is based on a non-linear feedback shift register. By analysing this permut
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::e199334c716323a1c9c40e33fbe7d902
https://pubmed.ncbi.nlm.nih.gov/36175451
https://pubmed.ncbi.nlm.nih.gov/36175451
Publikováno v:
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f6d47460038914a28ae684e250f293f4
https://doi.org/10.1109/focs52979.2021.00018
https://doi.org/10.1109/focs52979.2021.00018
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030950170
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b2aff04265858c1bb3761fc6a1d7783
https://doi.org/10.1007/978-3-030-95018-7_19
https://doi.org/10.1007/978-3-030-95018-7_19
Publikováno v:
Indian Journal of Extension Education. 57:175-177
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::12a8dc29e654c8255abc3c4448f0cb55
https://doi.org/10.5958/2454-552x.2021.00152.3
https://doi.org/10.5958/2454-552x.2021.00152.3
Publikováno v:
International Journal of Current Microbiology and Applied Sciences. 8:606-612
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8a489a918fe8cbeb83129d8d86991cf
https://doi.org/10.20546/ijcmas.2019.811.074
https://doi.org/10.20546/ijcmas.2019.811.074
Autor:
Pranjal Dutta
Publikováno v:
Computer Science – Theory and Applications ISBN: 9783030794156
CSR
CSR
Koiran’s real \(\tau \)-conjecture asserts that if a non-zero real univariate polynomial f can be written as \(\sum _{i=1}^{k}\prod _{j=1}^m\,f_{ij}\), where each \(f_{ij}\) contains at most t monomials, then the number of distinct real roots of f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0278788083f7f36340c62850a0b110da
https://doi.org/10.1007/978-3-030-79416-3_5
https://doi.org/10.1007/978-3-030-79416-3_5