Cryptography RSA vulnerability when e is particularily large?

---

• RSA vulnerability when e is particularily large?
• Good 521 bit ECC curve for ElGamal implementation
• My interesting task

RSA vulnerability when e is particularily large? Posted: 06 Oct 2018 11:57 AM PDT I'm trying to solve a problem that goes like this: c: 3627012278341906638812055223389930986183534985985788329485858567557776422481803764253822727571579721298297507294021402712610264908031407416536130863074328807753848481071241506052292677974569848935466918445359356828655429344756595758706102715670649052786530127013616969520602108058338174594919786658238254244 n: 56408147735425453769001580679058631793488956756290710409405554427030825848723837389920261733726883964738560861161368073398240019980428844626276432710534329907155342315282276112954512741477124225287943755138234375599478885404610626929884276937517857848674917362363510326343239899011267973451815054982495415687 e: 13003559759934201375437934005206491129225188194058929350829289047157814927789183747912100252882276621439342317933777085507432598713159268575213762384466063887128254080879340183824577621864138933615008301844717727025642074116345682287129320641392013567214116634743103750889601181922862069484721072292458609313 Find m What I'm noticing is that e is large, extremely large. I don't know if the rule of choosing e so that 1 < e < φ(n) is applicable with the e value I'm given. Either way, is there some kind of exploit with an e value this large? ​ Normal values of e are things like 3 or 65537. Does e being this massive number say anything about the rest of the variables (p, q, d, etc)? submitted by /u/iiDatkat [link] [comments]

Good 521 bit ECC curve for ElGamal implementation Posted: 06 Oct 2018 04:19 PM PDT Hello Everyone, I'm writing a demonstration cryptosystem (FinCrypt, I know the name is bad) and was wondering what 521 bit ECC curves are available for use in ECC ElGamal encryption. I am open to using lower bit size curves if they are at least as secure as 4096 bit RSA. I'm using the Weierstrass form, so I need to use a secure, 521 bit key. E.G: y2 = x3 + a4x + a6 Additionaly, how do I take one of the hex-encoded base points in the definition of a curve and turn it into raw python ints suitable for putting in my program? Thanks! submitted by /u/Finianb1 [link] [comments]

My interesting task Posted: 06 Oct 2018 03:20 AM PDT I am novice in cryptography and I have a task that looks like f(x, K1) = K2 f(y, K2) = K1 Is there such a function f() that this equation can solve? x and y are strings that I want to encrypt. K1, K2 - keys submitted by /u/khaskel [link] [comments]

You are subscribed to email updates from Cryptography news and discussions. To stop receiving these emails, you may unsubscribe now.	Email delivery powered by Google
Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States