Multi-user Security of the Sum of Truncated Random Permutations

Choi, Wonseok; Kim, Hwigyeom; Lee, Jooyoung; Lee, Yeongmin

doi:10.1007/978-3-031-22966-4_23

Cited by 3 publications

(5 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Enhancing Multi-User Security. Moreover, Gleeok-128 could be interpreted as an instantiation of SoP3-2 proposed by Wonseok, Hwigyeom, Jooyoung and Yeongmin at Asiacrypt 2022 [CKLL22]. To our knowledge, our Gleeok-128 is the first such instantiation with dedicated branches.…”

Section: General Constructionmentioning

confidence: 92%

“…The original SoP3-2 takes an independent key for each branch, instead, we use a single key with three different algorithms. If we view each Branch in Gleeok-128 as a tweakable block cipher (TBC) taking a tweak, where each branch takes one of the three possible values, a hybrid argument shows quite strong multi-user security bound (see Table 1 of [CKLL22]). In particular, it has a multi-user bound stronger than that of 2-branch designs -namely the sum of two permutations (SoP2) [DHT17,CKLL22].…”

Section: General Constructionmentioning

confidence: 99%

“…If we view each Branch in Gleeok-128 as a tweakable block cipher (TBC) taking a tweak, where each branch takes one of the three possible values, a hybrid argument shows quite strong multi-user security bound (see Table 1 of [CKLL22]). In particular, it has a multi-user bound stronger than that of 2-branch designs -namely the sum of two permutations (SoP2) [DHT17,CKLL22]. In terms of the number of users (µ) and the number of maximum queries to one user (q max ), SoP2 has the bound √ µq max/2 n , while SoP3-2 has √ µq 2 max /2 2.5n [CKLL22], where n denotes the block size in bits.…”

Section: General Constructionmentioning

confidence: 99%

“…In particular, it has a multi-user bound stronger than that of 2-branch designs -namely the sum of two permutations (SoP2) [DHT17,CKLL22]. In terms of the number of users (µ) and the number of maximum queries to one user (q max ), SoP2 has the bound √ µq max/2 n , while SoP3-2 has √ µq 2 max /2 2.5n [CKLL22], where n denotes the block size in bits.…”

Section: General Constructionmentioning

confidence: 99%

“…The second one follows the fact that f [P] is equivalent to SoP3-2 (as ideal TBC implements an independent random permutation for each tweak) and the mu-prf bound of SoP3-2 from [CKLL22].…”

Section: Adv Mu-prfmentioning

confidence: 99%

See 4 more Smart Citations

Gleeok: A Family of Low-Latency PRFs and its Applications to Authenticated Encryption

Anand,

Banik,

Caforio

et al. 2024

TCHES

View full text Add to dashboard Cite

In this paper, we propose a new family of low-latency pseudorandom functions (PRFs), dubbed Gleeok.Gleeok utilizes three 128-bit branches to achieve a 256-bit key size while maintaining low latency. The first two branches are specifically designed to defend against statistical attacks, especially for differential attacks, while the third branch provides resilience against algebraic attacks. This unique design enables Gleeok to offer ultralow latency while supporting 256-bit keys, setting it apart from existing ciphers dedicated to low-latency requirements. In addition, we propose wide-block variants having three 256-bit branches. We also present an application of Gleeok to short-input authenticated encryption which is crucial for memory encryption and various realtime communication applications. Furthermore, we present comprehensive hardware implementation results that establish the capabilities of Gleeok and demonstrate its competitiveness against related schemes in the literature. In particular, Gleeok achieves a minimum latency of roughly 360 ps with the NanGate 15 nm cell library and is thus on par with related low-latency schemes that only feature 128-bit keys while maintaining minimal overhead when equipped in an authenticated mode of operation.

show abstract

Section: General Constructionmentioning

confidence: 92%

Section: General Constructionmentioning

confidence: 99%

Section: General Constructionmentioning

confidence: 99%

Section: General Constructionmentioning

confidence: 99%

“…The second one follows the fact that f [P] is equivalent to SoP3-2 (as ideal TBC implements an independent random permutation for each tweak) and the mu-prf bound of SoP3-2 from [CKLL22].…”

Section: Adv Mu-prfmentioning

confidence: 99%

See 3 more Smart Citations