# des

DES (Data Encryption Standard) is a cryptographic algorithm that transforms data into a cipher and back to its original form.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Witness Encryption via Prime-Order Generic Groups

DevFeed: [Witness Encryption via Prime-Order Generic Groups](<https://devfeed.tech/articles/witness-encryption-via-prime-order-generic-groups-126896.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2609.18275>)

Author: Isaac M Hair, Amit Sahai

Published: 2026-11-10T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [des](<https://devfeed.tech/topics/des.md>), [primes](<https://devfeed.tech/topics/primes.md>)

Tags: [adversary](<https://devfeed.tech/tags/adversary.md>), [approximation](<https://devfeed.tech/tags/approximation.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [gap](<https://devfeed.tech/tags/gap.md>), [generic](<https://devfeed.tech/tags/generic.md>), [groups](<https://devfeed.tech/tags/groups.md>), [np](<https://devfeed.tech/tags/np.md>), [prime](<https://devfeed.tech/tags/prime.md>), [rank](<https://devfeed.tech/tags/rank.md>), [reductions](<https://devfeed.tech/tags/reductions.md>)

### AI overview

The paper gives an unconditional construction of witness encryption for NP in the classical generic cyclic group model. For SAT instances of size n, encryption and decryption with any satisfying assignment run in polynomial time, with correctness error 2⁻ⁿ. For unsatisfiable instances, a generic adversary making at most n^(log n)^c group queries has distinguishing advantage at most n^−(log n)^c, for every constant c > 0. The paper also establishes a (log n)^c approximation-hardness gap for homogeneous MinRank under randomized polynomial-time reductions, including YES instances with a rank-one matrix u vᵀ where v is a 0/1 vector.

### Source excerpt

arXiv:2609.18275v3 Announce Type: replace Abstract: For every constant $c > 0$, we unconditionally construct witness encryption for NP in the classical generic cyclic group model with the following properties. For SAT instances of size $n$, encryption runs in time poly$(n)$, and any satisfying assignment can be used to decrypt in poly$(n)$ time with correctness error $2^{-n}$. If no satisfying assignment exists, every generic adversary making at most $n^{(\log n)^c}$ group queries has distinguishing advantage at most $n^{-(\log n)^c}$. Along the way, we give the first superconstant-factor NP-hardness of approximation result for homogeneous MinRank under randomized polynomial-time reductions. We obtain a gap of $(\log n)^c$ for any prescribed constant $c>0$, even when YES instances are required to have a rank-one matrix of the form $\mathbf u\mathbf v^T$ where $\mathbf v$ is a 0/1 vector. The main results of this paper were discovered by Codex / ChatGPT 6 Astra Ultra using harness components from the UCLA Moonshot Harness Project, in response to a general strategy for witness encryption suggested by the authors. See the end of the introduction for a discussion.

## HYFLOCK Ransomware Evolves with New Builds and Encryption Weaknesses

DevFeed: [HYFLOCK Ransomware Evolves with New Builds and Encryption Weaknesses](<https://devfeed.tech/articles/hyflock-ransomware-evolves-with-new-builds-and-encryption-weaknesses-117964.md>)

Original publisher: [Read original article](<https://blog.checkpoint.com/security/hyflock-ransomware-evolves-with-new-builds-and-encryption-weaknesses/>)

Author: raphaelge@checkpoint.com

Published: 2026-11-04T13:00:18Z

Content type: news

Language: en

Sources: [Check Point Blog](<https://devfeed.tech/sources/check-point-blog.md>)

Topics: [Vulnerabilities](<https://devfeed.tech/topics/vulnerabilities.md>), [software security audit](<https://devfeed.tech/topics/software-security-audit.md>), [des](<https://devfeed.tech/topics/des.md>)

Tags: [encryption](<https://devfeed.tech/tags/encryption.md>), [exposure-management](<https://devfeed.tech/tags/exposure-management.md>), [ransomware](<https://devfeed.tech/tags/ransomware.md>), [security](<https://devfeed.tech/tags/security.md>)

### AI overview

Researchers traced four HYFLOCK ransomware generations from April to October 2026, documenting changes in packaging, launch methods, background execution, and network activity. In controlled analysis, the October 17 build encrypted files, registered a scheduled task, accessed network shares, and attempted to interfere with recovery. Domain-wide propagation and other promoted capabilities were not confirmed. Encryption defects varied by build: one could discard file portions, while another encrypted only the first 4,096 bytes of larger files. Researchers recovered 73 CRC-valid components from seven Office files without a key, but did not restore complete files or develop a general decryption method. The excerpt says eight victim claims appeared on October 13 but notes they remain unverified.

### Source excerpt

Four ransomware generations. Six months of development. Eight victim claims published in a single day. HYFLOCK spent much of 2026 building its ransomware operation, recruiting participants through underground forums and promoting increasingly sophisticated attack capabilities. By October, the group had begun publicly naming victims, and its ransomware had undergone significant changes. Through threat hunting, Check Point Exposure Management researchers identified updated HYFLOCK ransomware builds and traced their development from April through October. The investigation revealed changes in how the malware launches, runs in the background, and interacts with network resources. Researchers also uncovered encryption weaknesses that could affect victims' ability [...] The post HYFLOCK Ransomware Evolves with New Builds and Encryption Weaknesses appeared first on Check Point Blog.

## Lumo can now turn your ideas into creations

DevFeed: [Lumo can now turn your ideas into creations](<https://devfeed.tech/articles/lumo-can-now-turn-your-ideas-into-creations-95474.md>)

Original publisher: [Read original article](<https://proton.me/blog/lumo-creations>)

Author: Elena Atencio

Published: 2026-10-22T13:48:49.114286Z

Content type: release

Language: en

Sources: [The Proton Blog](<https://devfeed.tech/sources/the-proton-blog.md>)

Topics: [AI Chat](<https://devfeed.tech/topics/ai-chat.md>), [AI for interactive applications](<https://devfeed.tech/topics/ai-for-interactive-applications.md>), [des](<https://devfeed.tech/topics/des.md>), [browser-game](<https://devfeed.tech/topics/browser-game.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [browser](<https://devfeed.tech/tags/browser.md>), [canvas](<https://devfeed.tech/tags/canvas.md>), [code](<https://devfeed.tech/tags/code.md>), [coding](<https://devfeed.tech/tags/coding.md>), [device](<https://devfeed.tech/tags/device.md>), [dialog](<https://devfeed.tech/tags/dialog.md>), [encrypted](<https://devfeed.tech/tags/encrypted.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [export](<https://devfeed.tech/tags/export.md>), [file](<https://devfeed.tech/tags/file.md>), [interactive](<https://devfeed.tech/tags/interactive.md>), [library](<https://devfeed.tech/tags/library.md>), [local](<https://devfeed.tech/tags/local.md>), [logs](<https://devfeed.tech/tags/logs.md>), [lumo-ai](<https://devfeed.tech/tags/lumo-ai.md>), [markdown](<https://devfeed.tech/tags/markdown.md>), [pages](<https://devfeed.tech/tags/pages.md>), [proton-updates](<https://devfeed.tech/tags/proton-updates.md>), [web](<https://devfeed.tech/tags/web.md>)

### AI overview

Lumo's canvas lets users create and revise documents, code, and interactive web pages alongside chat, with versions available to review, copy, download, or save to Proton Drive. Users can edit documents directly or ask Lumo to revise selected content; code can be improved or explained. Creations are collected in Library -> Creations, while the article says the latest versions are stored as encrypted copies that servers cannot read, and earlier versions remain in encrypted chat history. Export conversion runs on the user's device: Word files are generated from Markdown and PDFs use the browser's print dialog. The current Save to Drive -> PDF option produces image-based PDFs without selectable text; the article suggests printing to PDF in the browser and then uploading to Drive for selectable text. Creations are available to all Lumo users; presentations are described as forthcoming.

### Source excerpt

Create documents, code, and web pages with Lumo's canvas. Everything stays protected with zero-access encryption.

## Ultimate Go: Advanced Engineering Episode 11

DevFeed: [Ultimate Go: Advanced Engineering Episode 11](<https://devfeed.tech/articles/ultimate-go-advanced-engineering-episode-11-22200.md>)

Original publisher: [Read original article](<https://www.ardanlabs.com/blog/2023/01/ultimate-go-advanced-engineering-episode-11.html>)

Published: 2023-01-03T00:00:00Z

Content type: article

Language: en

Sources: [William Kennedy](<https://devfeed.tech/sources/william-kennedy.md>)

Topics: [Electrical engineering and computer science (EECS)](<https://devfeed.tech/topics/electrical-engineering-and-computer-science-eecs.md>), [des](<https://devfeed.tech/topics/des.md>), [implementation](<https://devfeed.tech/topics/implementation.md>)

Tags: [api](<https://devfeed.tech/tags/api.md>), [bitcoin](<https://devfeed.tech/tags/bitcoin.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [blockchain-asset](<https://devfeed.tech/tags/blockchain-asset.md>), [decentralized](<https://devfeed.tech/tags/decentralized.md>), [digital-signature](<https://devfeed.tech/tags/digital-signature.md>), [distributed](<https://devfeed.tech/tags/distributed.md>), [ecdsa](<https://devfeed.tech/tags/ecdsa.md>), [ecdsa-encryption](<https://devfeed.tech/tags/ecdsa-encryption.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [ethereum](<https://devfeed.tech/tags/ethereum.md>), [ethereum-authentication](<https://devfeed.tech/tags/ethereum-authentication.md>), [genesis-record](<https://devfeed.tech/tags/genesis-record.md>), [go](<https://devfeed.tech/tags/go.md>), [go-blockchain](<https://devfeed.tech/tags/go-blockchain.md>), [identity](<https://devfeed.tech/tags/identity.md>), [identity-management](<https://devfeed.tech/tags/identity-management.md>), [identity-verification](<https://devfeed.tech/tags/identity-verification.md>), [transactions](<https://devfeed.tech/tags/transactions.md>)

### AI overview

The episode starts with a scratch program for exploring the Ethereum API, then examines how a blockchain can verify user identity without relying on a central key store. Bill's first implementation step is to use ECDSA to verify transaction authenticity. The excerpt also says the episode explains Ethereum's identity-confirmation mechanisms and why ECDSA is practical for decentralized verification; it does not provide implementation details.

### Source excerpt

Introduction In episode 10, Bill dove into the technical implementation of his genesis record and defined a custom Go type representing the record. While doing so, he provided an in-depth look at the reasoning behind the fields he included.. After declaring this type, Bill wrote a function that loads the genesis record from disk and onto memory. His function will use the standard library encoding/json package to load JSON data from a hard-coded file path.

## How CVV, CVV2, and CVC Values Are Calculated

DevFeed: [How CVV, CVV2, and CVC Values Are Calculated](<https://devfeed.tech/articles/cvv-numbers-35284.md>)

Original publisher: [Read original article](<https://darkcoding.net/credit-card/cvv-numbers/>)

Author: Graham King

Published: 2005-10-23T16:46:27Z

Content type: article

Language: en

Sources: [Graham King](<https://devfeed.tech/sources/graham-king.md>)

Topics: [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [des](<https://devfeed.tech/topics/des.md>), [account](<https://devfeed.tech/topics/account.md>), [Network](<https://devfeed.tech/topics/network.md>)

Tags: [account](<https://devfeed.tech/tags/account.md>), [algorithm](<https://devfeed.tech/tags/algorithm.md>), [bank](<https://devfeed.tech/tags/bank.md>), [batch](<https://devfeed.tech/tags/batch.md>), [card](<https://devfeed.tech/tags/card.md>), [concatenation](<https://devfeed.tech/tags/concatenation.md>), [credit-card](<https://devfeed.tech/tags/credit-card.md>), [des](<https://devfeed.tech/tags/des.md>), [format](<https://devfeed.tech/tags/format.md>), [network](<https://devfeed.tech/tags/network.md>), [numbers](<https://devfeed.tech/tags/numbers.md>), [parameter](<https://devfeed.tech/tags/parameter.md>), [payment](<https://devfeed.tech/tags/payment.md>), [value](<https://devfeed.tech/tags/value.md>), [verification](<https://devfeed.tech/tags/verification.md>)

### AI overview

This article explains that CVV, CVV2, CVC, and Indent CVC are three-digit card verification values calculated with the same CVV algorithm. It describes the inputs, including the card number, expiration date, service code, and DES keys, and explains variations involving card batches, service codes, and expiration-date formats.

### Source excerpt

Unraveling the mysteries of card verification values.