Return to search

Analýza algoritmu SQUFOF / Analysis of the SQUFOF algoritm

This thesis deals with collecting facts and making the complete analysis of SQUFOF algorithm. In the beginning you can find a short hystorical re- view and then it continues with desribing how the binary quadratic forms, which represents the number N, continued fractions of √ N, ideals in the ring Z( √ N) and lattices in Q( √ N) are related. This thesis offers the tools usable to switch between these structures and finally it uses these tools to show, how the algorithm SQUFOF works. 1

Identiferoai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:352638
Date January 2016
CreatorsLanger, Lukáš
ContributorsŽemlička, Jan, Příhoda, Pavel
Source SetsCzech ETDs
LanguageCzech
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/masterThesis
Rightsinfo:eu-repo/semantics/restrictedAccess

Page generated in 0.0018 seconds