Open Centre for Cryptography & Secure System Glob (@occssg) header
Open Centre for Cryptography & Secure System Glob (@occssg) profile picture

Open community for Developers, Reachers & Students exploring Cryptography, Security & Quantum computing

security
Joined November 2026
Photo by Open Centre for Cryptography & Secure System Glob (@occssg)Photo by Open Centre for Cryptography & Secure System Glob (@occssg)Photo by Open Centre for Cryptography & Secure System Glob (@occssg)Photo by Open Centre for Cryptography & Secure System Glob (@occssg)Photo by Open Centre for Cryptography & Secure System Glob (@occssg)Photo by Open Centre for Cryptography & Secure System Glob (@occssg)
The ILL Bloom session comes to an end! We explored how randomness is generated, how weak random number generators work, and their impact on crypto wallet security. Kudos to @coinspect team for the research behind ILL Bloom & thanks to everyone who joined.
1
4
52
The session has begun on ill Bllom crypto wallet vulnerability at @CFT_Tweets.
1
1
4
62
How secure is a crypto wallet if the randomness behind its recovery phrase is weak? Join us for a technical discussion on **ILL Bloom (CVE-2026-71851), investigated by Coinspect, with Vikrant Singh, VP Tech @CFT_Tweets 📅 5 Nov | 6:15 PM IST 📍 CFT Branch Office
2
4
70
Super Security Energy in Mumbai the two days were Blast..sharing all knowledge with the community soon.
4
64
How much control do we really have over our digital identities? At OCCSSG, we explored Self-Sovereign Identity (SSI) and how cryptography can shift identity ownership from centralised providers towards individuals.
1
4
93
The discussion began with three identity models: • Centralised Identity • Federated Identity • Self-Sovereign Identity (SSI) Each represents a different approach to managing identity, trust and control over personal information.
1
4
23
How can two people establish a shared secret over a public channel without ever exchanging the secret itself? This is the problem Diffie-Hellman Key Exchange set out to solve. A fundamental breakthrough in modern cryptography.
1
3
68
The mathematics behind it relies on two ideas: • Modular arithmetic • The Discrete Logarithm Problem Computing modular exponentiation is easy. Reversing it to recover the original exponent is computationally difficult. This asymmetry is central to Diffie-Hellman.
1
1
14