Titlebook: Number-Theoretic Methods in Cryptology; First International Jerzy Kaczorowski,Josef Pieprzyk,Jacek Pomyka?a Conference proceedings 2018 Sp

amyloid

果仁

Explicit Formula for Gram-Schmidt Vectors in LLL with Deep Insertions and Its Applications and LLL with deep insertions (DeepLLL). In LLL and DeepLLL, at every time to replace a lattice basis, we need to recompute the Gram-Schmidt orthogonalization (GSO) for the new basis. Compared with LLL, the form of the new GSO vectors is complicated in DeepLLL, and no formula has been known. In this

Infiltrate

燈泡

Ptosis

The Measures of Pseudorandomness and the NIST Tests many papers and many constructions have been given along these lines. In this paper the connection between the new measures and the NIST tests is analyzed. It is shown that finite binary sequences possessing strong pseudorandom properties in terms of these new measures usually also pass or nearly p

subacute

On the Cross-Combined Measure of Families of Binary Lattices and Sequences of binary lattices with optimal or nearly optimal cross-combined measures are presented. These results are also strongly related to the one-dimensional case: An easy method is shown obtaining strong constructions of families of binary sequences with nearly optimal cross-correlation measures based o

褻瀆

寄生蟲(chóng)

Generation and Implementation of Cryptographically Strong Elliptic Curvese elliptic curves have to satisfy, together with their justification and some relevant examples of elliptic curves. We implemented modular arithmetic in a finite field, the operations on an elliptic curve and the basic cryptographic protocols.

uveitis

A Novel RSA-Like Cryptosystem Based on a Generalization of the Rédei Rational Functionsrational functions. We then exploit these results to construct a novel RSA-like scheme that is more secure than RSA in broadcast applications. Moreover, our scheme is robust against the Wiener attack and against other kind of attacks that exploit the knowledge of a linear relation occurring between two plaintexts.

身心疲憊

Detection of Primes in the Set of?Residues of Divisors of a Given Numberconditions and show that there are plenty of such numbers. One interesting feature of the proof is that it relies on additive combinatorics. We also give some application of this result to algorithmic number theory.