Documentation
¶
Index ¶
Constants ¶
View Source
const DefaultTimeout int = 180
default timeout 3m0s
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Attacks ¶
type Attacks struct {
Supported []*Attack
}
Attacks wraps a slice of Attack objects that are supported.
var SupportedAttacks *Attacks
SupportedAttacks stores the list of registered attacks we support.
func (*Attacks) IsSupported ¶
IsSupported returns true if name attack is supported.
func (*Attacks) RegisterAttack ¶
func (a *Attacks) RegisterAttack(name string, multi bool, unnatended bool, timeout int, f attackFunc)
RegisterAttack adds a new attack to the receiving Attacks.
func (*Attacks) SupportsMulti ¶
SupportsMulti returns true if the attack supports multi-key attacks.
Source Files
Directories
¶
| Path | Synopsis |
|---|---|
|
Package abpq implements an rsa implementation against a ciphertext where we're given hints in the form of:
|
Package abpq implements an rsa implementation against a ciphertext where we're given hints in the form of: |
|
Package brokenrsa implements a common broken rsa implementation against a ciphertext.
|
Package brokenrsa implements a common broken rsa implementation against a ciphertext. |
|
Package defectivee implements a common broken rsa implementation where e and phi(n) are not coprime by finding the root of unity modulo n.
|
Package defectivee implements a common broken rsa implementation where e and phi(n) are not coprime by finding the root of unity modulo n. |
|
Package ecm implements the elliptic curve method of factorization and was originally written by Keith Randall and distributed under a Public Domain license from his Github here: https://github.com/randall77/factorlib
|
Package ecm implements the elliptic curve method of factorization and was originally written by Keith Randall and distributed under a Public Domain license from his Github here: https://github.com/randall77/factorlib |
|
Package jwtmodulus implements recoving an RS256 modulus given two JWTs.
|
Package jwtmodulus implements recoving an RS256 modulus given two JWTs. |
|
Package londahl implements Carl Löndahl's method of factorization for close primes and is based on code from RsaCtfTool https://github.com/grocid/CTF and Carl's CTF writeups https://github.com/grocid/CTF
|
Package londahl implements Carl Löndahl's method of factorization for close primes and is based on code from RsaCtfTool https://github.com/grocid/CTF and Carl's CTF writeups https://github.com/grocid/CTF |
|
Package oraclemodulus implements recoving an RSA modulus given the ciphertext of 2,3,4 and 9.
|
Package oraclemodulus implements recoving an RSA modulus given the ciphertext of 2,3,4 and 9. |
|
Package partiald implements an attack against the private exponent of RSA when >= 50% of the LSB of d are known.
|
Package partiald implements an attack against the private exponent of RSA when >= 50% of the LSB of d are known. |
|
Package signatures implements recoving the modulus from signatures and plaintexts.
|
Package signatures implements recoving the modulus from signatures and plaintexts. |
|
Package wienervariant implements Andrej Dujella's variant on Wiener's RSA attack.
|
Package wienervariant implements Andrej Dujella's variant on Wiener's RSA attack. |
Click to show internal directories.
Click to hide internal directories.