凯撒能打败伽罗瓦吗?—CAESAR候选对象对Nonce重用和高数据复杂度攻击的鲁棒性

{"title":"凯撒能打败伽罗瓦吗?—CAESAR候选对象对Nonce重用和高数据复杂度攻击的鲁棒性","authors":"S. Vaudenay, Damian Vizár","doi":"10.1007/978-3-319-93387-0_25","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":412384,"journal":{"name":"International Conference on Applied Cryptography and Network Security","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Can Caesar Beat Galois? - Robustness of CAESAR Candidates Against Nonce Reusing and High Data Complexity Attacks\",\"authors\":\"S. Vaudenay, Damian Vizár\",\"doi\":\"10.1007/978-3-319-93387-0_25\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":412384,\"journal\":{\"name\":\"International Conference on Applied Cryptography and Network Security\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Applied Cryptography and Network Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-93387-0_25\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Applied Cryptography and Network Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-93387-0_25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}