#Virdia
LightNews LightNews
skinnedvelvet.bsky.social
lovely Virdia 🌹

*.• #skinnedvelvetart #GeblerAP
October 23, 2025 at 9:16 PM
bellyjoegstring.bsky.social
Jilco and Virdia
January 19, 2025 at 2:01 AM
lunethbosco.bsky.social
Virdia and Kith with their pookies.
February 13, 2026 at 2:40 PM
bellyjoegstring.bsky.social
Allo I am Cherry and these are my fandoms/ships/fave characters that I mainly like/post about:
♡ Green Day
♡ LiS series (JeffyMax my otp)
♡ Arcane (Jilco, Steb)
♡ TDP (VirDia)
♡ Naruto (KakaSaku, Gaara)
♡ TLoU (Joellie)
♡ Witcher (CiriGeralt)
♡ Pokemon
♡ video games in general
December 8, 2024 at 10:15 AM
superluminous.bsky.social
I got into The Dragon Prince fandom in December 2019. In January 2020, my main TDP ship was Viravos but by December of the same year, my main ships were Sordia, Claaravos, Virdia, Sorvir and Virayla.
February 1, 2025 at 11:27 PM
bellyjoegstring.bsky.social
I'll definitely try. For Virdia 😵‍💫
March 25, 2025 at 6:24 AM
superluminous.bsky.social
🔸My Ships🔸

The Dragon Prince

🔹 Main ships: Finnlum, Claaravos, Raydia, Rayllum, Claudium, Finnavos, Virayla, Virdia + various poly combinations.

⚠️ I always tag ships. I won't post anything explicitly Virdia on this account but I may mention it.
October 27, 2024 at 9:36 AM
eprint.ing.bot
FrodoKEM: A CCA-Secure Learning With Errors Key Encapsulation Mechanism (Lewis Glabush, Patrick Longa, Michael Naehrig, Chris Peikert, Douglas Stebila, Fernando Virdia) ia.cr/2025/1861
Abstract. Large-scale quantum computers capable of implementing Shor’s algorithm pose a significant threat to the security of the most widely used public-key cryptographic schemes. This risk has motivated substantial efforts by standards bodies and government agencies to identify and standardize quantum-safe cryptographic systems. Among the proposed solutions, lattice-based cryptography has emerged as the foundation for some of the most promising protocols. This paper describes FrodoKEM, a family of conservative key-encapsulation mechanisms (KEMs) whose security is based on generic, “unstructured” lattices. FrodoKEM is proposed as an alternative to the more efficient lattice schemes that utilize algebraically structured lattices, such as the recently standardized ML-KEM scheme. By relying on generic lattices, FrodoKEM minimizes the potential for future attacks that exploit algebraic structures while enabling simple and compact implementations. Our plain C implementations demonstrate that, despite its conservative design and parameterization, FrodoKEM remains practical. For instance, the full protocol at NIST security level 1 runs in approximately 0.97 ms on a server-class processor, and 4.98 ms on a smartphone-class processor. FrodoKEM obtains (single-target) IND-CCA security using a variant of the Fujisaki-Okamoto transform, applied to an underlying public-key encryption scheme called FrodoPKE. In addition, using a new tool called the Salted Fujisaki-Okamoto (SFO) transform, FrodoKEM is also shown to tightly achieve multi-target security, without increasing the FrodoPKE message length and with a negligible performance impact, based on the multi-target IND-CPA security of FrodoPKE. Image showing part 2 of abstract.
October 8, 2025 at 4:55 AM
moonlightrift.bsky.social
Christmas Gift #5 - Virdia Noire

#mlp
A unicorn OC from My Little Pony: Friendship is Magic. They're looking at the camera with a blep. They have a long mane, which covers one of their eyes. They're wearing a jacket. Their cutie mark is a book being written in with a quill. The art is drawn on paper and shaded with pencil.
December 25, 2023 at 7:56 PM
ccanngreen.bsky.social
New arc, new city, new characters. Welcome to Moss City, Virdia Region!

And a happy 1 year anniversary to this webcomic!!

This new arc illustration is available in my Patreon for both free and paid tier members!

www.patreon.com/ccanngreen?u...
October 19, 2025 at 11:23 PM
durumcrustulum.com
Next up, 'Finding Bugs and Features Using Cryptographically-Informed Functional Testing', presented by Fernando Virdia

eprint.iacr.org/2024/1122

