Pizzirani, Alberto (2014) New experiments for cryptanalysis on elliptic curves. [Tesi di dottorato]


Download (1MB) | Preview
[error in script] [error in script]
Item Type: Tesi di dottorato
Lingua: English
Title: New experiments for cryptanalysis on elliptic curves
Pizzirani, Albertoa.pizzirani@gmail.com
Date: 30 March 2014
Number of Pages: 91
Institution: Università degli Studi di Napoli Federico II
Department: Matematica e Applicazioni "Renato Caccioppoli"
Scuola di dottorato: Scienze matematiche ed informatiche
Dottorato: Scienze computazionali e informatiche
Ciclo di dottorato: 25
Coordinatore del Corso di dottorato:
Moscariello, Giocondagmoscari@unina.it
Benerecetti, MassimoUNSPECIFIED
Date: 30 March 2014
Number of Pages: 91
Uncontrolled Keywords: elliptic curves; rho Pollard; SIMD; modular arithmetic
Settori scientifico-disciplinari del MIUR: Area 01 - Scienze matematiche e informatiche > INF/01 - Informatica
Area 01 - Scienze matematiche e informatiche > MAT/03 - Geometria
Area 01 - Scienze matematiche e informatiche > MAT/04 - Matematiche complementari
Date Deposited: 10 Apr 2014 10:11
Last Modified: 31 Dec 2017 02:00
URI: http://www.fedoa.unina.it/id/eprint/9807
DOI: 10.6093/UNINA/FEDOA/9807


The work of this thesis is focused on improving some tools commonly used for cryptoanalytical applications on elliptic curves, and some of them can be applied also when performing modular arithmetic in a more general context than the cryptological one. In chapter 1 it is given an introduction to the NVidia CUDA programming model and described some problems that can appear while writing code that must run on graphic processing units. In chapter 2 it is described a full implementation for single-instruction multiple-data architectures of a fast modular arithmetic library, with emphasis on the modular inversion. It is presented a variant of the Stein's algorithm that reduces divergence among thread and allows to consider it as a good alternative (for sufficiently big prime fields) to the branch-free algorithm based on Euler-Fermat theorem. In chapter 3 it is discussed the Rho-Pollard implementation for single-instruction multipledata architectures that uses the negation maps. It is presented also a variant of the classical iterating function of the Rho-Pollard algorithm to reduce the overhead to check for fruitless cycles. Chapter 4 contains the description of an experimental work performed on SAGE and aimed to apply the Smart's attack on anomalous elliptic curves (defined on prime fields) to a curve defined over a ring Zn1n2 with n1n2 points. To realize these experiments, the author, implemented into SAGE a complete system of addition laws for elliptic curves over rings, and the functions to perform arithmetic on polyadic numbers.

Actions (login required)

View Item View Item