<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-27T21:22:40Z</responseDate><request verb="GetRecord" identifier="oai:uvadoc.uva.es:10324/70094" metadataPrefix="etdms">https://uvadoc.uva.es/oai/request</request><GetRecord><record><header><identifier>oai:uvadoc.uva.es:10324/70094</identifier><datestamp>2024-09-23T19:01:02Z</datestamp><setSpec>com_10324_1145</setSpec><setSpec>com_10324_931</setSpec><setSpec>com_10324_894</setSpec><setSpec>col_10324_1254</setSpec></header><metadata><thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.0/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.0/ http://www.ndltd.org/standards/metadata/etdms/1.0/etdms.xsd">
<title>Public key protocols from twisted-skew group rings</title>
<creator>Cruz, Javier de la</creator>
<creator>Martínez Moro, Edgar</creator>
<creator>Muñoz Ruiz, Steven</creator>
<creator>Villanueva Polanco, Ricardo</creator>
<subject>Group rings</subject>
<subject>Anillos (Algebra)</subject>
<subject>Public key cryptography</subject>
<subject>Data encryption (Computer science)</subject>
<subject>Cryptography</subject>
<subject>Criptografía</subject>
<subject>Data transmission systems</subject>
<subject>Sistemad de transmisión de datos</subject>
<subject>Computer security</subject>
<subject>Seguridad informática</subject>
<subject>Mathematics</subject>
<description>Producción Científica</description>
<description>This article studies some algebraic structures known as twisted-skew group rings in the context of public key cryptography. We first present some background related to these structures to then specifically introduce particular twisted-skew group rings and show how to utilize them as the underlying algebraic structure to build cryptographic protocols. We closely follow an incremental-like methodology to construct these protocols by putting parts together. As as result, we first introduce a key-agreement protocol and then generalize it to a group key-agreement protocol. We then proceed to construct a probabilistic public key encryption from our two-party key agreement and, finally, introduce a key-encapsulation mechanism from a well-known generic construction applied to probabilistic public encryption. Furthermore, we provide an in-depth security analysis for each cryptographic construction under new related algebraic assumptions and supply a proof-of-concept implementation for various candidate chosen groups.</description>
<date>2024-09-23</date>
<date>2024-09-23</date>
<date>2024</date>
<type>info:eu-repo/semantics/article</type>
<identifier>Cryptography, 2024, Vol. 8, Nº. 3, 29</identifier>
<identifier>2410-387X</identifier>
<identifier>https://uvadoc.uva.es/handle/10324/70094</identifier>
<identifier>10.3390/cryptography8030029</identifier>
<identifier>29</identifier>
<identifier>3</identifier>
<identifier>Cryptography</identifier>
<identifier>8</identifier>
<identifier>2410-387X</identifier>
<language>eng</language>
<relation>https://www.mdpi.com/2410-387X/8/3/29</relation>
<rights>info:eu-repo/semantics/openAccess</rights>
<rights>http://creativecommons.org/licenses/by/4.0/</rights>
<rights>© 2024 The authors</rights>
<rights>Atribución 4.0 Internacional</rights>
<publisher>MDPI</publisher>
</thesis></metadata></record></GetRecord></OAI-PMH>