• JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
 
  Bookmark and Share
 
 
Master's Dissertation
DOI
https://doi.org/10.11606/D.3.2021.tde-23092021-104520
Document
Author
Full name
Gustavo Henrique Muriel Zanon
E-mail
Institute/School/College
Knowledge Area
Date of Defense
Published
São Paulo, 2021
Supervisor
Committee
Simplicio Junior, Marcos Antonio (President)
Aranha, Diego de Freitas
Terada, Routo
Title in Portuguese
Técnicas de compressão de chaves para criptossistemas baseados em isogenias.
Keywords in Portuguese
Algorítmos
Criptologia
Isogenias
Abstract in Portuguese
A criptografia baseada em isogenias supersingulares constitui uma das famílias mais recentes dentre as propostas resistentes a ataques com computadores quânticos. Uma característica interessante é a sua baixa ocupação de banda, viabilizada pela natureza intrínseca do problema computacional, em comparação a outros protocolos de acordo de chave, e potencializada pela possibilidade de compressão ulterior de chaves. No entanto, a compressão e correspondente descompressão introduzem uma sobrecarga significativa no custo geral de processamento, apesar de progressos recentes. Neste trabalho, abordam-se os principais gargalos de processamento envolvidos na compressão e descompressão de chaves e sugerem-se técnicas eficientes para todas as etapas desse processo, a saber, geração eficiente das bases de torção, cálculo eficiente de logaritmos discretos e cálculo eficiente de emparelhamento supersingulares. Quando utilizados em conjunto, essas técnicas produzem ganhos observados de até três ordens de grandeza em relação aos melhores resultados de técnicas anteriormente propostas na literatura.
Title in English
Key-compression techniques for isogeny-based cryptosystems.
Keywords in English
Cryptographic protocols
Cryptology
Efficient algorithms
Post-quantum cryptography
Supersingular isogenies
Abstract in English
Supersingular isogeny-based cryptography is one of the most recent families among proposals resistant to attacks with quantum computers. An interesting feature is the comparatively low bandwidth occupation, made possible by the intrinsic nature of the computational problem, compared to other key agreement protocols, and enhanced by the possibility of further key compression. However, compression and corresponding decompression introduce a significant overhead to the overall processing cost, despite recent progress. In this work, the main processing bottlenecks involved in the compression and decompression of keys are addressed and efficient techniques are suggested for all stages of this process, namely, efficient generation of the torsion bases, efficient calculation of discrete logarithms and efficient calculation of supersingular pairing are suggested. When used together, these techniques produce observed gains of up to three orders of magnitude in relation to the best results of techniques previously proposed in the literature.
 
WARNING - Viewing this document is conditioned on your acceptance of the following terms of use:
This document is only for private use for research and teaching activities. Reproduction for commercial use is forbidden. This rights cover the whole data about this document as well as its contents. Any uses or copies of this document in whole or in part must include the author's name.
Publishing Date
2021-09-24
 
WARNING: Learn what derived works are clicking here.
All rights of the thesis/dissertation are from the authors
CeTI-SC/STI
Digital Library of Theses and Dissertations of USP. Copyright © 2001-2024. All rights reserved.