Results 41 to 50 of about 23,280,321 (280)
Efficient algorithms for pairing-based cryptosystems [PDF]
, 2002 We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In particular, our techniques improve pairing evaluation speed by a factor of about 55 compared to previously known methods in characteristic 3, and attain ...
B. Lynn +13 more
core +1 more source
Mathematics, 2020 We define a family of codes called twisted Hermitian codes, which are based on Hermitian codes and inspired by the twisted Reed–Solomon codes described by Beelen, Puchinger, and Nielsen. We demonstrate that these new codes can have high-dimensional Schur
Austin Allen +6 more
doaj +1 more source
Provably secure identity-based identification and signature schemes from code assumptions. [PDF]
PLoS ONE, 2017 Code-based cryptography is one of few alternatives supposed to be secure in a post-quantum world. Meanwhile, identity-based identification and signature (IBI/IBS) schemes are two of the most fundamental cryptographic primitives, so several code-based IBI/
Bo Song, Yiming Zhao
doaj +1 more source
, 2021 In this thesis work, I will be presenting the idea of quantum computing and technology, and the future of cryptography and how it will be affected by powerful quantum computers, and the impact of post-quantum cryptography on hardware and software scale ...
Younan, Mina Elkis Yakoub Labib
core
FPGA based remote code integrity verification of programs in distributed embedded systems [PDF]
, 2012 The explosive growth of networked embedded systems has made ubiquitous and pervasive computing a reality. However, there are still a number of new challenges to its widespread adoption that include scalability, availability, and, especially, security of ...
Stefano Di Carlo +5 more
core +1 more source
Some Notes on Code-Based Cryptography. [PDF]
, 2015 This thesis presents new cryptanalytic results in several areas of coding-based cryptography. In addition, we also investigate the possibility of using convolutional codes in code-based public-key cryptography. The first algorithm that we present is an information-set decoding algorithm, aiming towards the problem of decoding random linear codes.
openaire +2 more sources
McBits: Fast Constant-Time Code-Based Cryptography [PDF]
, 2013 This paper presents extremely fast algorithms for code-based public-key cryptography, including full protection against timing attacks. For example, at a 2^128 security level, this paper achieves a reciprocal decryption throughput of just 60493 cycles (plus cipher cost etc.) on a single Ivy Bridge core. These algorithms rely on an additive FFT for fast
Daniel J. Bernstein +2 more
openaire +4 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background The Standards for Psychosocial Care for Children with Cancer and Their Families (“Standards”) are evidence‐based guidelines for psychosocial care in pediatric oncology. Care related to the three “Asking and Monitoring” Standards—Assessment of Psychosocial Needs, Assessment of Financial Needs, and Monitoring Neurocognitive Problems ...
Julia B. Tager +8 more
wiley +1 more source
Comparison between the RSA cryptosystem and elliptic curve cryptography [PDF]
, 2010 In the globalization era, cryptography becomes more popular and powerful; in fact it is very important in many areas (i.e. mathematics, computer science, networks, etc).
Abdullah, Kamilah
core
Code-based Post-Quantum Cryptography
, 2021 Cryptography has been used from time immemorial for preserving the confidentiality of data/information in storage or in transit. Thus, cryptography research has also been evolving from the classical Caesar cipher to the modern cryptosystems based on modular arithmetic to the contemporary cryptosystems based on quantum computing.
Chithralekha Balamurugan +3 more
openaire +2 more sources