搜索结果: 1-15 共查到“Graphs”相关记录405条 . 查询时间(0.118 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Nonlinear Schrodinger equations on metric graphs
度量图 非线性 薛定谔方程
2023/5/12
This talk will introduce some topics related to the study of nonlinear Schr?dinger equation on metric graphs, and then show the existence result of concentrated solutions to NLS equations on compact g...
“展宏图，觅灵机”图灵班系列讲座第3讲：樊文飞院士解读“Big Graphs”（图）
图灵班 第3讲 樊文飞 Big Graphs 数据库
2023/11/30
2023年2月22日，中国科学院外籍院士、英国皇家学会院士樊文飞教授做客南科大。樊院士主要从事数据库理论与系统方面的研究，此次围绕“大规模图数据（Big Graphs）”主题，与在场师生分享了他对此方面的深刻见解。会议由计算机科学与工程系主任姚新教授主持，副主任王琦副教授、计算机系部分教师、图灵班各年级学生以及部分研究生到场聆听了报告。
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：On the Turán number of theta graphs
θ图 图兰数 图论
2023/4/26
Turán-type problem may be one of central problems in extremal graph theory. Particularly, the Turán number of a cycle attracts much attention. In this talk, we introduce a terminology, that is, theta ...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Symmetry in Cayley graphs
凯莱图 对称性 图论
2023/4/27
Cayley graphs form an important class of vertex-transitive graphs, which have been the object of study for many decades. These graphs admit a group of automorphisms that acts regularly (sharply-transi...
Busy GPUs: Sampling and pipelining method speeds up deep learning on large graphs（图）
GPU 流水线 大型图形 深度学习
2023/6/20
Graphs, a potentially extensive web of nodes connected by edges, can be used to express and interrogate relationships between data, like social connections, financial transactions, traffic, energy gri...
Expander Graphs are Non-Malleable Codes
Non-malleable code Split-state Explicit Constructions
2018/11/8
Any dd-regular graph on nn vertices with spectral expansion λλ satisfying n=Ω(d3log(d)/λ)n=Ω(d3log(d)/λ) yields a O(λ3/2d)O(λ3/2d)-non-malleable code in the split-state model.
Generating Graphs Packed with Paths
Linear cryptanalysis Differential cryptanalysis Linear Approximations
2018/8/21
When designing a new symmetric-key primitive, the designer must show resistance to know attacks. Perhaps most prominent amongst these are linear and differential cryptanalysis. However, it is notoriou...
Ramanujan graphs in cryptography
Post-Quantum Cryptography supersingular isogeny graphs Ramanujan graphs
2018/6/13
In this paper we study the security of a proposal for Post-Quantum Cryptography from both a number theoretic and cryptographic perspective. Charles-Goren-Lauter in 2006 proposed two hash functions bas...
Towards practical key exchange from ordinary isogeny graphs
post-quantum cryptography key exchange elliptic curves
2018/5/28
We revisit the ordinary isogeny-graph based cryptosystems of Couveignes and Rostovtsev–Stolbunov, long dismissed as impractical. We give algorithmic improvements that accelerate key exchange in this f...
Functional Graphs and Their Applications in Generic Attacks on Iterated Hash Constructions
Functional graph Hash-based MAC Hash combiner
2018/5/2
We look into attacks involving iteratively evaluating identical mappings many times. The functional graph of a random mapping also involves iteratively evaluating the mapping. These attacks essentiall...
Supersingular isogeny graphs and endomorphism rings: reductions and solutions
post-quantum cryptography isogeny-based cryptography cryptanalysis
2018/4/26
In this paper, we study several related computational problems for supersingular elliptic curves, their isogeny graphs, and their endomorphism rings. We prove reductions between the problem of path fi...
ON ISOGENY GRAPHS OF SUPERSINGULAR ELLIPTIC CURVES OVER FINITE FIELDS
foundations Supersingular isogeny graphs
2018/2/8
We study the isogeny graphs of supersingular elliptic curves over finite fields, with an emphasis on the vertices corresponding to elliptic curves of jj-invariant 0 and 1728.
Faster Cryptographic Hash Function From Supersingular Isogeny Graphs
Cryptographic hash functions Supersingular elliptic curves Isogeny graphs
2017/12/19
Faster Cryptographic Hash Function From Supersingular Isogeny Graphs.
Hard and easy problems for supersingular isogeny graphs
isogeny-based cryptography cryptanalysis
2017/10/9
We consider the endomorphism ring computation problem for supersingular elliptic curves, constructive versions of Deuring's correspondence, and the security of Charles-Goren-Lauter's cryptographic has...
Forward-Secure Searchable Encryption on Labeled Bipartite Graphs
cryptographic protocols DSSE
2017/7/6
Forward privacy is a trending security notion of dynamic searchable symmetric encryption (DSSE). It guarantees the privacy of newly added data against the server who has knowledge of previous queries....