Vayasu Pilichindi
Vayasu Pilichindi (transl. Age is Calling) is a 1978 Telugu-language film directed by C. V. Sridhar. It is a remake of his own Tamil film Ilamai Oonjal Aadukirathu (1978).[2]
| Vayasu Pilichindi | |
|---|---|
 | |
| Directed by | C. V. Sridhar |
| Produced by | Kannaiyaa |
| Written by | C. V. Sridhar |
| Starring | |
| Music by | Ilaiyaraaja |
| Cinematography | P. S. Nivas |
| Edited by | Kottagiri Gopalrao |
Release date | 4 August 1978[1] |
Running time | 141 minutes |
| Country | India |
| Language | Telugu |
Plot
Murali and Prabhu, two best friends fall in love with the same woman, Padma, working in the same firm. But Jayanthi, a subordinate also likes Prabhu. However, one incident changes all their lives.
Cast
- Kamal Haasan as Prabhu
- Rajinikanth as Murali
- Sripriya as Padma
- Jayachitra as Jayanthi
Production
Vayasu Pilichindi is a remake of C. V. Sridhar's own Tamil film Ilamai Oonjal Aadukirathu (1978). The same cast of that version were retained for the Telugu remake.[2]
Soundtrack
The soundtrack was composed by Ilaiyaraaja.[3]
- "Ilaage Ulaavo Saraagamaadithe" (lyrics: Arudra; singers:S. P. Balasubrahmanyam and P. Susheela)
- "Jeevitha Madhusaala"
- "Maate Marichave Chilakamma" (lyrics: Arudra; singer: S. P. Balasubrahmanyam)
- "Muthyamalle Merisipoye Mallemogga" (lyrics: Arudra; singer: S. P. Balasubrahmanyam)
- "Nuvvadigindi Enaadaina Kaadhannaana" (lyrics: Arudra; singer: Vani Jayaram)
gollark: <@!206233133228490752> Sorry to bother you, but keypairs generated by `ccecc.py` and the ECC library in use in potatOS appear to have different-length private and public keys, which is a problem.EDIT: okay, apparently it's because I've been accidentally using a *different* ECC thing from SMT or something, and it has these parameters instead:```---- Elliptic Curve Arithmetic---- About the Curve Itself-- Field Size: 192 bits-- Field Modulus (p): 65533 * 2^176 + 3-- Equation: x^2 + y^2 = 1 + 108 * x^2 * y^2-- Parameters: Edwards Curve with c = 1, and d = 108-- Curve Order (n): 4 * 1569203598118192102418711808268118358122924911136798015831-- Cofactor (h): 4-- Generator Order (q): 1569203598118192102418711808268118358122924911136798015831---- About the Curve's Security-- Current best attack security: 94.822 bits (Pollard's Rho)-- Rho Security: log2(0.884 * sqrt(q)) = 94.822-- Transfer Security? Yes: p ~= q; k > 20-- Field Discriminant Security? Yes: t = 67602300638727286331433024168; s = 2^2; |D| = 5134296629560551493299993292204775496868940529592107064435 > 2^100-- Rigidity? A little, the parameters are somewhat small.-- XZ/YZ Ladder Security? No: Single coordinate ladders are insecure, so they can't be used.-- Small Subgroup Security? Yes: Secret keys are calculated modulo 4q.-- Invalid Curve Security? Yes: Any point to be multiplied is checked beforehand.-- Invalid Curve Twist Security? No: The curve is not protected against single coordinate ladder attacks, so don't use them.-- Completeness? Yes: The curve is an Edwards Curve with non-square d and square a, so the curve is complete.-- Indistinguishability? No: The curve does not support indistinguishability maps.```so I might just have to ship *two* versions to keep compatibility with old signatures.
gollark: > 2. precompilation to lua bytecode and compressionThis was considered, but the furthest I went was having some programs compressed on disk.
gollark: > 1. multiple layers of sandboxing (a "system" layer that implements a few things, a "features" layer that implements most of potatOS's inter-sandboxing API and some features, a "process manager" layer which has inter-process separation and ways for processes to communicate, and a "BIOS" layer that implements features like PotatoBIOS)Seems impractical, although it probably *could* fix a lot of problems
gollark: There's a list.
gollark: Lots of them.
References
- Sreekanth, Gayathri (2008). The Name is Rajinikanth. Om Books International. p. 369.
- Ramachandran, Naman (2012). Rajinikanth: The Definitive Biography. Penguin Books. p. 79.
- "Vayasu Pilichindi". AVDigital. Retrieved 30 November 2019.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.