It is a matter of time before quantum computers will break the cryptosystems like RSA and ECC underpinning today’s internet protocols. As Post-Quantum Cryptography (PQC) low-cost approach compared to others key distribution, National Institute Standards Technology (NIST) has recently reviewed analyzed numerous approaches PQC. PQC candidate, Bit Flipping Key Encapsulation (BIKE) expected be stan...

A scalable built-in self-test (BIST) equipment design method for combinational or full-scan circuits based on a design of a test pattern generator producing vectors detecting 100% of stuck-at faults is proposed in this paper. Basic principles of the proposed BIST design method are similar to well-known and commonly used methods like bit-fixing, bit-flipping, etc. We introduce a new TPG design a...

Low-density parity-check (LDPC) codes have been shown to deliver capacity approaching performance; however, problematic graphical structures (e.g. trapping sets) in the Tanner graph of some LDPC codes can cause high error floors in bit-errorratio (BER) performance under conventional sum-product algorithm (SPA). This paper presents a serial concatenation scheme to avoid the trapping sets and to ...

<span lang="EN-US">For low density parity check (LDPC) decoding, hard-decision algorithms are sometimes more suitable than the soft-decision ones. Particularly in high throughput and speed applications. However, there exists a considerable gap performances between these two classes of favor algorithms. In order to reduce this gap, work we introduce new improved versions algorithms, adapta...

Secure two-party parallel coin-flipping is a cryptographic functionality that allows two mutually distrustful parties to agree on a common random bitstring of a certain target length. In coin-flipping into-a-well, one party learns the bit-string and then decides whether to abort or to allow the other party to learn it. It is well known that this functionality can be securely achieved in the ide...

Relativistic protocols have been proposed to overcome some impossibility results in classical and quantum cryptography. In such a setting, one takes the location of honest players into account, and uses the fact that information cannot travel faster than the speed of light to limit the abilities of dishonest agents. For example, various relativistic bit commitment protocols have been proposed [...

In this paper, we propose a new approach to construct a class of check-hybrid generalized low-density parity-check (CHGLDPC) codes which are free of small trapping sets. The approach is based on converting some selected check nodes involving a trapping set into super checks corresponding to a 2-error correcting component code. Specifically, we follow two main purposes to construct the check-hyb...

In this paper, we focus on a special framework for quantum coin flipping protocols, bit-commitment based protocols, within which almost all known protocols fit. We show a lower bound of 1/16 for the bias in any such protocol. We also analyse a sequence of multi-round protocol that tries to overcome the drawbacks of the previously proposed protocols, in order to lower the bias. We show an intric...

in this article, the crystallization of polyethylene is investigated by the modified weighted density approximation. also, a direct correlation function of polyethylene based on the rism theory is used. the free energy of a polyethylene is calculated using the density functional theory. the crystallization and also the solid and liquid densities of polyethylene are calculated and compared with ...