Pub Date : 2021-02-03DOI: 10.1007/s13389-020-00254-3
Johannes Mittmann, W. Schindler
{"title":"Timing attacks and local timing attacks against Barrett’s modular multiplication algorithm","authors":"Johannes Mittmann, W. Schindler","doi":"10.1007/s13389-020-00254-3","DOIUrl":"https://doi.org/10.1007/s13389-020-00254-3","url":null,"abstract":"","PeriodicalId":48508,"journal":{"name":"Journal of Cryptographic Engineering","volume":"11 1","pages":"369 - 397"},"PeriodicalIF":1.9,"publicationDate":"2021-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s13389-020-00254-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41923571","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-07DOI: 10.1007/s13389-020-00253-4
Maamar Ouladj, S. Guilley, P. Guillot, Farid Mokrane
{"title":"Spectral approach to process the (multivariate) high-order template attack against any masking scheme","authors":"Maamar Ouladj, S. Guilley, P. Guillot, Farid Mokrane","doi":"10.1007/s13389-020-00253-4","DOIUrl":"https://doi.org/10.1007/s13389-020-00253-4","url":null,"abstract":"","PeriodicalId":48508,"journal":{"name":"Journal of Cryptographic Engineering","volume":"12 1","pages":"75 - 93"},"PeriodicalIF":1.9,"publicationDate":"2021-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s13389-020-00253-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46672567","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-07DOI: 10.1007/s13389-020-00252-5
S. Nashimoto, D. Suzuki, N. Miura, Tatsuya Machida, Kohei Matsuda, M. Nagata
{"title":"Low-cost distance-spoofing attack on FMCW radar and its feasibility study on countermeasure","authors":"S. Nashimoto, D. Suzuki, N. Miura, Tatsuya Machida, Kohei Matsuda, M. Nagata","doi":"10.1007/s13389-020-00252-5","DOIUrl":"https://doi.org/10.1007/s13389-020-00252-5","url":null,"abstract":"","PeriodicalId":48508,"journal":{"name":"Journal of Cryptographic Engineering","volume":"11 1","pages":"289 - 298"},"PeriodicalIF":1.9,"publicationDate":"2021-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s13389-020-00252-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42118272","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-01Epub Date: 2021-06-01DOI: 10.1007/s13389-021-00265-8
Sergio Roldán Lombardía, Fatih Balli, Subhadeep Banik
Recently, cryptographic literature has seen new block cipher designs such as PRESENT, GIFT or SKINNY that aim to be more lightweight than the current standard, i.e., AES. Even though AES family of block ciphers were designed two decades ago, they still remain as the de facto encryption standard, with AES-128 being the most widely deployed variant. In this work, we revisit the combined one-in-all implementation of the AES family, namely both encryption and decryption of each AES-128/192/256 as a single ASIC circuit. A preliminary version appeared in Africacrypt 2019 by Balli and Banik, where the authors design a byte-serial circuit with such functionality. We improve on their work by reducing the size of the compact circuit to 2268 GE through 1-bit-serial implementation, which achieves 38% reduction in area. We also report stand-alone bit-serial versions of the circuit, targeting only a subset of modes and versions, e.g., AES-192 and AES-256. Our results imply that, in terms of area, AES-192 and AES-256 can easily compete with the larger members of recently designed SKINNY family, e.g., SKINNY-128-256, SKINNY-128-384. Thus, our implementations can be used interchangeably inside authenticated encryption candidates such as SKINNY-AEAD/-HASH, ForkAE or Romulus in place of SKINNY.
{"title":"Six shades lighter: a bit-serial implementation of the AES family.","authors":"Sergio Roldán Lombardía, Fatih Balli, Subhadeep Banik","doi":"10.1007/s13389-021-00265-8","DOIUrl":"https://doi.org/10.1007/s13389-021-00265-8","url":null,"abstract":"<p><p>Recently, cryptographic literature has seen new block cipher designs such as PRESENT, GIFT or SKINNY that aim to be more lightweight than the current standard, i.e., AES. Even though AES family of block ciphers were designed two decades ago, they still remain as the de facto encryption standard, with AES-128 being the most widely deployed variant. In this work, we revisit the combined one-in-all implementation of the AES family, namely both encryption and decryption of each AES-128/192/256 as a single ASIC circuit. A preliminary version appeared in Africacrypt 2019 by Balli and Banik, where the authors design a byte-serial circuit with such functionality. We improve on their work by reducing the size of the compact circuit to 2268 GE through 1-bit-serial implementation, which achieves 38% reduction in area. We also report stand-alone bit-serial versions of the circuit, targeting only a subset of modes and versions, e.g., AES-192 and AES-256. Our results imply that, in terms of area, AES-192 and AES-256 can easily compete with the larger members of recently designed SKINNY family, e.g., SKINNY-128-256, SKINNY-128-384. Thus, our implementations can be used interchangeably inside authenticated encryption candidates such as SKINNY-AEAD/-HASH, ForkAE or Romulus in place of SKINNY.</p>","PeriodicalId":48508,"journal":{"name":"Journal of Cryptographic Engineering","volume":"11 4","pages":"417-439"},"PeriodicalIF":1.9,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s13389-021-00265-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39668124","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-25DOI: 10.1007/s13389-020-00245-4
Geovandro Pereira, Javad Doliskani, David Jao
{"title":"x-only point addition formula and faster compressed SIKE","authors":"Geovandro Pereira, Javad Doliskani, David Jao","doi":"10.1007/s13389-020-00245-4","DOIUrl":"https://doi.org/10.1007/s13389-020-00245-4","url":null,"abstract":"","PeriodicalId":48508,"journal":{"name":"Journal of Cryptographic Engineering","volume":"11 1","pages":"57 - 69"},"PeriodicalIF":1.9,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s13389-020-00245-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45639409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号