4800+ entries in 0.483s
deedbot: [Recent Phuctorings.] Phuctored: 9 divides
RSA Moduli belonging to 'Debarshi Ray <rishi.is@lostca.se>; Debarshi Ray (GNU Developer) <rishi@gnu.org>; Debarshi Ray (GMail Account) <debarshi.ray@gmail.com>; Debarshi Ray (Red Hat Employee) <debarshir@redhat.com>; Debarshi Ray (Fedora Packager) <rishi@fedoraproject.org>; Debarshi Ray (GNOME Developer) <debarshir@src.gnome.org>; Debarshi Ray (GNOME Foundation Member) <debarshir@gnome.org>; Debarshi Ray (Freedeskto
mircea_popescu: how the fuck does this fails to be obvious. YES YOUR
RSA KEY YOU USE FOR "SSH" MUST BE INTEROPERABLE WITH THE
RSA KEY I USE TO FUCK YOUR MOTHER.
mircea_popescu: have the decency to say -----BEGIN
RSA PUBLIC KEY----- uniformly and be done with it. or ECC or w/e the fuck it is, CrS
jurov: mostly
rsa, but also dsa, i can filter them
Apocalyptic: <+mircea_popescu> 35 mod 4 = 3 // yes, but this isn't related as the
RSA arithm doesn't happen in Z/35Z, let alone that 35 isn't prime
a111: Logged on 2016-04-23 01:40 shinohai: asciilifeform: any eta on the
rsa feed? I used to have it connected to my bot.
shinohai: asciilifeform: any eta on the
rsa feed? I used to have it connected to my bot.
☟︎ mircea_popescu: 5. Scolding answer: if you have to ask, please don't try to implement any of this yourself. It is very difficult to get
RSA right.
mircea_popescu: 4. Long-term answer: don't use
RSA.
RSA is well on its way to obsolescence. Most problems you'd ever want to solve with
RSA are better solved with Curve25519 (for DH) and Ed25519 (for signing). Not coincidentally, these are the algorithms implemented by Nacl, the only crypto library you should consider using.
mircea_popescu: 2. Pragmatic answer: prime numbers are generally coprime with the modulus, and so they're an easy answer, and so
RSA public exponents tend to be prime.
mircea_popescu: 1. Technical answer: an
RSA public exponent needs to be coprime with the modulus, which is not the same as requiring that it be prime.
mircea_popescu: let's play a little "guess the address of the scum pond" : Should an
RSA public exponent be prime?
mircea_popescu: BingoBoingo : you got your qntra piece right there. "Phuctor, the
RSA Super-Collider discovers vulnerability in Northrop Grumman PGP Root-CA "
mircea_popescu: phf if it's
rsa, it's food. alf the beedog is serious about bee's knees like that.
phf: mircea_popescu: it's the strategic superiority article's position is what i'm saying. you can rig up ipad to do crypto for you, as long as you shield it in a bunker, install some toy language environment on it and spend some time writing
rsa algo in that
mircea_popescu: i don't think there's anything wrong with proper, full
rsa (as opposed to the neutered version implemented by pgp)
mircea_popescu: anyway, back to the iB : there's a number of very valuable ideas, at least in my eyes, that discussion throughout has brought out. yes the sha thing discussed on trilema ; also - ada, linked into the c, and slowly driving out the c, much in the way the vermin try to drive out say x11 or
rsa etc.
mircea_popescu: if
rsa is broken, we have an event of the nature of "end of b-a" not of the nature of "an update".
phf: can then manually verify by doing hand
rsa. primes and ciphertext are base 10 for human convenience
jurov: asciilifeform: as usual, your lawyer will just crudely reimplement
rsa in excel
mircea_popescu: if i ever open a brothel here, we'll have a
rsa night.
assbot: Logged on 18-03-2016 14:46:05; mircea_popescu: (and yes in that month i can do the fucking
rsa exponentiation on paper three times over.)
mircea_popescu: (and yes in that month i can do the fucking
rsa exponentiation on paper three times over.)
☟︎ assbot: On how the factored 4096
RSA keys story was handled, and what it means to you. on Trilema - A blog by Mircea Popescu. ... (
http://bit.ly/1UZ9Gbe )
mircea_popescu: "security hole found in gpg" vs "security hole found in ecdsa -
rsa not affected, you should have not switched"
mod6: <+mircea_popescu> make a 4kb key and use it rather than the strange md5 lists or what's that. <<
RSA too.
mod6: what we really aught to do is write to that guy, get him to join the wot with a 4096 bit
RSA key, and have him resign all of the bundles.
mircea_popescu: they do not have the "
rsa pill". the block ciphers however as currently implemented are next to useless.
mircea_popescu: "It isn't easy to build a large general-purpose quantum computer, but many people publicly working on it seem to think that they'll be successful next decade. Maybe there will be serious obstacles that slow down or stop this success, but there's clearly a serious risk to
RSA and ECC, and it isn't sensible risk management to pretend that the problem doesn't exist."
mircea_popescu: <asciilifeform> what tech?
rsa ? << naw. the whole shebang.
maqp: Since it's ECDHE, the security is actually 3072-bit
RSA equivalent
mircea_popescu: in the EP? general scheme of true cryptography, otp occupies a peculiar spot, equivalent to
rsa's use of multiplication, where otp uses "multiplication modulo 1" or "multiplication in the binary group" for a º function
assbot: Logged on 23-01-2016 15:35:48; asciilifeform: problem is that one doesn't get to 'make a name' in academe as 'cryptographer' by pushing
rsa.
thestringpuller: every netsec guy at my coal mine is like "
RSA is bad don't use it mmmkay. ECC please"
thestringpuller: asciilifeform: dunno if this was in logs. but why is the "crypto comoonity" opposed to
RSA?
mircea_popescu: ascii_butugychag honestly, i suspect a) all actual cryptography revolves around º and º' pairs and b)
rsa is the only one where º = º' = multiplication.
ascii_butugychag: i kinda wonder, how many of the folks barfing, could explain how, e.g.,
rsa, works, to save own life
mats: was this socat thing even
rsa?
thestringpuller: "Here are several reasons you should stop using
RSA and switch to elliptic curve software:"
ascii_butugychag: yes but what precisely is the point of a block cipher that is slower ~and~ bulkier than abused-
rsa.
ascii_butugychag: except that odoacer III meanwhile broke
rsa and collided sha512