A current trend of research focuses on artificial intelligence based cryptography which although proposed almost thirty years ago could not attract much attention. Abadi and Anderson’s work adversarial in 2016 rejuvenated the area now building neural networks that are able to learn using idea from Generative Adversarial Networks (GANs). In this paper, we survey most prominent works cover two ma...

A conjugate code pair is defined as a pair of linear codes either of which contains the dual of the other. A conjugate code pair represents the essential structure of the corresponding Calderbank-Shor-Steane (CSS) quantum error-correcting code. It is known that conjugate code pairs are applicable to quantum cryptography. In this work, a polynomial construction of conjugate code pairs is present...

Inthispaper,anovelvisualsecretsharing(VSS)schemeusingQRcodesisinvestigated.Theproposed visualsecretsharingschemebasedonQRcodes(VSSQR)canvisuallyrevealsecretimagebystacking sufficient(shadowimages)sharesaswellasscantheQRcodebyaQRcodereader.OurVSSQR exploitstheerrorcorrectionmechanismintheQRcodestructure,toembedthebitscorresponding ...

This paper surveys the practical benefits and drawbacks of several identitybased encryption schemes based on bilinear pairings. After providing some background on identity-based cryptography, we classify the known constructions into a handful of general approaches. We then describe efficient and fully-secure IBE and IBKEM instantiations of each approach, with reducibility to practice as the mai...

We use the Bateman-Horn conjecture to study the order of the set of Fq-rational points of primitive subgroups that arise in torus-based cryptography. We provide computational evidence to support the heuristics and make some suggestions regarding parameter selection for torus-based cryptography.

11 Summer Science Camp 2012 Report 09 ◇Advanced ICT Research Institute Report on Facility Open House ◇Children’s Day for Visiting Kasumigaseki Report ◇Keihanna Information and Communication Fair 2012 ◇Facility Open House 2012 Prize Winners -Establishes security of pairing-based cryptography and contributes to its standardization as the next-generation cryptographyWorld Record Cryptanalysis of a...

We assemble and reorganize the recent work in the area of hyperelliptic pairings: We survey the research on constructing hyperelliptic curves suitable for pairing-based cryptography. We also showcase the hyperelliptic pairings proposed to date, and develop a unifying framework. We discuss the techniques used to optimize the pairing computation on hyperelliptic curves, and present many direction...

Recently, Ivanov et al. proposed a new approach to construct code-based cryptosystems, namely the $ {\sf IKKR} public-key encryptions (PKE) in International Workshop on Code-Based Cryptography (CBCrypto 2020) [9]. Unlike usual construction encryption schemes which has restrictions Hamming weight of error introduced into ciphertext, allows vectors arbitrary being ciphertext. Using this approach,...