Search engine run on: http://users.monash.edu.au/
Glookbib search for: zz0417
%A J. H. Ellis
%T The possibility of non-secret digital encryption
%I CESG Research Report
%M JAN
%D 1970
%K TR, c1970, c197x, c19xx, zz0417, public key encryption, channel,
key, security, cryptography, communication network, Diffie, Hellman, Merkle,
Ellis, Cocks, Williamson, CESG, GCHQ
%X "[1] The possibility of Non-Secret digital encryption.
J.H.Ellis, CESG Research Report, Jan 1970;
[2] A note on non-secret encryption. C.C.Cocks, Nov 1973"
-- [pdf]['17], was
"... [pdf][retrieved 2015-08-28] ..."
-- [wikip]['17].
(See
"...At GCHQ, by 1975 James Ellis had proved that a symmetric secret-key
system is unnecessary and Clifford Cocks with Malcolm Williamson showed
how such 'public-key cryptography' could be achieved. Until then it was
believed that secure communication was impossible without exchange of a
secret key, with key distribution as a major impediment. With these
discoveries the essential principles were known but were kept secret until
1997. ..."
-- bbc[5/10/2010].)
[Also search for: public key encryption].
%A W. Diffie
%A M. Hellman
%T New directions in cryptography
%J IEEE Trans. on Info. Theory
%V 22
%N 6
%P 644–654
%M NOV
%D 1976
%K jrnl, CACM, ca978, c197x, c19xx, zz0417, public key encryption, channel,
key, security, cryptography, communication network, Diffie, Hellman, Merkle,
Ellis, Cocks, Williamson, GCHQ
%X "Two kinds of contemporary developments in cryptography are examined.
Widening applications of teleprocessing have given rise to a need for new
types of cryptographic systems, which minimize the need for secure key
distribution channels and supply the equivalent of a written signature. This
paper suggests ways to solve these currently open problems. It also discusses
how the theories of communication and computation are beginning to provide
the tools to solve cryptographic problems of long standing."
-- [doi:10.1109/TIT.1976.1055638]['17].
(Also see D-H@[wikip]['17], and
the bbc[24/4/2017].
Also,
"...At GCHQ, by 1975 James Ellis had proved that a symmetric secret-key
system is unnecessary and Clifford Cocks with Malcolm Williamson showed
how such 'public-key cryptography' could be achieved. Until then it was
believed that secure communication was impossible without exchange of a
secret key, with key distribution as a major impediment. With these
discoveries the essential principles were known but were kept secret until
1997. ..."
-- bbc[5/10/2010].)
[Also search for: public key encryption].
%A R. C. Merkle
%T Secure communications over insecure nhannels
%J CACM
%V 21
%N 4
%P 294–299
%M APR
%D 1978
%K jrnl, CACM, ca978, c197x, c19xx, zz0417, public key encryption, channel,
key, security, cryptography, communication network, Diffie Hellman
%X "According to traditional conceptions of cryptographic security, it is
necessary to transmit a key, by secret means, before encrypted massages can
be sent securely. This paper shows that it is possible to select a key over
open communications channels in such a fashion that communications security
can be maintained. A method is described which forces any enemy to expend an
amount of work which increases as the square of the work required of the two
communicants to select the key. The method provides a logically new kind of
protection against the passive eavesdropper. It suggests that further
research on this topic will be highly rewarding, both in a theoretical and
a practical sense."
-- [doi:10.1145/359460.359473]['17].
(Also see D-H@[wikip]['17] and
the bbc[24/4/2017].)
[Also search for: public key encryption].
%A T. Hyla
%A J. Pejas
%T Elliptic curve multiset hash
%J COMPJ
%V 60
%N 4
%P ?-?
%M MAR
%D 2017
%K jrnl, COMPJ, c2017, c201x, c20xx, zz0417, multiset, multi set, hash,
hashing, elliptic curve, ECHM, homomorphic, BLAKE2
%X "A multiset hash fn associates a hash value to arbitrary collections of
objects with possible repetitions. Such a hash fn is said to be homomorphic,
or incremental, when the hash of the union of two collns is easy to compute
from the hashes of the two collns themselves: it is usually their sum under a
suitable group operation. ... tend to be much longer than usual hash fns at
the same security level (e.g. to achieve a collision resistance of 2^128,
they are several thousand bits long, as opposed to 256 bits for usual hash
fns), and they are also quite slow. ... we introduce the Elliptic Curve
Multiset Hash (ECMH), which combines a usual bit string-valued hash fn like
BLAKE2 with an efficient encoding into binary elliptic curves to overcome
both difficulties. On the one hand, the size of ECMH digests is essentially
optimal: 2m-bit hash values provide O(2^m) collision resistance. On the other
hand, we demonstrate a highly-efficient s/w implementation of ECMH, which our
thorough empirical evaluation shows to be capable of processing over
3 million set elts per sec. on a 4 GHz Intel Haswell m/c at the 128 bit
security level ..."
-- [doi:10.1093/comjnl/bxw053]['17].
%A T. Koeman
%A et al ...
%A R. Vermeulen
%T Occupational exposure and amyotrophic lateral sclerosis in a
prospective cohort
%J BMJ
%V ?
%P ?-?
%M MAR
%D 2017
%K jrnl, BMJ, c2017, c201x, c20xx, zz0417, amyotrophic lateral sclerosis, ALS,
motor neurone disease, human health, risk, risks, electrical, magnetic,
field, fields, ELF-MFs, ELFMFs, brain
%X "... within the prospective Netherlands Cohort Study, 58,279 men and 62,573
women aged 55-69 years at enrolment in 1986 were followed up for 17.3 years
on ALS mortality. ... Occupational exposure to solvents, pesticides, metals,
extremely low frequency magnetic fields (ELF-MFs) & electrical shocks was
estimated by means of job exposure matrices (JEMs). ... Occupational exposure
to ELF-MF showed a possible assocn with ALS mortality among men: HR for ever
holding a job with high exposure v. background 2.19 (95% (CI): 1.02 to 4.73)
& HR for the highest tertile of cumulative exposure v. background 1.93
(95% CI 1.05 to 3.55). ... strengthen the evidence suggesting a +ve
association between ELF-MF exposure and ALS. ..."
-- [doi:10.1136/oemed-2016-103780]['17].
%A H. Briggs
%T 'Fake research' comes under scrutiny
%I BBC
%M MAR
%D 2017
%K news, c2017, c201x, c20xx, zz0417, fake research, university, academic,
scientific, research, science, fraud, misconduct, UK, plagiarism,
fabrication, piracy, retraction
%X "... Official data points to about 30 allegations of research misconduct
between 2012 and 2015. However, figures obtained by the BBC under Freedom of
Information rules identified hundreds of allegations over a similar time
period at 23 universities alone. ... at least 300 allegations were reported
at 23 of the 24 research-intensive Russell Group universities between 2011
& 2016 among staff & research students. About a third of allegations of
plagiarism, fabrication, piracy & misconduct were upheld. More than 30
research papers had to be retracted. ..."
-- [bbc][27//3/2017].
[Also search for: academic research misconduct].
%A D. B. Fischer
%A et al ...
%A J. C. Geerling
%T A human brain network derived from coma-causing brainstem lesions
%J Neurology
%V ?
%P ?-?
%M NOV
%D 2016
%K jrnl, c2016, c201x, c20xx, zz0417, human, brain, stem, mind, seat of,
consciousness, rostral dorsolateral pontine tegmentum, anterior insula,
pregenual anterior cingulate cortex, pACC
%X "To characterize a brainstem location specific to coma-causing lesions, & its
functional connectivity network. ... We compared 12 coma-causing brainstem
lesions to 24 control brainstem lesions ... A small region in the rostral
dorsolateral pontine tegmentum was sig. assoc. with coma-causing lesions. In
healthy adults, this brainstem site was functionally connected to the ventral
anterior insula (AI) & pregenual anterior cingulate cortex (pACC). These
cortical areas aligned poorly with previously defined resting-state networks,
better matching the distribution of von Economo neurons. Finally,
connectivity between the AI and pACC was disrupted in patients with disorders
of consciousness, & to a greater degree than other brain networks. ... This
network of brain regions may have a role in the maintenance of human
consciousness."
-- [doi:10.1212/WNL.0000000000003404]['17].
(Also see sci-daily, 4/11/2016 [www]['17].)
[Also search for: mind consciousness].
%A P. Godfrey-Smith
%T Other Minds: The Octopus, the Sea, and the Deep Origins of Consciousness
%I FarrarStrausGiroux
%P 272
%M DEC
%D 2016
%K book, text, c2016, c201x, c20xx, zz0417, brain, mind, minds, intelligence,
consciousness, philosophy, evolution, ET, alien,
cephalopod, octopus, squid, cuttlefish
%X 1st ed 2016; hb us$17; uk us isbn:0374227764; uk us isbn13:978-0374227760.
"... a very distant branch of the tree of life has also sprouted higher
intelligence: the cephalopods, consisting of the squid, the cuttlefish, and
above all the octopus. In captivity, octopuses have been known to identify
individual human keepers, raid neighboring tanks for food, turn off
lightbulbs by spouting jets of water, plug drains, and make daring escapes.
How is it that a creature with such gifts evolved through an evolutionary
lineage so radically distant from our own? What does it mean that evolution
built minds not once but at least twice? The octopus is the closest we will
come to meeting an intelligent alien. What can we learn from the
encounter? ..."
[Also search for: brain mind] and [also search for: octopus] etc..
%A T. Kitamura
%A S. K. Ogawa
%A D. S. Roy
%A T. Okuyama
%A M. D. Morrissey
%A L. M. Smith
%A R. L. Redondo
%A S. Tonegawa
%T Engrams and circuits crucial for systems consolidation of a memory
%J Science
%V 356
%N 6333
%P ?-?
%M APR
%D 2017
%K jrnl, c2017, c201x, c20xx, zz0417, brain, mind, fear, memory, human, biol,
long term, short, episodic, neocortex, prefrontal, hippocampus,
entorhinal cortex, amygdala
%X "Episodic memories initially require rapid synaptic plasticity within the
hippocampus for their formation & are gradually consolidated in neocortical
n/wks for permanent storage. However, the engrams & circuits that support
neocortical memory consolidation have thus far been unknown. We found that
neocortical prefrontal memory engram cells, which are critical for remote
contextual fear memory, were rapidly generated during initial learning
through inputs from both the hippocampal-entorhinal cortex n/wk & the
basolateral amygdala. After their generation, the prefrontal engram cells,
with support from hippocampal memory engram cells, became functionally mature
with time. Whereas hippocampal engram cells gradually became silent with
time, engram cells in the basolateral amygdala, which were necessary for fear
memory, were maintained. Our data provide new insights into the functional
reorganization of engrams & circuits underlying systems consolidation of
memory."
-- [doi:10.1126/science.aam6808]['17].
(Also see the bbc[7/4/2017].)
%A A. Antinori
%A O. L. Carter
%A L. D. Smillie
%T Seeing it both ways: Openness to experience and binocular rivalry suppression
%J J. of Research in Personality
%V 68
%P 15-22
%M JUN
%D 2017
%K jrnl, c2017, c201x, c20xx, zz0417, human, psychology, personality,
openness, binocular rivalry, mixed percept, perception
%X "Openness to experience is characterised by flexible & inclusive cognition.
... investigated whether this extends to basic visual perception, s.t. open
people combine information more flexibly, even at low-levels of perceptual
processing. We used binocular rivalry, where the brain alternates between
perceptual solns & times where neither soln is fully suppressed, mixed
percept. Study 1 showed that openness is +vely assoc. with duration of mixed
percept & ruled out the possibility of response bias. Study 2 showed that
mixed percept increased following a +ve mood induction particularly for open
people. ... openness is linked to differences in low-level visual perceptual
experience. ..."
-- [doi:10.1016/j.jrp.2017.03.005]['17].
%A K. Bringmann
%A P. Gawrychowski
%A S. Mozes
%A O. Weimann
%T Tree edit distance cannot be computed in strongly subcubic time (unless
APSP can)
%J arXiv
%M MAR
%D 2017
%K TR, c2017, c201x, c20xx, zz0417, tree edit distance, DPA,
all pairs shortest paths, APSP
%X "The edit distance between two rooted ordered trees with n nodes labeled from
an alphabet S is the minimum cost of transforming one tree into the other by
a seq. of elementary opns consisting of deleting & relabeling existing nodes,
[&] inserting new nodes. [It] is a well known generalization of string edit
distance. The fastest known alg. for TED runs in cubic O(n^3) time ...
we show that a truly subcubic O(n^(3−eps)) time alg. for TED is
unlikely: For |S|=Omega(n), a truly subcubic alg. for TED implies a truly
subcubic alg. for the all pairs shortest paths problem. For |S|=O(1), a truly
... for TED implies an O(n^(k−eps) alg. for finding a max. weight k-clique.
in terms of lower bounds string ED exhibits the hardness of the strong
exponential time hypothesis [Backurs, Indyk STOC'15] whereas TED exhibits the
hardness of all pairs shortest paths. Our result provides a matching
conditional lower bound for one of the last remaining classic dynamic
programming problems."
-- 1703.08940@[arXiv]['17].
[Also search for: tree edit distance].
%A N. T. Janakiraman
%A A. Vem
%A K. R. Narayanan
%A J.-Francois Chamberland
%T Sub-string/pattern matching in sub-linear time Using a sparse Fourier
transform approach
%J arXiv
%M APR
%D 2017
%K TR, c2017, c201x, c20xx, zz0417, string, strings, pattern, matching, search,
match, matching, approximate
%X "... querying a string ... off length N bits to determine all the locns where
a substring (query) of length M appears either exactly or is within a
Hamming distance of K from the query. We assume that sketches of the original
signal can be computed off line & stored. Using the sparse Fourier transform
computation based approach introduced by Pawar & Ramchandran, we show that
all such matches can be determined with high prob. in sub-linear time. ...
if ... M=O(N^mu) & the # of matches L=O(N^lambda), we show that for
lambda < 1-mu all the matching posns can be determined with a prob. that
approaches 1 as N -> infin for K <= M/6. ... our scheme has a worst-case
comp.complexity that is only O(max{N^(1−mu.log^2(N), N^(mu+lambda).log N}),
[so] can recover all the matching posns in sub-linear time for lambda < 1-mu.
... a substantial improvement over the best known comp.complexity of
O(N^(1−0.359 mu)) for recovering one matching posn by Andoni et al.(2013).
[&] the # of FT coeffs that need to be computed, stored & accessed, i.e., the
sketching complexity of this alg. is only O(N^(1−mu) log N). ..."
-- 1704.07852@[arXiv]['17].