Results 1 ... 85 found in all logged channels for 'fermat'
(asciilifeform) asciilifeform: phf: imho verisimilitude runs a very serious risk of ending up as an 'why won't they read my elementary proof of fermat's' fella
(trilema) mircea_popescu: in fact m-r is a sorta upgraded fermat
(trilema) asciilifeform: ( it's fermat that chokes on'em )
(trilema) asciilifeform: this aint exactly fermat-grade problem
(trilema) asciilifeform: rright. but gotta point out, 'let'em make the basics, we'll make mpexes and fermat's theorems' dunwork if taken entirely literally.
(trilema) mircea_popescu: koch application of fermat DIRECTLY maps on the above "random definition".
(trilema) asciilifeform: mircea_popescu: for bonus lulz, there is also the 'duct tape' hypothesis. iirc in zimmerman's orig. 'pgp', ~straight fermat~ ( carmichaelizable! ) was used as the sole litmus.
(trilema) mircea_popescu: koch is implementing fermat because fermat ~is~ the test, not because fermat ~does~ something.
(trilema) a111: Logged on 2019-01-30 16:43 asciilifeform: ( as i understand, in koch world fermat test uses ~exactly same # of cycles as 1 shot of m-r )
(trilema) asciilifeform: ( as i understand, in koch world fermat test uses ~exactly same # of cycles as 1 shot of m-r )
(trilema) asciilifeform: diana_coman: i recently reread your series re primes, and found http://ossasepia.com/2018/01/04/eucrypt-chapter-4-random-prime-number-generator/#selection-111.241-117.155 interesting -- koch fermats 1st, but this dun actually save any cpu under any circumstances. pretty lulzy.
(trilema) asciilifeform: mircea_popescu: the 'distinction' ? near as i can tell, it's the 'narrative fiction' where 'you can assume that rng works'. recall the earlier entomo-gem where 'why not use fermat litmus, piano will fall on you before you see carmichael num' etc
(trilema) mircea_popescu: asciilifeform the abstract claim, "one random round of fermat provides same error probability as 32 rounds of m-r" is pretty striking.
(trilema) mircea_popescu: anyway, but "learn fermat -- apply when last digit of exponent" list of ~fiction tropes~ is nothing more than that : teaching kids how to "know the tells" of the (again -- remarkably fucking inept) "he liked science" illiterate storyteller.
(trilema) asciilifeform: ( these are trivial if you know fermat )
(trilema) asciilifeform: ( fermat himself, funnily enuff , and in his usual habit -- never gave even 1 )
(trilema) asciilifeform: speaking of old maffs, turns out there's at least 11 classic proofs of fermat's 'little' theorem, incl. a combinatorial one.
(trilema) asciilifeform: ( the 'intuitive' cure, 'let the primes be a sequence of primes, no prime used twice' is still breakable with fermat )
(trilema) asciilifeform: upstack : http://btcbase.org/log/2018-06-23#1829075 << for the record , it withstood (not much surprise) phuctoring (incl. fermat etc)
(trilema) asciilifeform: fermat, and conventional , both
(trilema) mircea_popescu: asciilifeform, anyway, i suppose after the jurov set is also fed a new fermatting is in order ? considering there's a lot of new numbers to play with.
(trilema) asciilifeform: ( 1000000/shots/key fermat took ~3day and found nuffin new )
(trilema) asciilifeform: ( incidentally , fermat is great 'torture test' for the box, ~100% cpu utilization for days. )
(trilema) asciilifeform: however if no one objects i will re-enable crunching tomorrow morning, after fermat is expected to be finished.
(trilema) asciilifeform took the expected day or 2 of pause, chance, to run fermat
(trilema) a111: Logged on 2018-05-04 03:55 asciilifeform: also a 32cpu/1mil shots/key fermatron is running
(trilema) asciilifeform: also a 32cpu/1mil shots/key fermatron is running
(trilema) asciilifeform: iirc i originally introduced phuctor as 'catalogue of rsa keys which are inexpensively breakable'. for said formulation it does not matter precisely ~how~, if tomorrow i conceive of a wholly novel inexpensive break, i will apply it to phuctor with the others ( as i applied classical methods, gcd, bernsteinistic gcd, fermat, ( in the worx...) lenstra , etc . )
(trilema) asciilifeform: ( recall the fermat proof thread )
(trilema) asciilifeform: !#s elementary fermat
(trilema) asciilifeform: !#s fermat crackpots
(trilema) mircea_popescu: come along and prove, say . . . Fermat's Last Theorem.
(trilema) mircea_popescu: which fits in SOME heads, liek galois' in 1800s or the fermat thing recently.
(trilema) mircea_popescu: you understand, for every fermat solver there's five trillion collectors, like http://trilema.com/2017/on-trisection-a-humble-contribution/
(trilema) PeterL: so yes, using the fermat test would be bad
(trilema) PeterL: I tested the fermat test, and with 100 numbers of 1024 bits deemed prime by the fermat test, 50 were found to be composite by miller-rabin
(trilema) asciilifeform: i understand what is meant by 'prototype', but an rsatron (ignoring for a moment the constant-time thing) that uses fermat's primality test as the sole probe, is analogous to a grenade with a half second fuse
(trilema) PeterL: fermat primality test
(trilema) mircea_popescu: asciilifeform but the proposition that a proof for fermat's conjecture is not worth reading past page four is not factual.
(trilema) asciilifeform: the ~same folx are to this day sending fermat proofs 3pgs long, with rotten algebra, as before wiles..
(trilema) asciilifeform: 'elementary proofs of fermat's last'
(trilema) mircea_popescu reread his own version of dudley. are you aware fermat theorem proofs is in his list ?
(trilema) a111: Logged on 2017-06-28 21:15 asciilifeform: in other noose, in 6236676 phuctor moduli, still just the same old 2 fermat-factorables as 6 mo. ago.
(trilema) asciilifeform: ( 10,000 shots of fermatola / per.; took ~40 min. )
(trilema) asciilifeform: in other noose, in 6236676 phuctor moduli, still just the same old 2 fermat-factorables as 6 mo. ago.
(trilema) asciilifeform: mind is a slippery thing. what curious boy was not convinced that he was 'this-close' to elementary proof of fermat's.
(trilema) phf: they said the same about fermat's last theorem!
(trilema) asciilifeform: (or even mundane human problems like 'where to find a more decent flat' , because ~there~ , just as with fermat conjecture, there is no guarantee that you aren't facing brick wall, on account of personal inadequacy. whereas the crossword is guaranteed to yield to modest effort. it is sex with doll.)
(trilema) asciilifeform: aaaaha, lolk, it was what i read, what was actually there was proof of fermat's conjecture...
(trilema) asciilifeform: via fermat probe.
(trilema) asciilifeform: Framedragger: we have fermat test.
(trilema) asciilifeform: fromphuctor: in case you didn't know - fermat's method is not an effective way to attack a properly-generated rsa modulus
(trilema) asciilifeform: if you're speaking of the latest experiment, we used fermat's method
(trilema) mircea_popescu: asciilifeform btw re the fermat discussion, i wonder if anyone ever did a proper review of rsa code for lattice and fermat-closeness weakness in p,q generation.
(trilema) asciilifeform: ;;later tell mircea_popescu fermat with 100,000 iter. / mod. (3518444 mods) ran to completion. found still just the 2.
(trilema) asciilifeform: why it was necessary to put this in a strictly fermat-breakable artificial key, vs. some simple case of gcd or 8ball, i do not know - write to hitler and ask him, not me.
(trilema) asciilifeform: mircea_popescu: the total unique count (fermat with 10,000 iterations / modulus) is 2.
(trilema) asciilifeform: btw we dun have bbet but does anyone want to unofficially bet how many fermat bangs in 3518444 moduli ?
(trilema) a111: Logged on 2016-06-19 03:45 asciilifeform: which is to say, the tokamak folks are about as interested in desktop, $1000 fusion (of ~whatever temperatures~) as the maths dept at your uni is interested in elementary proof of fermat, or the software 'industry' - in 'fits in head', etc.
(trilema) asciilifeform: which is to say, the tokamak folks are about as interested in desktop, $1000 fusion (of ~whatever temperatures~) as the maths dept at your uni is interested in elementary proof of fermat, or the software 'industry' - in 'fits in head', etc.
(trilema) asciilifeform: for one thing, you need to have the solution to a case of problem to use it as crypto. otherwise you could 'elementary proof of fermat's conjecture is the key!'
(trilema) mircea_popescu: the quadratic residuity issue makes me think fermat primes should be somewhere involved in all this
(trilema) mircea_popescu: incidentally, i suspect a lot of the mommentum for the entire "oh broken factors" comes from historical accident. it was in point of fact research into elliptic curves that yielded the fermat proof,
(trilema) mircea_popescu: i expect if ever resolved it'll be like the fermat thing.
(trilema) ascii_field: see also the maths profs shredding unsolicited fermat 'proofs' unread
(trilema) phf: that would be second famous margin note, after fermat's
(trilema) danielpbarron: that p is apparently the 6th "Fermat number"
(trilema) mod6: by the end of the night i was digging into prime selection. gnupg does fast fermat checks in several places, but im starting to wonder if it wouldn't also be benificial to just check against a list of "Carmichael numbers"
(trilema) ben_vulpes: <asciilifeform> [] probably quite a few folks. but the thing that distinguishes fermat from wot is that wot needs to be at least quasi-'hot' to really work as intended, imho. << strikes me that a series of "rating" messages should be parsed to build a rating history.
(trilema) asciilifeform: probably quite a few folks. but the thing that distinguishes fermat from wot is that wot needs to be at least quasi-'hot' to really work as intended, imho.
(trilema) asciilifeform: let's ask - how many folks reading this have archived, e.g., the works of fermat ?
(trilema) asciilifeform: mircea_popescu: america article << are you sure you meant fermat's problem and not poincare's ?
(trilema) mircea_popescu: the fundamntal understanding of this is illustrated by the case made for giving people tenure and shit. research is an activity of the safe, which is why prisons and other emperor of the flies situations aren't conducive to proving the fermat conjecture.
(trilema) mircea_popescu: you telling me the rsa e must be a fermat prime ? why ?
(trilema) asciilifeform: afaik 65537 is largest known fermat prime.
(trilema) asciilifeform: mircea_popescu: fermat primes.
(trilema) mircea_popescu: attempts are no qualification. i attempted to prove fermat's theorem, too
(trilema) mircea_popescu: benkay would you accept the fermat theorem as research ?
Download hourly DB snapshot | Get Source Code