On the optimality of non-linear computations for symmetric key primitives. Chakraborti, A., Datta, N., & Nandi, M. J. Mathematical Cryptology, 12(4):241–259, 2018. Paper doi bibtex @article{DBLP:journals/jmc/ChakrabortiDN18,
author = {Avik Chakraborti and
Nilanjan Datta and
Mridul Nandi},
title = {On the optimality of non-linear computations for symmetric key primitives},
journal = {J. Mathematical Cryptology},
volume = {12},
number = {4},
pages = {241--259},
year = {2018},
url = {https://doi.org/10.1515/jmc-2017-0011},
doi = {10.1515/jmc-2017-0011},
timestamp = {Thu, 13 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jmc/ChakrabortiDN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":"ppvF3nzXd6GLusnM9","bibbaseid":"chakraborti-datta-nandi-ontheoptimalityofnonlinearcomputationsforsymmetrickeyprimitives-2018","authorIDs":["dWkHd8XYhwAjy9Lzs"],"author_short":["Chakraborti, A.","Datta, N.","Nandi, M."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Avik"],"propositions":[],"lastnames":["Chakraborti"],"suffixes":[]},{"firstnames":["Nilanjan"],"propositions":[],"lastnames":["Datta"],"suffixes":[]},{"firstnames":["Mridul"],"propositions":[],"lastnames":["Nandi"],"suffixes":[]}],"title":"On the optimality of non-linear computations for symmetric key primitives","journal":"J. Mathematical Cryptology","volume":"12","number":"4","pages":"241–259","year":"2018","url":"https://doi.org/10.1515/jmc-2017-0011","doi":"10.1515/jmc-2017-0011","timestamp":"Thu, 13 Dec 2018 00:00:00 +0100","biburl":"https://dblp.org/rec/journals/jmc/ChakrabortiDN18.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/jmc/ChakrabortiDN18,\n author = {Avik Chakraborti and\n Nilanjan Datta and\n Mridul Nandi},\n title = {On the optimality of non-linear computations for symmetric key primitives},\n journal = {J. Mathematical Cryptology},\n volume = {12},\n number = {4},\n pages = {241--259},\n year = {2018},\n url = {https://doi.org/10.1515/jmc-2017-0011},\n doi = {10.1515/jmc-2017-0011},\n timestamp = {Thu, 13 Dec 2018 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/jmc/ChakrabortiDN18.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Chakraborti, A.","Datta, N.","Nandi, M."],"key":"DBLP:journals/jmc/ChakrabortiDN18","id":"DBLP:journals/jmc/ChakrabortiDN18","bibbaseid":"chakraborti-datta-nandi-ontheoptimalityofnonlinearcomputationsforsymmetrickeyprimitives-2018","role":"author","urls":{"Paper":"https://doi.org/10.1515/jmc-2017-0011"},"downloads":0,"html":""},"bibtype":"article","biburl":"https://dblp.org/pid/06/2136.bib","creationDate":"2020-03-26T08:29:49.644Z","downloads":0,"keywords":[],"search_terms":["optimality","non","linear","computations","symmetric","key","primitives","chakraborti","datta","nandi"],"title":"On the optimality of non-linear computations for symmetric key primitives","year":2018,"dataSources":["MuqitKytbZXJmeMjA"]}