#realworldcrypto
Finding Bugs and Features Using Cryptographically-Informed Functional Testing
In 2018, Mouha et al. (IEEE Trans. Reliability, 2018) performed a post-mortem investigation of the correctness of reference implementations submitted to the SHA3 competition run by NIST, finding previ...
eprint.iacr.org
March 9, 2026 at 5:46 AM
eprint.ing.bot
Practical Semi-Open Chat Groups for Secure Messaging Applications (Alex Davidson, Luiza Soezima, Fernando Virdia) ia.cr/2025/469
Abstract. Chat groups in secure messaging applications such as Signal, Telegram, and Whatsapp are nowadays used for rapid and widespread dissemination of information to large groups of people. This is common even in sensitive contexts, associated with the organisation of protests, activist groups, and internal company dialogues. Manual administration of who has access to such groups quickly becomes infeasible, in the presence of hundreds or thousands of members. We construct a practical, privacy-preserving reputation system, that automates the approval of new group members based on their reputation amongst the existing membership. We demonstrate security against malicious adversaries in a single-server model, with no further trust assumptions required. Furthermore, our protocol supports arbitrary reputation calculations while almost all group members are offline (as is likely). In addition, we demonstrate the practicality of the approach via an open-source implementation. For groups of size 50 (resp. 200), an admission process on a user that received 40 (resp. 80) scores requires 1312.2 KiB (resp. 5239.4 KiB) of communication, and 3.3s (resp. 16.3s) of overall computation on a single core. While our protocol design matches existing secure messaging applications, we believe it can have value in distributed reputation computation beyond this problem setting. Image showing part 2 of abstract.
March 13, 2025 at 6:36 PM
bellyjoegstring.bsky.social
Since it's Jeffy's bday, I also wrote a little something to celebrate him (and his dick)

Much more nsfw and graphic than my Virdia fic. Pls heed the tags!

archiveofourown.org/works/64580869
Treasure, Pleasure, Leisure - bellyjoegstring - Life is Strange (Video Games 2015 2017 2024) [Archive of Our Own]
An Archive of Our Own, a project of the Organization for Transformative Works
archiveofourown.org
April 11, 2025 at 4:18 AM
crimsonveil.bsky.social
CW: incest

Originally drawn for Claudia's birthday.

