default search action
Journal of Mathematical Cryptology, Volume 11
Volume 11, Number 1, March 2017
- Masaya Yasuda, Kazuhiro Yokoyama, Takeshi Shimoyama, Jun Kogure, Takeshi Koshiba:
Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors. 1-24 - Massoud Hadian Dehkordi, Ali Safi:
The complexity of the connected graph access structure on seven participants. 25-35 - Serguei Popov:
On a decentralized trustless pseudo-random number generation algorithm. 37-43 - Eugen Antal, Otokar Grosek, Peter Horák:
On a mnemonic construction of permutations. 45-53
Volume 11, Number 2, June 2017
- Massoud Hadian Dehkordi, Roghayeh Taghizadeh:
Multiple differential-zero correlation linear cryptanalysis of reduced-round CAST-256. 55 - Vishal Saraswat, Rajeev Anand Sahu, Amit K. Awasthi:
A secure anonymous proxy signcryption scheme. 63 - Kishan Chand Gupta, Sumit Kumar Pandey, Indranil Ghosh Ray:
Applications of design theory for the constructions of MDS matrices for lightweight cryptography. 85 - Yao Lu, Liqiang Peng, Santanu Sarkar:
Cryptanalysis of an RSA variant with moduli N=prql. 117
Volume 11, Number 3, September 2017
- Travis Scholl:
Isolated elliptic curves and the MOV attack. 131-146 - Subhabrata Samajder, Palash Sarkar:
Rigorous upper bounds on data complexities of block cipher cryptanalysis. 147-175 - Hassan Jameel Asghar, Mohamed Ali Kâafar:
When are identification protocols with sparse challenges safe? The case of the Coskun and Herley attack. 177-194
Volume 11, Number 4, December 2017
- Ahmed Mohammed, Abdulrahman Alkhelaifi:
RSA: A number of formulas to improve the search for p + q p+q. 195-203 - Dominik Reichl:
Tame logarithmic signatures of abelian groups. 205-214 - Janaka Alawatugoda:
On the leakage-resilient key exchange. 215-269
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.