Cryptographic Hardness of Random Local FunctionsSurvey

被引：0
|
作者：
Benny Applebaum
机构：
[1] Tel-Aviv University,School of Electrical Engineering
来源：
computational complexity | 2016年 / 25卷
关键词：
94A60; 68Q17; 68P25; constant-depth circuits; cryptography; hash functions; local functions; NC0; one-way functions; pseudorandom generators; public-key encryption;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Constant parallel-time cryptography allows to perform complex cryptographic tasks at an ultimate level of parallelism, namely by local functions that each of their output bits depend on a constant number of input bits. A natural way to obtain local cryptographic constructions is to use random local functions in which each output bit is computed by applying some fixed d-ary predicate P to a randomly chosen d-size subset of the input bits.
引用
收藏
页码：667 / 722
页数：55
相关论文
共 50 条
  • [41] Generation of chaotic random binary sequences for cryptographic applications
    Sheela, S.
    Sathyanarayana, S. V.
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2022, 34 (01):
  • [42] ON THE CONCEPT OF LOCAL HARDNESS IN CHEMISTRY
    BERKOWITZ, M
    GHOSH, SK
    PARR, RG
    JOURNAL OF THE AMERICAN CHEMICAL SOCIETY, 1985, 107 (24) : 6811 - 6814
  • [43] Local hardness: a critical account
    Pratim K. Chattaraj
    Debesh R. Roy
    Paul Geerlings
    Miquel Torrent-Sucarrat
    Theoretical Chemistry Accounts, 2007, 118 : 923 - 930
  • [44] On the hardness of computing the permanent of random matrices
    Feige, U
    Lund, C
    COMPUTATIONAL COMPLEXITY, 1997, 6 (02) : 101 - 132
  • [45] A new approach to local hardness
    Gal, T.
    Geerlings, P.
    De Proft, F.
    Torrent-Sucarrat, M.
    PHYSICAL CHEMISTRY CHEMICAL PHYSICS, 2011, 13 (33) : 15003 - 15015
  • [46] Local hardness: a critical account
    Chattaraj, Pratim K.
    Roy, Debesh R.
    Geerlings, Paul
    Torrent-Sucarrat, Miquel
    THEORETICAL CHEMISTRY ACCOUNTS, 2007, 118 (5-6) : 923 - 930
  • [47] On the applicability of local softness and hardness
    Torrent-Sucarrat, M.
    De Proft, F.
    Ayers, P. W.
    Geerlings, P.
    PHYSICAL CHEMISTRY CHEMICAL PHYSICS, 2010, 12 (05) : 1072 - 1080
  • [48] The infinite source of random sequences for classified cryptographic systems
    Borowski, Mariusz
    2016 INTERNATIONAL CONFERENCE ON MILITARY COMMUNICATIONS AND INFORMATION SYSTEMS (ICMCIS), 2016,
  • [49] Fully digital random bit generators for cryptographic applications
    Bucci, Marco
    Luzzi, Raimondo
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2008, 55 (03) : 861 - 875
  • [50] A cellular automata random number generator for cryptographic applications
    AbdulHameed, Muhab U.
    Eldin, Ayman Mohammad Bahaa
    2007 INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING & SYSTEMS: ICCES '07, 2007, : 101 - 105
12345