#tdpnsfw #virdia #sordia #claaravos #virdisoravos
Pencil drawing, black and white. Viren, Soren, Claudia and Aaravos are naked. Viren and Soren are sitting on either side of Claudia. Viren is kissing her cheek and hugging her waist. Soren is kissing her neck and touching her breast. Hid other arm is on her inner thigh. Aaravos is between her legs, eating her out.
September 8, 2024 at 2:35 AM
eprint.ing.bot
Quantum Lattice Enumeration in Limited Depth (Nina Bindel, Xavier Bonnetain, Marcel Tiepelt, Fernando Virdia) ia.cr/2023/1423
Abstract. In 2018, Aono et al. (ASIACRYPT 2018) proposed to use quantum backtracking algorithms (Montanaro, TOC 2018; Ambainis and Kokainis, STOC 2017) to speedup lattice point enumeration. Quantum lattice sieving algorithms had already been proposed (Laarhoven et al., PQCRYPTO 2013), being shown to provide an asymptotic speedup over classical counterparts, but also to lose competitivity at relevant dimensions to cryptography if practical considerations on quantum computer architecture were taken into account (Albrecht et al., ASIACRYPT 2020). Aono et al.’s work argued that quantum walk speedups can be applied to lattice enumeration, achieving at least a quadratic asymptotic speedup à la Grover search while not requiring exponential amounts of quantum accessible classical memory, as it is the case for sieving. In this work, we explore how to lower bound the cost of using Aono et al.’s techniques on lattice enumeration with extreme cylinder pruning assuming a limit to the maximum depth that a quantum computation can achieve without decohering, with the objective of better understanding the practical applicability of quantum backtracking in lattice cryptanalysis. Image showing part 2 of abstract.
September 28, 2023 at 3:59 PM
ordofibonacci.bsky.social
Quantum Lattice Enumeration in Limited Depth, Fernando Virdia
Microsoft Research
youtu.be/fvyj7ACj2K4?...
Quantum Lattice Enumeration in Limited Depth, Fernando Virdia
YouTube video by Microsoft Research
youtu.be
January 8, 2025 at 4:02 AM
eprint.ing.bot
Refined Modelling of the Primal Attack, and Variants Against Module-Learning With Errors (Paola de Perthuis, Filip Trenkić) ia.cr/2025/2195
Abstract. The primal attack reduces Learning with Errors (LWE) to the unique Shortest Vector Problem (uSVP), and then applies lattice reduction such as BKZ to solve the latter. Estimating the cost of the attack is required to evaluate the security of constructions based on LWE. Existing fine-grained estimators for the cost of the primal attack, due to Dachman-Soled–Ducas–Gong–Rossi (CRYPTO 2020) and Postlethwaite–Virdia (PKC 2021), differ from experimental data as they implicitly assume the unique shortest vector is resampled several times during the attack, changing its length. Furthermore, these estimators consider only the first two moments of the LWE secret and error, and therefore do not differentiate between distinct centred distributions with equal variances. We remedy both issues by initially fixing the short vector’s length, and later integrating over its distribution. We provide extensive experimental evidence that our estimators are more accurate and faithfully capture the behaviour of different LWE distributions. In the case of Module-LWE, lattice reduction utilising the module structure could lead to cheaper attacks. We build upon the analysis of module lattice reduction by Ducas–Engelberts–Perthuis (Asiacrypt 2025), providing a simulator for Module-BKZ generalising the BKZ simulator of Chen–Nguyen (Asiacrypt 2011). We design estimators for a module variant of the primal attack, supporting our analysis with experimental evidence. Asymptotically, we show the module primal attack over a degree d number field K has a reduced cost, resulting in a subexponential gain, whenever the discriminant Δ_(K) satisfies |Δ_(K)| < d^(d), one such case being non-power-two cyclotomics. Image showing part 2 of abstract.
December 5, 2025 at 11:03 AM
eprint.ing.bot
Cool + Cruel = Dual (Alexandr Karenin, Elena Kirshanova, Julian Nowakowski, Eamonn W. Postlethwaite, Fernando Virdia) ia.cr/2025/1002
Abstract. Recently [Wenger et al.~IEEE S&P 2025] claimed that the `Cool and Cruel’ (C+C) approach to solving LWE with sparse secrets [Nolte et al.~AFRICACRYPT 2024] outperforms other approaches, in particular the well established primal attack. In this work we show that i.~C+C is an instantiation of a known dual attack [Albrecht, EUROCRYPT 2017], ii.~experimental evidence that the primal attack can outperform C+C in similar regimes to those studied by Wenger et al. and iii.~both theoretical justification and experimental evidence that C+C is a consequence of a basis profile called the Z-shape. To prove i.~we introduce a framework for dimension reduction in bounded distance decoding problems that may be of independent interest. For ii.~we provide an open source implementation of the primal attack that is properly parametrised for short, sparse ternary secret LWE and guesses portions of the secret, along with an error analysis for a rounded variant of LWE that proves useful for practical cryptanalysis. Given iii.~we falsify a claim of Nolte et al.
June 2, 2025 at 3:09 AM
eprint.ing.bot
Finding Bugs and Features Using Cryptographically-Informed Functional Testing (Giacomo Fenzi, Jan Gilcher, Fernando Virdia) ia.cr/2024/1122
Abstract. In 2018, Mouha et al. (IEEE Trans. Reliability, 2018) performed a post-mortem investigation of the correctness of reference implementations submitted to the SHA3 competition run by NIST, finding previously unidentified bugs in a significant portion of them, including two of the five finalists. Their innovative approach allowed them to identify the presence of such bugs in a black-box manner, by searching for counterexamples to expected cryptographic properties of the implementations under test. In this work, we extend their approach to key encapsulation mechanisms (KEMs) and digital signature schemes (DSSs). We perform our tests on multiple versions of the LibOQS collection of post-quantum schemes, to capture implementations at different points of the recent Post-Quantum Cryptography Standardization Process run by NIST. We identify multiple bugs, ranging from software bugs (segmentation faults, memory overflows) to cryptographic bugs, such as ciphertext malleability in KEMs claiming IND-CCA security. We also observe various features of KEMs and DSS that do not contradict any security guarantees, but could appear counter-intuitive. Image showing part 2 of abstract.
July 10, 2024 at 8:37 AM
eprint.ing.bot
A note on securing insertion-only Cuckoo filters (Fernando Virdia, Mia Filić) ia.cr/2024/520
Abstract. We describe a small tweak to Cuckoo filters that allows securing them under insertions using the techniques from Filić et al. (ACM CCS 2022), without the need for an outer PRF call.
April 6, 2024 at 4:04 AM
eprint.ing.bot
Popping “R-propping”: breaking hardness assumptions for matrix groups over F_{2^8} (Fernando Virdia) ia.cr/2023/1425
Abstract. A recent series of works (Hecht, IACR ePrint, 2020–2021) propose to build post-quantum public-key encapsulation, digital signatures, group key agreement and oblivious transfer from “R-propped” variants of the Symmetrical Decomposition and Discrete Logarithm problems for matrix groups over 𝔽_(2⁸). We break all four proposals by presenting a linearisation attack on the Symmetrical Decomposition platform, a forgery attack on the signature scheme, and a demonstration of the insecurity of the instances of the Discrete Logarithm Problem used for signatures, group key agreement and oblivious transfer, showing that none of the schemes provides adequate security.
September 28, 2023 at 3:59 PM
bellyjoegstring.bsky.social
So excited for the Viren event and to contribute to the Virdia fandom that I've already started on mine. Watch me not finish it though 🙃
March 24, 2025 at 1:59 PM
superluminous.bsky.social
I left the Sorayla community over this, actually. Sorayla shippers were constantly harassed by antis and one of the artists decided to push Virdia under the bus while defending their ship. Unprompted, btw.
sagegarnish.bsky.social 𝕊𝕒𝕘𝕖🍃 @sagegarnish.bsky.social · Oct 8
And you think it's STUPID because there's nothing "gross about your ship" You think "They should harass ppl with actually gross ships"
Like, newsflash, they really think that about your ship.
You are fostering this environment.
April 28, 2025 at 4:53 AM
crimsonveil.bsky.social
Virdia is absolutely one of my favorite ships! And I love fake grumpy Viren who secretly enjoys being taken care of 💜
April 12, 2025 at 8:44 AM
crimsonveil.bsky.social
#incest #Virdia #magefamcest
Loli harley tweeted: “Claudia gets a bf in the new season” yeah it’s Viren he’s been on the show the whole time
February 8, 2025 at 3:08 PM