000 03901naaaa2200721uu 4500
001 https://directory.doabooks.org/handle/20.500.12854/50457
005 20220220100414.0
020 _abooks978-3-03928-803-8
020 _a9783039288038
020 _a9783039288021
024 7 _a10.3390/books978-3-03928-803-8
_cdoi
041 0 _aEnglish
042 _adc
100 1 _aGonzález Vasco, María Isabel
_4auth
245 1 0 _aInteractions between Group Theory, Symmetry and Cryptology
260 _bMDPI - Multidisciplinary Digital Publishing Institute
_c2020
300 _a1 electronic resource (164 p.)
506 0 _aOpen Access
_2star
_fUnrestricted online access
520 _aCryptography lies at the heart of most technologies deployed today for secure communications. At the same time, mathematics lies at the heart of cryptography, as cryptographic constructions are based on algebraic scenarios ruled by group or number theoretical laws. Understanding the involved algebraic structures is, thus, essential to design robust cryptographic schemes. This Special Issue is concerned with the interplay between group theory, symmetry and cryptography. The book highlights four exciting areas of research in which these fields intertwine: post-quantum cryptography, coding theory, computational group theory and symmetric cryptography. The articles presented demonstrate the relevance of rigorously analyzing the computational hardness of the mathematical problems used as a base for cryptographic constructions. For instance, decoding problems related to algebraic codes and rewriting problems in non-abelian groups are explored with cryptographic applications in mind. New results on the algebraic properties or symmetric cryptographic tools are also presented, moving ahead in the understanding of their security properties. In addition, post-quantum constructions for digital signatures and key exchange are explored in this Special Issue, exemplifying how (and how not) group theory may be used for developing robust cryptographic tools to withstand quantum attacks.
540 _aCreative Commons
_fhttps://creativecommons.org/licenses/by-nc-nd/4.0/
_2cc
_4https://creativecommons.org/licenses/by-nc-nd/4.0/
546 _aEnglish
653 _aNP-Completeness
653 _aprotocol compiler
653 _apost-quantum cryptography
653 _aReed–Solomon codes
653 _akey equation
653 _aeuclidean algorithm
653 _apermutation group
653 _at-modified self-shrinking generator
653 _aideal cipher model
653 _aalgorithms in groups
653 _alightweight cryptography
653 _ageneralized self-shrinking generator
653 _anumerical semigroup
653 _apseudo-random number generator
653 _asymmetry
653 _apseudorandom permutation
653 _aBerlekamp–Massey algorithm
653 _asemigroup ideal
653 _aalgebraic-geometry code
653 _anon-commutative cryptography
653 _aprovable security
653 _aEngel words
653 _ablock cipher
653 _acryptography
653 _abeyond birthday bound
653 _aWeierstrass semigroup
653 _agroup theory
653 _abraid groups
653 _astatistical randomness tests
653 _agroup-based cryptography
653 _aalternating group
653 _aWalnutDSA
653 _aSugiyama et al. algorithm
653 _acryptanalysis
653 _adigital signatures
653 _aone-way functions
653 _akey agreement protocol
653 _aerror-correcting code
653 _agroup key establishment
856 4 0 _awww.oapen.org
_uhttps://mdpi.com/books/pdfview/book/2232
_70
_zDOAB: download the publication
856 4 0 _awww.oapen.org
_uhttps://directory.doabooks.org/handle/20.500.12854/50457
_70
_zDOAB: description of the publication
999 _c80240
_d80240