146700+ entries in 0.092s
apeloyee: sieges are generally followed by an assault, unless
th3e besieged surrender;
to hope otherwise is simply suicide
apeloyee: if
the enemy is besieging you and watching you all
the
time, not much you can do
apeloyee: be a
true вредитель and sabotage
the spy device's uplink.
they need a phat one.
apeloyee: and
to detect you, has
to stand next ot you during
transmission of significant number of bits
apeloyee: the enemy doesn't realistically have resource
to stand next
to everyone. see bitcoin: can't make rewriting history impossible, lets make it unprofitable.
☟︎ apeloyee: but also hard
to hear you over all
that noise. hence my "there's a fixed number of bits you can
transmit before detection, assuming given ratio of intended recipient capabilities
to enemy capabilities"
apeloyee: you stipulated detector's across
the street. can do direction finding.
apeloyee: an' if you keep sparking next
to detector across
the street, you will Have Problems. because have
to
transmit enough
to rsa.
apeloyee: you have managed
thus
to
transmit how much?
apeloyee: if stands across
the street, will detect. forget about it.
apeloyee: e.g.balloon
tx'ing can masquerade as
thunder
apeloyee: to a reasonable value, but
there's probably no escape from "keep moving"
☟︎ apeloyee: can just decrease
the chance of detection.
apeloyee: 100kW
transmit only logarithmically more, but detection easiness in proportional
to power
apeloyee: shannon-hartley
theorem. max bit per watt is when you sit far below noise floor
apeloyee: and have your
transmitter move, lest it be detected by correlation attacks.
apeloyee: simpler
to just
transmit 1W over 30MHz. Or 100mW. etc.
apeloyee: again, I have no data, but I suspect you won't be able
to encode much data into it
apeloyee: the
transmitter disguised as motor
apeloyee: Do you have any data as
to how distinguishable defective motors are? e.g. it's probably an impulse filtered with a min-phase filter. whereas fake motor probably won't be.
apeloyee: no reason
to only encode
the signal in difference
then.
apeloyee: didn't you describe a scheme for 1
transmitter? in each
time interval, pick many cryptographically pseudo-random orthogonal waveforms, calculate a weighted sum,
transmit.
the weights encode information. can split into many
transmitters in various places.
apeloyee: but "1
transmitter is visible, 2 are not" i find hard
to believe
apeloyee: i could understand if having 2,3, 4,...
transmitters progressively lowering
the detection chance
apeloyee: well, is CRT nonwell, of cource I can't clain
that CRT is obvious. But I
think you're just allergic
to it
apeloyee: in fact, using evil, heretical software, calculated
that
this
tries ~6.5
times less candidates for ~2048-bit primes compared
to
the pick-random-odd-number
a111: Logged on 2017-10-05 19:40 asciilifeform:
trial division is dog slow vs gcd.
a111: Logged on 2017-10-05 19:38 asciilifeform: for
the initial sieve ~prior~
to miller-rabin
apeloyee: quit flipping from one opinion
to another every few days
apeloyee: do miller-rabin on
the results.
apeloyee: It's a method
to generate a muber not divisible by small primes. Might be still divisible by large ones.
apeloyee: how does it make bank from
the captcha ? << it's just a proof of work. it's not unknown for sci-hub
to ban etire countries also.
a111: Logged on 2017-11-07 17:16 asciilifeform: imho
this is an idiocy
that perma-discredits everyone even
tangentially involved.
apeloyee: ......p_n are independent and uniformly distributed,
then
the probability of
tuple of
these being chosen is
the same (by definition of independence), and because CRT gives a bijection, all outputs are equally likely. did I repeat myself enough?
☟︎ apeloyee: ...then, by
the CRT,
there exists a bijection between all numbers in range [0, primorial-1] not divisible by any primes in
the primorial, and
the
tuples of nonzero remainders from division by
the primes. "numbers in range [0, primorial-1] not divisible by any primes in
the primorial", obviously, includes all primes in said range (except
those in
the primorial). if
the remainders mod 2, 3,...
a111: Logged on 2017-11-07 16:39 asciilifeform: i believe in
the arithmetic, yes. but how
to show
that
the
two conditions i stated, hold ?
a111: Logged on 2017-10-07 21:48 apeloyee:
http://btcbase.org/log/2017-10-05#1721485 << alternatively, can *construct* numbers which don't have very small factors. pick a nonzero remainder mod 2, mod 3, ... mod largest-prime-fit-in-your-primorial and find what number of primorial is congruent
to it using chinese remainder
theorem
a111: Logged on 2017-08-30 15:53 asciilifeform: 13:08 < kanzure> she wants
to control
the access in her own way