ashutosh1206 / crypton Goto Github PK

Library consisting of explanation and implementation of all the existing attacks on various Encryption Systems, Digital Signatures, Key Exchange, Authentication methods along with example challenges from CTFs

License: MIT License

Python 99.78% Shell 0.07% Dockerfile 0.15%

crypto ctf cryptography cryptanalysis ctf-tools ctf-challenges ctf-solutions

crypton's People

Contributors

Stargazers

Watchers

Forkers

mukeshtiwari hackerman008 shangadi eminent10 k0rsec snyiu100 naveenselvan nadxtract felixwangchao lightoyou ufwt hoyong2007 4n6strider fingerleakers darg0001 safeeval avaudioplayer p0prxx lovebair2022 tonyle9 ericmann lummar ifoundthetao tchen0123 metalivedev ggalancs sheshomaru28 eos21 csky6688 soljcam goryszewskig awesome-security windyorguk jmcardon eyedeekay sn0wcra5h sctnightcore minhtranca fjsnogueiracx mycryptt mytutoriall trendingtechnology fcu-d0449763 ajblane yhzx2013 bigmaster5000 dannymas hapazores ddddavidee apogiatzis saleem144 dmmca cexplr infosecjack acad2 shad0w008 averroes triviality cyberwarefare eventeezer noraj jbisterfeldt modulexcite alameyo nsg1999 ajmartel theevilsyn mcaramma dileepvarmaaa ahmadkhalaf amir-s securux twisted-fun stinger2310 vanshdevgan zhouhongwang ce-automne ek0n metaver5o jim-wigginton-medigap okpreetam teambi0s 0x6b7966 raodenprime chandukona pyons vraghuvaran meenakshisl hhy5277 utkarshiam imulmul quixoticluck codepwnda devzero2000 lucyoa amoniaka-knabino kaushikramabhotla sayoojsamuel lisn0 6egic

crypton's Issues

Fix AES-GCM Implementation

Fix AES-GCM implementation - ideally looking for an AES-GCM implementation in python3 from scratch
Modify the README accordingly

False positives in non-prime-suborder elem generation in Small Subgroup Confinement

In the step-3 of Attack in Practice section of Small Subgroup Confinement Attack, we generate elements that produce subgroup order p₁^e₁.

This method can generate false positives in cases where the order of subgroup to be generated is non-prime. For example: if we want to generate elements having subgroup order 2³, the method can generate elements having subgroup order 2, 2² other than elements having subgroup order 2³.

PoC (sagemath):

q = 919
Zq = Zmod(q)
group_order = q-1
print(group_order)
assert group_order % (3^3) == 0

subgroup_order = 3^3
exp = group_order/subgroup_order
nfalse_positives = 0
for i in range(10000):
    elem = Zq(randint(1, q-1))
    res = elem**exp
    if res != 1:
        order = res.multiplicative_order()
        if Integer(order) != sub_order:
            nfalse_positives += 1
print("False positives: ", str(nfalse_positives))

Thanks to Vara Prasad for finding this issue and the PoC

Bug in implementation of Pohlig Hellman Algorithm for solving DLP

There is an error in Line 38 of implementation of Pohlig Hellman Algorithm for solving algebraic DLP: https://github.com/ashutosh1206/Crypton/blob/master/Discrete-Logarithm-Problem/Algo-Pohlig-Hellman/pohlig_hellman.py#L38

The function implementation should return 2 when pow(g, 2, p) == y, but it is returning y instead.

ashutosh1206 / crypton Goto Github PK

crypton's People

Contributors

Stargazers

Watchers

Forkers

crypton's Issues

Fix AES-GCM Implementation

False positives in non-prime-suborder elem generation in Small Subgroup Confinement

Bug in implementation of Pohlig Hellman Algorithm for solving DLP

Recommend Projects

React

Vue.js

Typescript

TensorFlow

Django

Laravel

D3

Recommend Topics

javascript

web

server

Machine learning

Visualization

Game

Recommend Org

Facebook

Microsoft

Google

Alibaba

D3

Tencent